/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_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:19:42,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:19:42,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:19:42,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:19:42,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:19:42,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:19:42,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:19:42,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:19:42,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:19:42,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:19:42,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:19:42,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:19:42,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:19:42,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:19:42,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:19:42,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:19:42,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:19:42,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:19:42,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:19:42,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:19:42,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:19:42,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:19:42,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:19:42,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:19:42,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:19:42,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:19:42,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:19:42,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:19:42,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:19:42,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:19:42,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:19:42,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:19:42,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:19:43,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:19:43,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:19:43,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:19:43,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:19:43,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:19:43,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:19:43,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:19:43,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:19:43,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:19:43,014 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:19:43,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:19:43,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:19:43,016 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:19:43,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:19:43,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:19:43,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:19:43,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:19:43,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:19:43,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:19:43,017 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:19:43,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:19:43,018 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:19:43,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:19:43,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:19:43,018 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:19:43,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:19:43,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:19:43,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:19:43,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:19:43,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:19:43,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:19:43,020 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:19:43,318 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:19:43,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:19:43,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:19:43,344 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:19:43,345 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:19:43,346 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-07 13:19:43,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a9c01d5/9dc40633b86543b69923503258c08b38/FLAGa91529bac [2020-07-07 13:19:43,951 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:19:43,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-07 13:19:43,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a9c01d5/9dc40633b86543b69923503258c08b38/FLAGa91529bac [2020-07-07 13:19:44,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a9c01d5/9dc40633b86543b69923503258c08b38 [2020-07-07 13:19:44,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:19:44,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:19:44,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:19:44,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:19:44,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:19:44,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e2dbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44, skipping insertion in model container [2020-07-07 13:19:44,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:19:44,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:19:44,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:19:44,604 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:19:44,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:19:44,681 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:19:44,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44 WrapperNode [2020-07-07 13:19:44,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:19:44,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:19:44,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:19:44,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:19:44,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (1/1) ... [2020-07-07 13:19:44,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:19:44,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:19:44,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:19:44,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:19:44,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (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-07-07 13:19:44,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:19:44,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:19:44,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-07 13:19:44,918 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-07 13:19:44,918 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-07 13:19:44,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:19:44,918 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-07 13:19:44,918 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-07 13:19:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-07 13:19:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:19:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 13:19:44,919 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-07 13:19:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-07 13:19:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:19:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-07 13:19:44,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-07 13:19:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:19:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-07 13:19:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-07 13:19:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-07 13:19:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:19:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:19:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-07 13:19:45,275 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:19:45,276 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:19:45,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:19:45 BoogieIcfgContainer [2020-07-07 13:19:45,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:19:45,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:19:45,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:19:45,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:19:45,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:19:44" (1/3) ... [2020-07-07 13:19:45,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ea2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:19:45, skipping insertion in model container [2020-07-07 13:19:45,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:19:44" (2/3) ... [2020-07-07 13:19:45,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738ea2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:19:45, skipping insertion in model container [2020-07-07 13:19:45,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:19:45" (3/3) ... [2020-07-07 13:19:45,291 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-07 13:19:45,301 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:19:45,308 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:19:45,324 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:19:45,349 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:19:45,349 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:19:45,349 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:19:45,349 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:19:45,350 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:19:45,350 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:19:45,350 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:19:45,350 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:19:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-07 13:19:45,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 13:19:45,384 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:45,385 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 13:19:45,386 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:45,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-07 13:19:45,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:45,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614575711] [2020-07-07 13:19:45,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:19:45,904 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:45,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614575711] [2020-07-07 13:19:45,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:45,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-07 13:19:45,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224416980] [2020-07-07 13:19:45,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 13:19:45,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 13:19:45,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:19:45,937 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-07 13:19:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:46,875 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-07 13:19:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 13:19:46,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-07 13:19:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:46,892 INFO L225 Difference]: With dead ends: 221 [2020-07-07 13:19:46,892 INFO L226 Difference]: Without dead ends: 138 [2020-07-07 13:19:46,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 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-07-07 13:19:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-07 13:19:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-07 13:19:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-07 13:19:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-07 13:19:46,979 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-07 13:19:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:46,980 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-07 13:19:46,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 13:19:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-07 13:19:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:19:46,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:46,987 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-07 13:19:46,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:19:46,988 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-07 13:19:46,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:46,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850001636] [2020-07-07 13:19:46,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:19:47,301 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:47,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850001636] [2020-07-07 13:19:47,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:47,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-07 13:19:47,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935659546] [2020-07-07 13:19:47,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 13:19:47,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 13:19:47,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-07-07 13:19:47,307 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 14 states. [2020-07-07 13:19:48,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:48,245 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-07 13:19:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 13:19:48,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2020-07-07 13:19:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:48,249 INFO L225 Difference]: With dead ends: 128 [2020-07-07 13:19:48,249 INFO L226 Difference]: Without dead ends: 108 [2020-07-07 13:19:48,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2020-07-07 13:19:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-07 13:19:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-07 13:19:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-07 13:19:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-07 13:19:48,289 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-07 13:19:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:48,291 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-07 13:19:48,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 13:19:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-07 13:19:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-07 13:19:48,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:48,298 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-07 13:19:48,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:19:48,298 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-07 13:19:48,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:48,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335582764] [2020-07-07 13:19:48,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 13:19:48,721 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:48,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335582764] [2020-07-07 13:19:48,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:48,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:19:48,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978210921] [2020-07-07 13:19:48,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:19:48,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:19:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:19:48,724 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-07 13:19:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:50,074 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-07 13:19:50,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 13:19:50,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-07 13:19:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:50,078 INFO L225 Difference]: With dead ends: 179 [2020-07-07 13:19:50,078 INFO L226 Difference]: Without dead ends: 177 [2020-07-07 13:19:50,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 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-07-07 13:19:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-07 13:19:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-07 13:19:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-07 13:19:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-07 13:19:50,108 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-07 13:19:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:50,109 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-07 13:19:50,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:19:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-07 13:19:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-07 13:19:50,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:50,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-07-07 13:19:50,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:19:50,111 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:50,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-07 13:19:50,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:50,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1545812974] [2020-07-07 13:19:50,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 13:19:50,441 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:50,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1545812974] [2020-07-07 13:19:50,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:50,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:19:50,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81196965] [2020-07-07 13:19:50,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:19:50,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:50,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:19:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:19:50,444 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-07 13:19:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:51,946 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-07 13:19:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 13:19:51,947 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-07 13:19:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:51,950 INFO L225 Difference]: With dead ends: 221 [2020-07-07 13:19:51,950 INFO L226 Difference]: Without dead ends: 219 [2020-07-07 13:19:51,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 13:19:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-07 13:19:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-07 13:19:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-07 13:19:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-07 13:19:51,986 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-07 13:19:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:51,986 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-07 13:19:51,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:19:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-07 13:19:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-07 13:19:51,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:51,989 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2020-07-07 13:19:51,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:19:51,989 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-07 13:19:51,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:51,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1918735456] [2020-07-07 13:19:51,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-07 13:19:52,333 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:52,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1918735456] [2020-07-07 13:19:52,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:52,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 13:19:52,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883741005] [2020-07-07 13:19:52,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 13:19:52,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:52,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 13:19:52,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:19:52,346 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 16 states. [2020-07-07 13:19:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:53,321 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-07 13:19:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:19:53,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-07-07 13:19:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:53,325 INFO L225 Difference]: With dead ends: 206 [2020-07-07 13:19:53,325 INFO L226 Difference]: Without dead ends: 142 [2020-07-07 13:19:53,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2020-07-07 13:19:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-07 13:19:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-07 13:19:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-07 13:19:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-07 13:19:53,365 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-07 13:19:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:53,366 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-07 13:19:53,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 13:19:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-07 13:19:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-07 13:19:53,375 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:53,375 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2020-07-07 13:19:53,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:19:53,377 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:53,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-07 13:19:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:53,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477712723] [2020-07-07 13:19:53,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-07 13:19:53,839 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:53,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477712723] [2020-07-07 13:19:53,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:53,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:19:53,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279280096] [2020-07-07 13:19:53,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:19:53,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:19:53,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:19:53,843 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-07 13:19:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:55,384 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-07 13:19:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-07 13:19:55,385 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-07 13:19:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:55,388 INFO L225 Difference]: With dead ends: 168 [2020-07-07 13:19:55,388 INFO L226 Difference]: Without dead ends: 166 [2020-07-07 13:19:55,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-07-07 13:19:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-07 13:19:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-07 13:19:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-07 13:19:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-07 13:19:55,406 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-07 13:19:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:55,406 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-07 13:19:55,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:19:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-07 13:19:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-07 13:19:55,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:55,408 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:19:55,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:19:55,408 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-07 13:19:55,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:55,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990859763] [2020-07-07 13:19:55,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-07 13:19:55,764 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:55,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990859763] [2020-07-07 13:19:55,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:55,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:19:55,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378687199] [2020-07-07 13:19:55,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:19:55,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:19:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:19:55,767 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-07 13:19:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:57,387 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-07 13:19:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-07 13:19:57,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-07 13:19:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:57,391 INFO L225 Difference]: With dead ends: 191 [2020-07-07 13:19:57,391 INFO L226 Difference]: Without dead ends: 189 [2020-07-07 13:19:57,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-07-07 13:19:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-07 13:19:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-07 13:19:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-07 13:19:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-07 13:19:57,414 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-07 13:19:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:57,415 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-07 13:19:57,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:19:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-07 13:19:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-07 13:19:57,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:57,416 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:19:57,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:19:57,417 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-07 13:19:57,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:57,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [673826032] [2020-07-07 13:19:57,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:19:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-07 13:19:57,811 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:19:57,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [673826032] [2020-07-07 13:19:57,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:19:57,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:19:57,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313578252] [2020-07-07 13:19:57,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:19:57,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:19:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:19:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:19:57,815 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-07 13:19:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:19:59,507 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-07 13:19:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-07 13:19:59,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-07 13:19:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:19:59,510 INFO L225 Difference]: With dead ends: 208 [2020-07-07 13:19:59,510 INFO L226 Difference]: Without dead ends: 206 [2020-07-07 13:19:59,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-07 13:19:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-07 13:19:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-07 13:19:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-07 13:19:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-07 13:19:59,539 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-07 13:19:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:19:59,539 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-07 13:19:59,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:19:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-07 13:19:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-07 13:19:59,541 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:19:59,541 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:19:59,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:19:59,542 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:19:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:19:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-07 13:19:59,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:19:59,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818125349] [2020-07-07 13:19:59,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:19:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-07 13:20:00,266 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:20:00,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1818125349] [2020-07-07 13:20:00,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:20:00,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-07 13:20:00,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62200759] [2020-07-07 13:20:00,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-07 13:20:00,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:20:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-07 13:20:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-07 13:20:00,269 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-07 13:20:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:20:02,831 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-07 13:20:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 13:20:02,832 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-07 13:20:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:20:02,835 INFO L225 Difference]: With dead ends: 237 [2020-07-07 13:20:02,835 INFO L226 Difference]: Without dead ends: 171 [2020-07-07 13:20:02,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-07 13:20:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-07 13:20:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-07 13:20:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-07 13:20:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-07 13:20:02,858 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-07 13:20:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:20:02,858 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-07 13:20:02,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-07 13:20:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-07 13:20:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-07 13:20:02,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:20:02,860 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-07 13:20:02,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:20:02,860 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:20:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:20:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-07 13:20:02,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:20:02,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371419796] [2020-07-07 13:20:02,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:20:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:20:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-07 13:20:03,052 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:20:03,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371419796] [2020-07-07 13:20:03,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:20:03,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 13:20:03,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896412102] [2020-07-07 13:20:03,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 13:20:03,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:20:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 13:20:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:20:03,056 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 12 states. [2020-07-07 13:20:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:20:03,470 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-07-07 13:20:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 13:20:03,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 121 [2020-07-07 13:20:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:20:03,475 INFO L225 Difference]: With dead ends: 163 [2020-07-07 13:20:03,475 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:20:03,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:20:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:20:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:20:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:20:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:20:03,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-07-07 13:20:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:20:03,477 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:20:03,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 13:20:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:20:03,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:20:03,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:20:03,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:20:05,097 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-07 13:20:05,236 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-07 13:20:05,511 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-07 13:20:05,705 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-07 13:20:05,866 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-07 13:20:06,036 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-07-07 13:20:06,259 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-07 13:20:06,507 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-07 13:20:06,819 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-07 13:20:07,108 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-07-07 13:20:07,394 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-07-07 13:20:07,544 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-07 13:20:07,818 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-07-07 13:20:08,018 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-07-07 13:20:08,326 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-07-07 13:20:08,617 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-07 13:20:08,726 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 21 [2020-07-07 13:20:08,929 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-07 13:20:09,123 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-07 13:20:09,367 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-07 13:20:09,546 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-07 13:20:09,847 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-07 13:20:10,119 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-07 13:20:10,309 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-07-07 13:20:10,696 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-07 13:20:10,892 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-07 13:20:11,239 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-07 13:20:11,530 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-07 13:20:11,772 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-07 13:20:11,939 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2020-07-07 13:20:11,956 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,956 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,956 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-07 13:20:11,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-07 13:20:11,957 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-07 13:20:11,958 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-07 13:20:11,958 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-07 13:20:11,958 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-07-07 13:20:11,958 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-07 13:20:11,958 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= 0 main_~ax~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,958 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-07-07 13:20:11,958 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,959 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,959 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-07-07 13:20:11,959 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-07 13:20:11,959 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,959 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-07 13:20:11,959 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,960 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,960 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,960 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,960 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,960 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,960 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= 0 main_~ax~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,961 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,962 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,962 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-07 13:20:11,962 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-07 13:20:11,962 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse0 (select |#memory_int| check_~a.base))) (not (<= 1 |check_#in~x|)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-07 13:20:11,962 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-07 13:20:11,963 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-07 13:20:11,963 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 |check_#t~mem6|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse2 .cse3) (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,963 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= 0 |check_#t~mem6|)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-07 13:20:11,963 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-07 13:20:11,964 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-07 13:20:11,964 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-07 13:20:11,964 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-07 13:20:11,964 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-07 13:20:11,964 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-07 13:20:11,965 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,965 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,965 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse0 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse1 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 (= .cse1 (select |#memory_int| check_~a.base)) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and .cse0 (= 0 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,965 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-07 13:20:11,966 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))))) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse3 .cse4)))) [2020-07-07 13:20:11,966 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse3) .cse0 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,966 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 .cse3) (not (<= 1 |check_#in~x|)) .cse4 .cse5) (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x)))) .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,966 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,967 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse9 |check_#in~n|)) (.cse5 (= .cse8 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse9 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse8 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7) (not (<= 1 |check_#in~x|)) .cse0 .cse1)))) [2020-07-07 13:20:11,967 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,967 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse10 |check_#in~n|)) (.cse5 (= .cse9 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse10 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse8 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse9 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7 .cse8) .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7 .cse8) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,968 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,968 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-07 13:20:11,968 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,968 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-07 13:20:11,969 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,969 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (<= .cse8 |check_#in~n|)) (.cse1 (= .cse7 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse8 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse4 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or .cse3 .cse4 .cse5 (<= 2 check_~x)) (or (and (= 0 |check_#t~post3|) .cse0 (= 0 check_~x) .cse1 .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse4)))) [2020-07-07 13:20:11,969 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-07 13:20:11,969 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and (= 0 |check_#t~post3|) .cse0 .cse1 (<= 1 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse3 .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) (not (<= 2 |check_#in~x|)) .cse4)))) [2020-07-07 13:20:11,970 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-07 13:20:11,970 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (<= 1 check_~x) .cse0 .cse1))) [2020-07-07 13:20:11,970 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-07 13:20:11,970 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x)) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2020-07-07 13:20:11,970 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse3 (and .cse0 .cse1 .cse2 (<= 2 check_~x)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (not (<= 2 |check_#in~x|)) .cse4 (<= (+ check_~y 2) check_~n))))) [2020-07-07 13:20:11,971 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-07 13:20:11,971 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-07 13:20:11,971 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-07 13:20:11,971 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 13:20:11,971 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 13:20:11,972 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 13:20:11,972 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 13:20:11,972 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 13:20:11,972 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-07 13:20:11,972 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-07-07 13:20:11,972 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-07-07 13:20:11,991 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.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-07-07 13:20:11,995 INFO L168 Benchmark]: Toolchain (without parser) took 27702.69 ms. Allocated memory was 135.8 MB in the beginning and 447.2 MB in the end (delta: 311.4 MB). Free memory was 99.7 MB in the beginning and 258.4 MB in the end (delta: -158.7 MB). Peak memory consumption was 332.2 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:11,996 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 13:20:11,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.21 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 88.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:11,998 INFO L168 Benchmark]: Boogie Preprocessor took 165.39 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 88.8 MB in the beginning and 177.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:11,999 INFO L168 Benchmark]: RCFGBuilder took 433.09 ms. Allocated memory is still 199.2 MB. Free memory was 176.5 MB in the beginning and 154.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:11,999 INFO L168 Benchmark]: TraceAbstraction took 26710.87 ms. Allocated memory was 199.2 MB in the beginning and 447.2 MB in the end (delta: 248.0 MB). Free memory was 153.6 MB in the beginning and 258.4 MB in the end (delta: -104.8 MB). Peak memory consumption was 322.6 MB. Max. memory is 7.1 GB. [2020-07-07 13:20:12,003 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.25 ms. Allocated memory is still 135.8 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.21 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 88.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.39 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 88.8 MB in the beginning and 177.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.09 ms. Allocated memory is still 199.2 MB. Free memory was 176.5 MB in the beginning and 154.3 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26710.87 ms. Allocated memory was 199.2 MB in the beginning and 447.2 MB in the end (delta: 248.0 MB). Free memory was 153.6 MB in the beginning and 258.4 MB in the end (delta: -104.8 MB). Peak memory consumption was 322.6 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: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - 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...