/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-72570d3 [2020-08-22 18:57:05,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 18:57:05,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 18:57:05,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 18:57:05,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 18:57:05,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 18:57:05,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 18:57:05,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 18:57:05,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 18:57:05,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 18:57:05,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 18:57:05,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 18:57:05,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 18:57:05,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 18:57:05,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 18:57:05,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 18:57:05,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 18:57:05,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 18:57:05,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 18:57:05,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 18:57:05,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 18:57:05,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 18:57:05,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 18:57:05,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 18:57:05,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 18:57:05,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 18:57:05,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 18:57:05,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 18:57:05,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 18:57:05,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 18:57:05,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 18:57:05,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 18:57:05,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 18:57:05,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 18:57:05,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 18:57:05,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 18:57:05,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 18:57:05,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 18:57:05,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 18:57:05,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 18:57:05,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 18:57:05,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 18:57:05,716 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 18:57:05,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 18:57:05,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 18:57:05,719 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 18:57:05,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 18:57:05,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 18:57:05,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 18:57:05,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 18:57:05,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 18:57:05,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 18:57:05,721 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 18:57:05,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 18:57:05,721 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 18:57:05,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 18:57:05,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 18:57:05,722 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 18:57:05,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 18:57:05,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 18:57:05,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:57:05,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 18:57:05,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 18:57:05,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 18:57:05,724 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 18:57:06,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 18:57:06,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 18:57:06,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 18:57:06,031 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 18:57:06,032 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 18:57:06,033 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-08-22 18:57:06,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80be3dd43/7b3699c0f347448988595fb9acb77447/FLAG9554fa9c0 [2020-08-22 18:57:06,632 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 18:57:06,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-08-22 18:57:06,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80be3dd43/7b3699c0f347448988595fb9acb77447/FLAG9554fa9c0 [2020-08-22 18:57:06,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80be3dd43/7b3699c0f347448988595fb9acb77447 [2020-08-22 18:57:06,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 18:57:06,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 18:57:06,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 18:57:06,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 18:57:06,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 18:57:06,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:57:06" (1/1) ... [2020-08-22 18:57:06,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f5b696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:06, skipping insertion in model container [2020-08-22 18:57:06,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:57:06" (1/1) ... [2020-08-22 18:57:06,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 18:57:07,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 18:57:07,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:57:07,207 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 18:57:07,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:57:07,248 INFO L208 MainTranslator]: Completed translation [2020-08-22 18:57:07,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07 WrapperNode [2020-08-22 18:57:07,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 18:57:07,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 18:57:07,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 18:57:07,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 18:57:07,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... [2020-08-22 18:57:07,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 18:57:07,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 18:57:07,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 18:57:07,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 18:57:07,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-08-22 18:57:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 18:57:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 18:57:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 18:57:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-08-22 18:57:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-08-22 18:57:07,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 18:57:07,453 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-08-22 18:57:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-08-22 18:57:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-08-22 18:57:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 18:57:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 18:57:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 18:57:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-08-22 18:57:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 18:57:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-08-22 18:57:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-08-22 18:57:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 18:57:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-08-22 18:57:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-08-22 18:57:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-08-22 18:57:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 18:57:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 18:57:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-08-22 18:57:07,785 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 18:57:07,785 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 18:57:07,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:57:07 BoogieIcfgContainer [2020-08-22 18:57:07,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 18:57:07,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 18:57:07,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 18:57:07,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 18:57:07,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:57:06" (1/3) ... [2020-08-22 18:57:07,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696c8e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:57:07, skipping insertion in model container [2020-08-22 18:57:07,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:07" (2/3) ... [2020-08-22 18:57:07,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696c8e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:57:07, skipping insertion in model container [2020-08-22 18:57:07,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:57:07" (3/3) ... [2020-08-22 18:57:07,799 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-08-22 18:57:07,813 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 18:57:07,821 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 18:57:07,837 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 18:57:07,862 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 18:57:07,862 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 18:57:07,863 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 18:57:07,863 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 18:57:07,863 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 18:57:07,863 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 18:57:07,863 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 18:57:07,864 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 18:57:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-08-22 18:57:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-22 18:57:07,898 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:07,899 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-08-22 18:57:07,900 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1490874143, now seen corresponding path program 1 times [2020-08-22 18:57:07,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:07,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22144132] [2020-08-22 18:57:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:07,970 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:08,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:08,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:08,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 18:57:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:57:08,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [22144132] [2020-08-22 18:57:08,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:08,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:57:08,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429089342] [2020-08-22 18:57:08,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:57:08,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:57:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:57:08,440 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 10 states. [2020-08-22 18:57:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:09,475 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2020-08-22 18:57:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 18:57:09,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-08-22 18:57:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:09,491 INFO L225 Difference]: With dead ends: 209 [2020-08-22 18:57:09,491 INFO L226 Difference]: Without dead ends: 123 [2020-08-22 18:57:09,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-08-22 18:57:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-08-22 18:57:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2020-08-22 18:57:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-08-22 18:57:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2020-08-22 18:57:09,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 31 [2020-08-22 18:57:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:09,644 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2020-08-22 18:57:09,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:57:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2020-08-22 18:57:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 18:57:09,661 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:09,661 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-08-22 18:57:09,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 18:57:09,665 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:09,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1249778318, now seen corresponding path program 1 times [2020-08-22 18:57:09,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:09,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091975552] [2020-08-22 18:57:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:09,671 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:10,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:10,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:10,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 18:57:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:10,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 18:57:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:57:10,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091975552] [2020-08-22 18:57:10,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:10,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 18:57:10,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016607281] [2020-08-22 18:57:10,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 18:57:10,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 18:57:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-22 18:57:10,095 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2020-08-22 18:57:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:11,617 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2020-08-22 18:57:11,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 18:57:11,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-08-22 18:57:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:11,628 INFO L225 Difference]: With dead ends: 189 [2020-08-22 18:57:11,628 INFO L226 Difference]: Without dead ends: 187 [2020-08-22 18:57:11,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-08-22 18:57:11,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-08-22 18:57:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 153. [2020-08-22 18:57:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-08-22 18:57:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-08-22 18:57:11,668 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 52 [2020-08-22 18:57:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:11,669 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-08-22 18:57:11,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 18:57:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-08-22 18:57:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 18:57:11,672 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:11,672 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-08-22 18:57:11,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 18:57:11,672 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:11,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash -448975570, now seen corresponding path program 1 times [2020-08-22 18:57:11,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:11,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672440793] [2020-08-22 18:57:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:11,676 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:11,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:11,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:11,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 18:57:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:11,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 18:57:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:57:11,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672440793] [2020-08-22 18:57:11,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:11,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 18:57:11,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43432120] [2020-08-22 18:57:11,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 18:57:11,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 18:57:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-22 18:57:11,829 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 11 states. [2020-08-22 18:57:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:12,300 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2020-08-22 18:57:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 18:57:12,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-08-22 18:57:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:12,306 INFO L225 Difference]: With dead ends: 230 [2020-08-22 18:57:12,306 INFO L226 Difference]: Without dead ends: 137 [2020-08-22 18:57:12,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-08-22 18:57:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-08-22 18:57:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-08-22 18:57:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-08-22 18:57:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2020-08-22 18:57:12,339 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 52 [2020-08-22 18:57:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:12,339 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2020-08-22 18:57:12,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 18:57:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-08-22 18:57:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-08-22 18:57:12,341 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:12,342 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-08-22 18:57:12,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 18:57:12,342 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1366237712, now seen corresponding path program 1 times [2020-08-22 18:57:12,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:12,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031284687] [2020-08-22 18:57:12,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:12,345 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 18:57:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 18:57:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 18:57:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-08-22 18:57:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 18:57:12,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1031284687] [2020-08-22 18:57:12,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 18:57:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052799999] [2020-08-22 18:57:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 18:57:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 18:57:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-08-22 18:57:12,582 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 15 states. [2020-08-22 18:57:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:13,404 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-08-22 18:57:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 18:57:13,405 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-08-22 18:57:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:13,406 INFO L225 Difference]: With dead ends: 147 [2020-08-22 18:57:13,407 INFO L226 Difference]: Without dead ends: 87 [2020-08-22 18:57:13,408 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-08-22 18:57:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-08-22 18:57:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2020-08-22 18:57:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-22 18:57:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-08-22 18:57:13,421 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2020-08-22 18:57:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:13,422 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-08-22 18:57:13,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 18:57:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-08-22 18:57:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-22 18:57:13,424 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:13,424 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-08-22 18:57:13,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 18:57:13,424 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2045890305, now seen corresponding path program 2 times [2020-08-22 18:57:13,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:13,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371823030] [2020-08-22 18:57:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:13,428 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:13,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:13,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:13,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-08-22 18:57:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:13,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-08-22 18:57:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:13,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-08-22 18:57:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 18:57:13,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371823030] [2020-08-22 18:57:13,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:13,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-08-22 18:57:13,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552478548] [2020-08-22 18:57:13,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 18:57:13,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 18:57:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 18:57:13,809 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2020-08-22 18:57:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:15,057 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-08-22 18:57:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 18:57:15,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-08-22 18:57:15,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:15,058 INFO L225 Difference]: With dead ends: 87 [2020-08-22 18:57:15,059 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 18:57:15,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2020-08-22 18:57:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 18:57:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 18:57:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 18:57:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 18:57:15,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-08-22 18:57:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:15,062 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 18:57:15,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 18:57:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 18:57:15,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 18:57:15,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 18:57:15,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 18:57:16,346 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-08-22 18:57:16,551 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-08-22 18:57:16,668 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-08-22 18:57:16,802 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-08-22 18:57:16,963 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-08-22 18:57:17,079 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-08-22 18:57:17,419 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-08-22 18:57:17,535 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2020-08-22 18:57:17,707 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-08-22 18:57:17,838 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-08-22 18:57:17,967 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-08-22 18:57:18,155 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-08-22 18:57:18,479 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-08-22 18:57:18,713 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-08-22 18:57:18,858 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-08-22 18:57:18,992 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-08-22 18:57:19,223 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-08-22 18:57:19,342 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-08-22 18:57:19,493 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-08-22 18:57:19,706 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-08-22 18:57:19,867 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-08-22 18:57:19,873 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,873 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,873 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,873 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-08-22 18:57:19,873 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,873 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,873 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,874 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,874 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:57:19,874 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-08-22 18:57:19,874 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 18:57:19,874 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 18:57:19,874 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-08-22 18:57:19,875 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-08-22 18:57:19,875 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 39 48) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:19,875 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 39 48) the Hoare annotation is: true [2020-08-22 18:57:19,875 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-08-22 18:57:19,875 INFO L271 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-08-22 18:57:19,875 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 39 48) the Hoare annotation is: true [2020-08-22 18:57:19,875 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-08-22 18:57:19,876 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-08-22 18:57:19,876 INFO L271 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: true [2020-08-22 18:57:19,876 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:19,876 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-08-22 18:57:19,876 INFO L271 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: true [2020-08-22 18:57:19,876 INFO L264 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:19,876 INFO L271 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: true [2020-08-22 18:57:19,877 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:19,877 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:19,877 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-08-22 18:57:19,877 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-08-22 18:57:19,877 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-08-22 18:57:19,878 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-08-22 18:57:19,878 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-08-22 18:57:19,878 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-08-22 18:57:19,878 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-08-22 18:57:19,878 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-08-22 18:57:19,879 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-08-22 18:57:19,879 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-08-22 18:57:19,879 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-08-22 18:57:19,879 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-08-22 18:57:19,880 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-08-22 18:57:19,880 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-08-22 18:57:19,880 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-08-22 18:57:19,880 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-08-22 18:57:19,880 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-08-22 18:57:19,881 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-08-22 18:57:19,881 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-08-22 18:57:19,881 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-08-22 18:57:19,881 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-08-22 18:57:19,882 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-08-22 18:57:19,882 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-08-22 18:57:19,882 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-08-22 18:57:19,882 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-08-22 18:57:19,883 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-08-22 18:57:19,883 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-08-22 18:57:19,883 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-08-22 18:57:19,883 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-08-22 18:57:19,884 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-08-22 18:57:19,884 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-08-22 18:57:19,884 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-08-22 18:57:19,884 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-08-22 18:57:19,884 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-08-22 18:57:19,885 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-08-22 18:57:19,885 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-08-22 18:57:19,885 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-08-22 18:57:19,885 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-08-22 18:57:19,886 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-08-22 18:57:19,886 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-08-22 18:57:19,886 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-08-22 18:57:19,886 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-08-22 18:57:19,886 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-08-22 18:57:19,886 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 18:57:19,887 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-08-22 18:57:19,887 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 18:57:19,887 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-08-22 18:57:19,887 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-08-22 18:57:19,887 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-08-22 18:57:19,905 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-08-22 18:57:19,910 INFO L168 Benchmark]: Toolchain (without parser) took 12938.94 ms. Allocated memory was 140.5 MB in the beginning and 340.3 MB in the end (delta: 199.8 MB). Free memory was 104.7 MB in the beginning and 116.7 MB in the end (delta: -12.0 MB). Peak memory consumption was 187.8 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:19,911 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 140.5 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 18:57:19,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.32 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 94.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:19,913 INFO L168 Benchmark]: Boogie Preprocessor took 135.28 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 181.3 MB in the end (delta: -87.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:19,914 INFO L168 Benchmark]: RCFGBuilder took 405.32 ms. Allocated memory is still 203.9 MB. Free memory was 181.3 MB in the beginning and 160.2 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:19,915 INFO L168 Benchmark]: TraceAbstraction took 12115.60 ms. Allocated memory was 203.9 MB in the beginning and 340.3 MB in the end (delta: 136.3 MB). Free memory was 160.2 MB in the beginning and 116.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 179.9 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:19,920 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.30 ms. Allocated memory is still 140.5 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.32 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 94.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.28 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 181.3 MB in the end (delta: -87.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.32 ms. Allocated memory is still 203.9 MB. Free memory was 181.3 MB in the beginning and 160.2 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12115.60 ms. Allocated memory was 203.9 MB in the beginning and 340.3 MB in the end (delta: 136.3 MB). Free memory was 160.2 MB in the beginning and 116.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 179.9 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...