/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:03:37,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:03:37,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:03:37,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:03:37,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:03:37,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:03:37,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:03:37,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:03:37,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:03:37,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:03:37,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:03:37,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:03:37,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:03:37,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:03:37,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:03:37,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:03:37,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:03:37,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:03:37,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:03:37,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:03:37,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:03:37,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:03:37,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:03:37,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:03:37,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:03:37,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:03:37,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:03:37,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:03:37,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:03:37,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:03:37,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:03:37,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:03:37,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:03:37,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:03:37,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:03:37,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:03:37,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:03:37,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:03:37,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:03:37,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:03:37,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:03:37,106 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:03:37,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:03:37,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:03:37,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:03:37,121 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:03:37,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:03:37,122 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:03:37,122 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:03:37,122 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:03:37,122 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:03:37,122 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:03:37,122 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:03:37,123 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:03:37,123 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:03:37,123 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:03:37,123 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:03:37,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:03:37,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:03:37,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:03:37,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:03:37,124 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:03:37,124 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:03:37,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:03:37,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:03:37,125 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:03:37,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:03:37,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:03:37,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:03:37,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:03:37,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:03:37,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:03:37,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:03:37,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:03:37,306 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:03:37,306 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:03:37,307 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:03:37,373 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_c8oFm6/tmp/27b5e191ac8642ab9eff9d55953ccbec/FLAG8fc8effa4 [2020-07-01 13:03:37,714 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:03:37,714 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:03:37,715 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:03:37,721 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_c8oFm6/tmp/27b5e191ac8642ab9eff9d55953ccbec/FLAG8fc8effa4 [2020-07-01 13:03:38,116 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_c8oFm6/tmp/27b5e191ac8642ab9eff9d55953ccbec [2020-07-01 13:03:38,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:03:38,129 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:03:38,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:03:38,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:03:38,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:03:38,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f389e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38, skipping insertion in model container [2020-07-01 13:03:38,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:03:38,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:03:38,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:03:38,394 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:03:38,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:03:38,426 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:03:38,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38 WrapperNode [2020-07-01 13:03:38,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:03:38,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:03:38,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:03:38,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:03:38,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:03:38,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:03:38,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:03:38,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:03:38,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:03:38,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:03:38,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:03:38,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:03:38,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:03:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:03:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:03:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:03:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:03:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:03:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:03:38,830 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:03:38,830 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:03:38,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:38 BoogieIcfgContainer [2020-07-01 13:03:38,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:03:38,835 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:03:38,835 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:03:38,837 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:03:38,838 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:38" (1/1) ... [2020-07-01 13:03:38,851 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 41 edges [2020-07-01 13:03:38,853 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:03:38,853 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:03:38,854 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:03:38,854 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:03:38,856 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:03:38,857 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:03:38,857 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:03:38,881 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:03:38,920 INFO L200 BlockEncoder]: SBE split 21 edges [2020-07-01 13:03:38,925 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:03:38,927 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:03:38,958 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 13:03:38,961 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:03:38,962 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:03:38,963 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:03:38,963 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:03:38,964 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:03:38,964 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 60 edges [2020-07-01 13:03:38,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:38 BasicIcfg [2020-07-01 13:03:38,965 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:03:38,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:03:38,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:03:38,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:03:38,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:03:38" (1/4) ... [2020-07-01 13:03:38,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a704727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:03:38, skipping insertion in model container [2020-07-01 13:03:38,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (2/4) ... [2020-07-01 13:03:38,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a704727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:03:38, skipping insertion in model container [2020-07-01 13:03:38,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:38" (3/4) ... [2020-07-01 13:03:38,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a704727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:38, skipping insertion in model container [2020-07-01 13:03:38,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:38" (4/4) ... [2020-07-01 13:03:38,973 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:03:38,984 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:03:38,991 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-07-01 13:03:39,005 INFO L251 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-07-01 13:03:39,029 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:03:39,029 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:03:39,029 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:03:39,029 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:03:39,029 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:03:39,029 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:03:39,030 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:03:39,030 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:03:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-01 13:03:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:03:39,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:39,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:03:39,052 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:39,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash 112313, now seen corresponding path program 1 times [2020-07-01 13:03:39,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:39,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829983565] [2020-07-01 13:03:39,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:39,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829983565] [2020-07-01 13:03:39,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:39,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:39,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842062466] [2020-07-01 13:03:39,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:39,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,250 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-01 13:03:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:39,375 INFO L93 Difference]: Finished difference Result 64 states and 111 transitions. [2020-07-01 13:03:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:39,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:03:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:39,388 INFO L225 Difference]: With dead ends: 64 [2020-07-01 13:03:39,388 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:03:39,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:03:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:03:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:03:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2020-07-01 13:03:39,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 3 [2020-07-01 13:03:39,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:39,430 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2020-07-01 13:03:39,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2020-07-01 13:03:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:03:39,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:39,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:03:39,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:03:39,433 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:39,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash 112406, now seen corresponding path program 1 times [2020-07-01 13:03:39,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:39,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699435516] [2020-07-01 13:03:39,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:39,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699435516] [2020-07-01 13:03:39,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:39,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:39,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109739119] [2020-07-01 13:03:39,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:39,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:39,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,496 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand 3 states. [2020-07-01 13:03:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:39,578 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2020-07-01 13:03:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:39,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:03:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:39,580 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:03:39,580 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:03:39,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:03:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:03:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:03:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2020-07-01 13:03:39,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 3 [2020-07-01 13:03:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:39,586 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2020-07-01 13:03:39,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2020-07-01 13:03:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:03:39,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:39,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:03:39,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:03:39,588 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash 112408, now seen corresponding path program 1 times [2020-07-01 13:03:39,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:39,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799520193] [2020-07-01 13:03:39,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:39,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799520193] [2020-07-01 13:03:39,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:39,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:39,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783671575] [2020-07-01 13:03:39,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:39,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:39,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:39,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,635 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 3 states. [2020-07-01 13:03:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:39,702 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2020-07-01 13:03:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:39,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:03:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:39,703 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:03:39,704 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:03:39,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:03:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:03:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:03:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2020-07-01 13:03:39,709 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 3 [2020-07-01 13:03:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:39,709 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-07-01 13:03:39,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2020-07-01 13:03:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:03:39,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:39,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:03:39,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:03:39,710 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash 112409, now seen corresponding path program 1 times [2020-07-01 13:03:39,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:39,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315823881] [2020-07-01 13:03:39,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:39,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315823881] [2020-07-01 13:03:39,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:39,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:39,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058631138] [2020-07-01 13:03:39,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:39,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:39,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,751 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 3 states. [2020-07-01 13:03:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:39,820 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2020-07-01 13:03:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:39,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:03:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:39,822 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:03:39,822 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 13:03:39,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 13:03:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 13:03:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 13:03:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2020-07-01 13:03:39,827 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 3 [2020-07-01 13:03:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:39,827 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2020-07-01 13:03:39,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2020-07-01 13:03:39,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:39,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:39,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:39,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:03:39,828 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 3483443, now seen corresponding path program 1 times [2020-07-01 13:03:39,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:39,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311063784] [2020-07-01 13:03:39,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:39,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311063784] [2020-07-01 13:03:39,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:39,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:39,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441934856] [2020-07-01 13:03:39,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:39,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:39,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,867 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 3 states. [2020-07-01 13:03:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:39,933 INFO L93 Difference]: Finished difference Result 29 states and 45 transitions. [2020-07-01 13:03:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:39,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:39,934 INFO L225 Difference]: With dead ends: 29 [2020-07-01 13:03:39,935 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 13:03:39,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 13:03:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 13:03:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 13:03:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2020-07-01 13:03:39,939 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 4 [2020-07-01 13:03:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:39,939 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. [2020-07-01 13:03:39,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. [2020-07-01 13:03:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:39,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:39,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:39,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:03:39,940 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash 3483445, now seen corresponding path program 1 times [2020-07-01 13:03:39,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:39,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669180209] [2020-07-01 13:03:39,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:39,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669180209] [2020-07-01 13:03:39,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:39,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:39,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194173019] [2020-07-01 13:03:39,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:39,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:39,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:39,990 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 3 states. [2020-07-01 13:03:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:40,073 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. [2020-07-01 13:03:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:40,074 INFO L225 Difference]: With dead ends: 25 [2020-07-01 13:03:40,075 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:03:40,075 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:03:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 13:03:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 13:03:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-07-01 13:03:40,079 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 4 [2020-07-01 13:03:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:40,079 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-01 13:03:40,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-01 13:03:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:03:40,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:40,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:40,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:03:40,080 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 107985346, now seen corresponding path program 1 times [2020-07-01 13:03:40,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:40,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90298845] [2020-07-01 13:03:40,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:40,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90298845] [2020-07-01 13:03:40,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:40,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:40,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728046087] [2020-07-01 13:03:40,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:40,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,111 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 3 states. [2020-07-01 13:03:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:40,159 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-01 13:03:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:40,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:03:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:40,160 INFO L225 Difference]: With dead ends: 21 [2020-07-01 13:03:40,160 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 13:03:40,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 13:03:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 13:03:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 13:03:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2020-07-01 13:03:40,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 5 [2020-07-01 13:03:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:40,164 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-01 13:03:40,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-01 13:03:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:03:40,165 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:40,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:40,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:03:40,166 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash 107985348, now seen corresponding path program 1 times [2020-07-01 13:03:40,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:40,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852491577] [2020-07-01 13:03:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:40,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852491577] [2020-07-01 13:03:40,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:40,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:40,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190825501] [2020-07-01 13:03:40,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:40,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,196 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 3 states. [2020-07-01 13:03:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:40,225 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-01 13:03:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:40,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:03:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:40,227 INFO L225 Difference]: With dead ends: 21 [2020-07-01 13:03:40,227 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 13:03:40,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 13:03:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 13:03:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 13:03:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-01 13:03:40,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2020-07-01 13:03:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:40,231 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-01 13:03:40,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-01 13:03:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:03:40,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:40,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:40,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:03:40,233 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:03:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 107985349, now seen corresponding path program 1 times [2020-07-01 13:03:40,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:40,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090222376] [2020-07-01 13:03:40,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:40,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090222376] [2020-07-01 13:03:40,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:40,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:40,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850642007] [2020-07-01 13:03:40,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:40,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,270 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2020-07-01 13:03:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:40,298 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-01 13:03:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:40,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:03:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:40,299 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:03:40,299 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:03:40,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:03:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:03:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:03:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:03:40,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:03:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:40,301 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:03:40,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:03:40,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:03:40,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:03:40,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:03:40,341 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,341 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,342 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,342 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:03:40,342 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:03:40,342 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:40,343 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point L14(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:40,344 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:03:40,345 INFO L264 CegarLoopResult]: At program point L14-2(lines 13 17) the Hoare annotation is: (and (= 0 ULTIMATE.start_test_fun_~r_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~r_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~r_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:03:40,345 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:03:40,345 INFO L268 CegarLoopResult]: For program point L14-3(lines 14 17) no Hoare annotation was computed. [2020-07-01 13:03:40,345 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:03:40,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:03:40,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:03:40,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:03:40,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:03:40,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:03:40,346 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:03:40,349 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:03:40,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:03:40,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:03:40,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:40 BasicIcfg [2020-07-01 13:03:40,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:03:40,372 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:03:40,372 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:03:40,376 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:03:40,376 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:40,376 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:03:38" (1/5) ... [2020-07-01 13:03:40,377 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a85589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:03:40, skipping insertion in model container [2020-07-01 13:03:40,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:40,377 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:38" (2/5) ... [2020-07-01 13:03:40,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a85589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:03:40, skipping insertion in model container [2020-07-01 13:03:40,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:40,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:38" (3/5) ... [2020-07-01 13:03:40,378 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a85589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:03:40, skipping insertion in model container [2020-07-01 13:03:40,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:40,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:38" (4/5) ... [2020-07-01 13:03:40,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a85589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:03:40, skipping insertion in model container [2020-07-01 13:03:40,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:03:40,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:40" (5/5) ... [2020-07-01 13:03:40,380 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:03:40,403 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:03:40,403 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:03:40,403 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:03:40,403 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:03:40,403 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:03:40,403 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:03:40,403 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:03:40,404 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:03:40,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-01 13:03:40,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 13:03:40,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:03:40,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:03:40,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:40,419 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:03:40,420 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:03:40,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-01 13:03:40,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 13:03:40,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:03:40,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:03:40,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:03:40,423 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:03:40,429 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [82] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [123] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet8_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~r_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_test_fun_~r_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~r_1 1) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~r_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#in~r=|v_ULTIMATE.start_test_fun_#in~r_1|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_1, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_test_fun_~r, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#in~r, ULTIMATE.start_test_fun_~r_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_~r_ref~0.base, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset] 30#L11true [83] L11-->L11-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 27#L11-1true [79] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 15#L12true [65] L12-->L14-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~r_ref~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~r_ref~0.base_3)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~r_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~r_ref~0.base_3) v_ULTIMATE.start_test_fun_~r_ref~0.offset_3 v_ULTIMATE.start_test_fun_~r_4)))) InVars {ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_3, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_3, ULTIMATE.start_test_fun_~r=v_ULTIMATE.start_test_fun_~r_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 16#L14-2true [2020-07-01 13:03:40,430 INFO L796 eck$LassoCheckResult]: Loop: 16#L14-2true [69] L14-2-->L14: Formula: (and (= (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem3_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 18#L14true [74] L14-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 20#L15true [76] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_5) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~r_ref~0.base_6) v_ULTIMATE.start_test_fun_~r_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~r_ref~0.base_6)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~r_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_6, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_5, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 34#L15-1true [91] L15-1-->L15-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 32#L15-2true [166] L15-2-->L16: Formula: (and (= (store |v_#memory_int_19| v_ULTIMATE.start_test_fun_~r_ref~0.base_17 (store (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~r_ref~0.base_17) v_ULTIMATE.start_test_fun_~r_ref~0.offset_13 (* |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem5_6|))) |v_#memory_int_18|) (<= 0 v_ULTIMATE.start_test_fun_~r_ref~0.offset_13) (= 1 (select |v_#valid_35| v_ULTIMATE.start_test_fun_~r_ref~0.base_17)) (<= (+ v_ULTIMATE.start_test_fun_~r_ref~0.offset_13 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~r_ref~0.base_17))) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_13, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_19|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_17} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_~r_ref~0.offset=v_ULTIMATE.start_test_fun_~r_ref~0.offset_13, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_18|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~r_ref~0.base=v_ULTIMATE.start_test_fun_~r_ref~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, #memory_int] 5#L16true [56] L16-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 3#L16-1true [169] L16-1-->L14-2: Formula: (and (= 1 (select |v_#valid_40| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| (- 1)))) |v_#memory_int_22|)) InVars {#valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_30|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 16#L14-2true [2020-07-01 13:03:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash 108104443, now seen corresponding path program 1 times [2020-07-01 13:03:40,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:40,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7304870] [2020-07-01 13:03:40,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:40,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7304870] [2020-07-01 13:03:40,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:40,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:40,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053813569] [2020-07-01 13:03:40,453 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:03:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash 747672066, now seen corresponding path program 1 times [2020-07-01 13:03:40,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:40,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16645312] [2020-07-01 13:03:40,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:40,461 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-01 13:03:40,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425511028] [2020-07-01 13:03:40,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:03:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:03:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:03:40,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:03:40,644 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-07-01 13:03:40,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:40,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:40,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:40,708 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-01 13:03:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:40,794 INFO L93 Difference]: Finished difference Result 33 states and 53 transitions. [2020-07-01 13:03:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:40,796 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:03:40,800 INFO L168 Benchmark]: Toolchain (without parser) took 2671.19 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 561.7 MB in the beginning and 407.2 MB in the end (delta: 154.5 MB). Peak memory consumption was 190.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,801 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:03:40,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.84 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 561.7 MB in the beginning and 647.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.75 ms. Allocated memory is still 685.8 MB. Free memory was 647.8 MB in the beginning and 645.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,803 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 ms. Allocated memory is still 685.8 MB. Free memory was 645.1 MB in the beginning and 643.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,803 INFO L168 Benchmark]: RCFGBuilder took 344.93 ms. Allocated memory is still 685.8 MB. Free memory was 643.8 MB in the beginning and 620.0 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,804 INFO L168 Benchmark]: BlockEncodingV2 took 130.02 ms. Allocated memory is still 685.8 MB. Free memory was 620.0 MB in the beginning and 609.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,805 INFO L168 Benchmark]: TraceAbstraction took 1405.12 ms. Allocated memory is still 685.8 MB. Free memory was 607.9 MB in the beginning and 454.4 MB in the end (delta: 153.5 MB). Peak memory consumption was 153.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,805 INFO L168 Benchmark]: BuchiAutomizer took 426.83 ms. Allocated memory is still 685.8 MB. Free memory was 454.4 MB in the beginning and 407.2 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:03:40,809 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 41 edges - StatisticsResult: Encoded RCFG 33 locations, 60 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 296.84 ms. Allocated memory was 649.6 MB in the beginning and 685.8 MB in the end (delta: 36.2 MB). Free memory was 561.7 MB in the beginning and 647.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.75 ms. Allocated memory is still 685.8 MB. Free memory was 647.8 MB in the beginning and 645.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.82 ms. Allocated memory is still 685.8 MB. Free memory was 645.1 MB in the beginning and 643.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 344.93 ms. Allocated memory is still 685.8 MB. Free memory was 643.8 MB in the beginning and 620.0 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 130.02 ms. Allocated memory is still 685.8 MB. Free memory was 620.0 MB in the beginning and 609.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1405.12 ms. Allocated memory is still 685.8 MB. Free memory was 607.9 MB in the beginning and 454.4 MB in the end (delta: 153.5 MB). Peak memory consumption was 153.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 426.83 ms. Allocated memory is still 685.8 MB. Free memory was 454.4 MB in the beginning and 407.2 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-07-01 13:03:40,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:03:40,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:03:40,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:03:40,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((0 == r_ref && 1 == \valid[r_ref]) && 4 == unknown-#length-unknown[r_ref]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.2s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 286 SDslu, 5 SDs, 0 SdLazy, 274 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:03:34.866 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_c8oFm6/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:03:41.248 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check