/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:32:00,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:32:00,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:32:00,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:32:00,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:32:00,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:32:00,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:32:00,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:32:00,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:32:00,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:32:00,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:32:00,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:32:00,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:32:00,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:32:00,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:32:00,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:32:00,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:32:00,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:32:00,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:32:00,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:32:00,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:32:00,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:32:00,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:32:00,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:32:00,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:32:00,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:32:00,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:32:00,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:32:00,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:32:00,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:32:00,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:32:00,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:32:00,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:32:00,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:32:00,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:32:00,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:32:00,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:32:00,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:32:00,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:32:00,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:32:00,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:32:00,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:32:00,966 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:32:00,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:32:00,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:32:00,968 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:32:00,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:32:00,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:32:00,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:32:00,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:32:00,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:32:00,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:32:00,969 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:32:00,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:32:00,970 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:32:00,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:32:00,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:32:00,970 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:32:00,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:32:00,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:32:00,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:32:00,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:32:00,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:32:00,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:32:00,972 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:32:01,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:32:01,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:32:01,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:32:01,493 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:32:01,495 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:32:01,496 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-09-04 16:32:01,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e06fe9dc/bfa9722775c24f4794eabce819186203/FLAG2a3e36768 [2020-09-04 16:32:02,182 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:32:02,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-09-04 16:32:02,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e06fe9dc/bfa9722775c24f4794eabce819186203/FLAG2a3e36768 [2020-09-04 16:32:02,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5e06fe9dc/bfa9722775c24f4794eabce819186203 [2020-09-04 16:32:02,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:32:02,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:32:02,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:32:02,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:32:02,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:32:02,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:02,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62eea600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02, skipping insertion in model container [2020-09-04 16:32:02,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:02,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:32:02,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:32:02,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:32:02,837 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:32:02,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:32:02,885 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:32:02,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02 WrapperNode [2020-09-04 16:32:02,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:32:02,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:32:02,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:32:02,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:32:03,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... [2020-09-04 16:32:03,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:32:03,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:32:03,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:32:03,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:32:03,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:32:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:32:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:32:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 16:32:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 16:32:03,120 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-09-04 16:32:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:32:03,121 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-09-04 16:32:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 16:32:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 16:32:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:32:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 16:32:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 16:32:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 16:32:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:32:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-04 16:32:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 16:32:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:32:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 16:32:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-09-04 16:32:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 16:32:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:32:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:32:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 16:32:03,539 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:32:03,540 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:32:03,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:32:03 BoogieIcfgContainer [2020-09-04 16:32:03,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:32:03,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:32:03,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:32:03,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:32:03,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:32:02" (1/3) ... [2020-09-04 16:32:03,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a12968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:32:03, skipping insertion in model container [2020-09-04 16:32:03,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:32:02" (2/3) ... [2020-09-04 16:32:03,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a12968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:32:03, skipping insertion in model container [2020-09-04 16:32:03,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:32:03" (3/3) ... [2020-09-04 16:32:03,557 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-09-04 16:32:03,570 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:32:03,582 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:32:03,605 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:32:03,630 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:32:03,630 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:32:03,630 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:32:03,630 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:32:03,630 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:32:03,630 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:32:03,631 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:32:03,631 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:32:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-09-04 16:32:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 16:32:03,662 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:32:03,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:32:03,664 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:32:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:32:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1490874143, now seen corresponding path program 1 times [2020-09-04 16:32:03,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:32:03,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265006554] [2020-09-04 16:32:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:32:03,761 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:32:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:04,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:32:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:04,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:32:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:04,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 16:32:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:32:04,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265006554] [2020-09-04 16:32:04,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:32:04,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:32:04,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165957895] [2020-09-04 16:32:04,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:32:04,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:32:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:32:04,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:32:04,306 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 10 states. [2020-09-04 16:32:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:32:05,509 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2020-09-04 16:32:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:32:05,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-04 16:32:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:32:05,541 INFO L225 Difference]: With dead ends: 209 [2020-09-04 16:32:05,542 INFO L226 Difference]: Without dead ends: 123 [2020-09-04 16:32:05,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:32:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-04 16:32:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2020-09-04 16:32:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 16:32:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2020-09-04 16:32:05,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 31 [2020-09-04 16:32:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:32:05,644 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2020-09-04 16:32:05,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:32:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2020-09-04 16:32:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:32:05,648 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:32:05,649 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:32:05,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:32:05,649 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:32:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:32:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1249778318, now seen corresponding path program 1 times [2020-09-04 16:32:05,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:32:05,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [189404170] [2020-09-04 16:32:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:32:05,654 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:32:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:06,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:32:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:06,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:32:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:06,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 16:32:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:06,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:32:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:32:06,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [189404170] [2020-09-04 16:32:06,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:32:06,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:32:06,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560233622] [2020-09-04 16:32:06,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:32:06,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:32:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:32:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:32:06,123 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2020-09-04 16:32:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:32:07,888 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2020-09-04 16:32:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:32:07,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-09-04 16:32:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:32:07,895 INFO L225 Difference]: With dead ends: 189 [2020-09-04 16:32:07,895 INFO L226 Difference]: Without dead ends: 187 [2020-09-04 16:32:07,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:32:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-09-04 16:32:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 153. [2020-09-04 16:32:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-04 16:32:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-09-04 16:32:07,936 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 52 [2020-09-04 16:32:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:32:07,937 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-09-04 16:32:07,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:32:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-09-04 16:32:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:32:07,940 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:32:07,940 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:32:07,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:32:07,941 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:32:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:32:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash -448975570, now seen corresponding path program 1 times [2020-09-04 16:32:07,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:32:07,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1659027602] [2020-09-04 16:32:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:32:07,945 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:32:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:08,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:32:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:08,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:32:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:08,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 16:32:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:08,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:32:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:32:08,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1659027602] [2020-09-04 16:32:08,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:32:08,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:32:08,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109598854] [2020-09-04 16:32:08,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:32:08,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:32:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:32:08,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:32:08,141 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 11 states. [2020-09-04 16:32:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:32:08,745 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2020-09-04 16:32:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:32:08,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-09-04 16:32:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:32:08,748 INFO L225 Difference]: With dead ends: 230 [2020-09-04 16:32:08,748 INFO L226 Difference]: Without dead ends: 137 [2020-09-04 16:32:08,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:32:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-09-04 16:32:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-09-04 16:32:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-09-04 16:32:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2020-09-04 16:32:08,782 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 52 [2020-09-04 16:32:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:32:08,782 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2020-09-04 16:32:08,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:32:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-09-04 16:32:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:32:08,785 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:32:08,786 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:32:08,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:32:08,786 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:32:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:32:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1366237712, now seen corresponding path program 1 times [2020-09-04 16:32:08,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:32:08,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29780206] [2020-09-04 16:32:08,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:32:08,791 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:32:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:32:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:32:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 16:32:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:32:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-09-04 16:32:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-09-04 16:32:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 16:32:09,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29780206] [2020-09-04 16:32:09,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:32:09,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:32:09,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556806028] [2020-09-04 16:32:09,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:32:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:32:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:32:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:32:09,177 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 15 states. [2020-09-04 16:32:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:32:10,120 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-09-04 16:32:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:32:10,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-09-04 16:32:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:32:10,123 INFO L225 Difference]: With dead ends: 147 [2020-09-04 16:32:10,123 INFO L226 Difference]: Without dead ends: 87 [2020-09-04 16:32:10,131 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:32:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-09-04 16:32:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2020-09-04 16:32:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 16:32:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-09-04 16:32:10,156 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2020-09-04 16:32:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:32:10,158 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-09-04 16:32:10,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:32:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-09-04 16:32:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 16:32:10,163 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:32:10,163 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:32:10,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:32:10,165 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:32:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:32:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2045890305, now seen corresponding path program 2 times [2020-09-04 16:32:10,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:32:10,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592375709] [2020-09-04 16:32:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:32:10,170 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:32:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:10,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:32:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:10,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:32:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:10,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 16:32:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:10,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:32:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:10,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 16:32:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:32:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:32:10,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592375709] [2020-09-04 16:32:10,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:32:10,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:32:10,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971319296] [2020-09-04 16:32:10,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:32:10,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:32:10,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:32:10,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:32:10,705 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2020-09-04 16:32:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:32:12,037 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-09-04 16:32:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:32:12,038 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-09-04 16:32:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:32:12,039 INFO L225 Difference]: With dead ends: 87 [2020-09-04 16:32:12,039 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:32:12,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:32:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:32:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:32:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:32:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:32:12,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-09-04 16:32:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:32:12,049 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:32:12,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:32:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:32:12,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:32:12,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:32:12,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:32:13,853 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 16:32:14,412 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-09-04 16:32:14,543 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-09-04 16:32:14,679 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-09-04 16:32:14,800 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-09-04 16:32:14,929 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 16:32:15,089 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 16:32:15,261 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 16:32:15,383 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 16:32:15,553 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-09-04 16:32:15,660 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 16:32:15,771 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2020-09-04 16:32:15,941 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-09-04 16:32:16,067 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-09-04 16:32:16,220 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-09-04 16:32:16,461 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-09-04 16:32:16,580 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 16:32:16,849 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 16:32:16,972 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 16:32:17,116 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-09-04 16:32:17,296 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-09-04 16:32:17,439 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 16:32:17,551 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-09-04 16:32:17,708 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-09-04 16:32:17,848 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-09-04 16:32:18,025 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-09-04 16:32:18,274 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-09-04 16:32:18,466 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-09-04 16:32:18,471 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,471 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,472 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:32:18,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,472 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,473 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,473 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,473 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:32:18,473 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-09-04 16:32:18,473 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 39 48) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 39 48) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-09-04 16:32:18,474 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 39 48) the Hoare annotation is: true [2020-09-04 16:32:18,475 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 16:32:18,475 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-09-04 16:32:18,475 INFO L271 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: true [2020-09-04 16:32:18,475 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:32:18,475 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (= (select |#memory_int| |main_#t~malloc10.base|) ((as const (Array Int Int)) 0)) [2020-09-04 16:32:18,475 INFO L271 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: true [2020-09-04 16:32:18,475 INFO L264 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:32:18,475 INFO L271 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: true [2020-09-04 16:32:18,476 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:32:18,476 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 16:32:18,476 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2020-09-04 16:32:18,476 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (and .cse2 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,477 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-09-04 16:32:18,477 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,477 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem8| 0)) (.cse5 (= check_~ai~0 0)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse5 .cse6)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse5 .cse6) .cse1)))) [2020-09-04 16:32:18,478 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,478 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,478 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (= |check_#t~mem1| 0)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x))) (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,478 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,479 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 24) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (= |check_#t~mem2| 0)) (.cse6 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 check_~x)))))) [2020-09-04 16:32:18,479 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (= |check_#t~mem2| 0)) (.cse6 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 check_~x)))))) [2020-09-04 16:32:18,479 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (= |check_#t~mem1| 0)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x))) (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,480 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,480 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 (<= 1 |check_#t~post3|) .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (and (= |check_#t~post3| 0) .cse2 .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,480 INFO L264 CegarLoopResult]: At program point L23-7(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and (= |check_#t~post3| 0) .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4) (or (and .cse1 (<= 1 |check_#t~post3|) .cse2 .cse3 (<= 2 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse4)))) [2020-09-04 16:32:18,481 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,481 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 16:32:18,481 INFO L264 CegarLoopResult]: At program point L23-9(line 23) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 16:32:18,481 INFO L264 CegarLoopResult]: At program point L23-10(line 23) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 16:32:18,482 INFO L264 CegarLoopResult]: At program point L23-11(lines 23 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 16:32:18,482 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-09-04 16:32:18,482 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 16:32:18,482 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-09-04 16:32:18,483 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= |check_#t~mem7| 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4))))) [2020-09-04 16:32:18,483 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= |check_#t~mem7| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and .cse1 (or (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse5) (or (and .cse1 .cse3 .cse4) .cse0 (not (<= 1 |check_#in~x|)) .cse5)))) [2020-09-04 16:32:18,483 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,483 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,484 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,484 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,484 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,485 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 16:32:18,485 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,485 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 16:32:18,485 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 16:32:18,485 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-09-04 16:32:18,486 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,486 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 16:32:18,486 INFO L264 CegarLoopResult]: At program point L14(lines 14 37) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-09-04 16:32:18,487 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 37) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2020-09-04 16:32:18,487 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 37) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (and .cse2 .cse3 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-09-04 16:32:18,487 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-09-04 16:32:18,487 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 16:32:18,487 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 16:32:18,487 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 16:32:18,488 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 16:32:18,488 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 16:32:18,488 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-09-04 16:32:18,488 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-09-04 16:32:18,488 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-09-04 16:32:18,511 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-09-04 16:32:18,516 INFO L168 Benchmark]: Toolchain (without parser) took 15981.28 ms. Allocated memory was 143.7 MB in the beginning and 342.4 MB in the end (delta: 198.7 MB). Free memory was 100.9 MB in the beginning and 90.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 209.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:18,517 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 143.7 MB. Free memory was 119.2 MB in the beginning and 118.8 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. [2020-09-04 16:32:18,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.11 ms. Allocated memory is still 143.7 MB. Free memory was 100.5 MB in the beginning and 90.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:18,530 INFO L168 Benchmark]: Boogie Preprocessor took 156.14 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 90.2 MB in the beginning and 179.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:18,531 INFO L168 Benchmark]: RCFGBuilder took 502.81 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 159.0 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:18,531 INFO L168 Benchmark]: TraceAbstraction took 14966.11 ms. Allocated memory was 202.4 MB in the beginning and 342.4 MB in the end (delta: 140.0 MB). Free memory was 158.0 MB in the beginning and 90.4 MB in the end (delta: 67.5 MB). Peak memory consumption was 207.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:32:18,536 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93 ms. Allocated memory is still 143.7 MB. Free memory was 119.2 MB in the beginning and 118.8 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.11 ms. Allocated memory is still 143.7 MB. Free memory was 100.5 MB in the beginning and 90.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 156.14 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 90.2 MB in the beginning and 179.4 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 502.81 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 159.0 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14966.11 ms. Allocated memory was 202.4 MB in the beginning and 342.4 MB in the end (delta: 140.0 MB). Free memory was 158.0 MB in the beginning and 90.4 MB in the end (delta: 67.5 MB). Peak memory consumption was 207.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 39]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...