/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:57:42,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:57:42,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:57:42,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:57:42,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:57:42,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:57:42,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:57:42,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:57:42,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:57:42,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:57:42,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:57:42,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:57:42,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:57:42,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:57:42,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:57:42,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:57:42,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:57:42,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:57:42,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:57:42,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:57:42,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:57:42,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:57:42,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:57:42,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:57:42,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:57:42,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:57:42,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:57:42,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:57:42,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:57:42,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:57:42,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:57:42,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:57:42,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:57:42,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:57:42,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:57:42,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:57:42,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:57:42,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:57:42,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:57:42,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:57:42,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:57:42,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:57:42,414 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:57:42,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:57:42,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:57:42,420 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:57:42,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:57:42,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:57:42,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:57:42,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:57:42,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:57:42,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:57:42,423 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:57:42,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:57:42,424 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:57:42,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:57:42,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:57:42,425 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:57:42,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:57:42,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:57:42,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:57:42,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:57:42,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:57:42,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:57:42,427 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:57:42,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:57:42,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:57:42,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:57:42,881 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:57:42,881 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:57:42,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-10-24 00:57:42,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fd24c21/e7cadaecd8ea4fc49f1156f23c35438c/FLAGfb5b1c2c6 [2020-10-24 00:57:43,636 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:57:43,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-10-24 00:57:43,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fd24c21/e7cadaecd8ea4fc49f1156f23c35438c/FLAGfb5b1c2c6 [2020-10-24 00:57:43,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9fd24c21/e7cadaecd8ea4fc49f1156f23c35438c [2020-10-24 00:57:43,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:57:44,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:57:44,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:57:44,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:57:44,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:57:44,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:43" (1/1) ... [2020-10-24 00:57:44,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2156c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44, skipping insertion in model container [2020-10-24 00:57:44,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:43" (1/1) ... [2020-10-24 00:57:44,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:57:44,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:57:44,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:57:44,231 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:57:44,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:57:44,319 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:57:44,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44 WrapperNode [2020-10-24 00:57:44,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:57:44,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:57:44,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:57:44,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:57:44,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (1/1) ... [2020-10-24 00:57:44,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:57:44,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:57:44,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:57:44,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:57:44,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57: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-10-24 00:57:44,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:57:44,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:57:44,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:57:44,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 00:57:44,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 00:57:44,509 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-10-24 00:57:44,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:57:44,509 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-10-24 00:57:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-24 00:57:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-24 00:57:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:57:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 00:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 00:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:57:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-10-24 00:57:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:57:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:57:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-24 00:57:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-10-24 00:57:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:57:44,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:57:44,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:57:44,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:57:44,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:57:45,034 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:57:45,034 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:57:45,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:45 BoogieIcfgContainer [2020-10-24 00:57:45,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:57:45,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:57:45,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:57:45,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:57:45,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:57:43" (1/3) ... [2020-10-24 00:57:45,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72848ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:45, skipping insertion in model container [2020-10-24 00:57:45,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:44" (2/3) ... [2020-10-24 00:57:45,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72848ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:45, skipping insertion in model container [2020-10-24 00:57:45,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:45" (3/3) ... [2020-10-24 00:57:45,047 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-10-24 00:57:45,060 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:57:45,066 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:57:45,082 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:57:45,112 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:57:45,112 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:57:45,112 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:57:45,112 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:57:45,113 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:57:45,113 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:57:45,113 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:57:45,113 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:57:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2020-10-24 00:57:45,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 00:57:45,146 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:45,147 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] [2020-10-24 00:57:45,148 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 266751524, now seen corresponding path program 1 times [2020-10-24 00:57:45,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:45,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414272758] [2020-10-24 00:57:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:57:45,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414272758] [2020-10-24 00:57:45,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:57:45,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 00:57:45,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492450033] [2020-10-24 00:57:45,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:57:45,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:45,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:57:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:57:45,796 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 10 states. [2020-10-24 00:57:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:47,583 INFO L93 Difference]: Finished difference Result 231 states and 268 transitions. [2020-10-24 00:57:47,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:57:47,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-10-24 00:57:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:47,599 INFO L225 Difference]: With dead ends: 231 [2020-10-24 00:57:47,599 INFO L226 Difference]: Without dead ends: 144 [2020-10-24 00:57:47,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:57:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-24 00:57:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2020-10-24 00:57:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-24 00:57:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2020-10-24 00:57:47,697 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 46 [2020-10-24 00:57:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:47,698 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2020-10-24 00:57:47,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:57:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2020-10-24 00:57:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 00:57:47,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:47,701 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:47,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:57:47,702 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:47,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2018690229, now seen corresponding path program 1 times [2020-10-24 00:57:47,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:47,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988867316] [2020-10-24 00:57:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:48,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:48,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-24 00:57:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:57:48,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988867316] [2020-10-24 00:57:48,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:57:48,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-24 00:57:48,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150405648] [2020-10-24 00:57:48,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:57:48,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:57:48,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:57:48,055 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 13 states. [2020-10-24 00:57:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:49,221 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2020-10-24 00:57:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:57:49,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2020-10-24 00:57:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:49,226 INFO L225 Difference]: With dead ends: 135 [2020-10-24 00:57:49,227 INFO L226 Difference]: Without dead ends: 114 [2020-10-24 00:57:49,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:57:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-24 00:57:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-24 00:57:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-24 00:57:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2020-10-24 00:57:49,286 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 58 [2020-10-24 00:57:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:49,288 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2020-10-24 00:57:49,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:57:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2020-10-24 00:57:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:57:49,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:49,297 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:49,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:57:49,298 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1111445585, now seen corresponding path program 1 times [2020-10-24 00:57:49,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:49,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [514896040] [2020-10-24 00:57:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:57:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:57:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 00:57:49,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [514896040] [2020-10-24 00:57:49,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:49,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:57:49,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686849263] [2020-10-24 00:57:49,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:57:49,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:49,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:57:49,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:57:49,730 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 15 states. [2020-10-24 00:57:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:51,754 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2020-10-24 00:57:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:57:51,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-10-24 00:57:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:51,759 INFO L225 Difference]: With dead ends: 186 [2020-10-24 00:57:51,759 INFO L226 Difference]: Without dead ends: 183 [2020-10-24 00:57:51,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:57:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-24 00:57:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2020-10-24 00:57:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-24 00:57:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2020-10-24 00:57:51,807 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 73 [2020-10-24 00:57:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:51,808 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2020-10-24 00:57:51,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:57:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2020-10-24 00:57:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:57:51,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:51,810 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:51,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:57:51,811 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1526359473, now seen corresponding path program 1 times [2020-10-24 00:57:51,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:51,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819062020] [2020-10-24 00:57:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:57:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:57:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 00:57:52,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819062020] [2020-10-24 00:57:52,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:57:52,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-24 00:57:52,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228002035] [2020-10-24 00:57:52,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:57:52,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:57:52,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:57:52,242 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand 15 states. [2020-10-24 00:57:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:54,203 INFO L93 Difference]: Finished difference Result 228 states and 249 transitions. [2020-10-24 00:57:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:57:54,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-10-24 00:57:54,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:54,208 INFO L225 Difference]: With dead ends: 228 [2020-10-24 00:57:54,208 INFO L226 Difference]: Without dead ends: 225 [2020-10-24 00:57:54,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 00:57:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-24 00:57:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 200. [2020-10-24 00:57:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-24 00:57:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2020-10-24 00:57:54,267 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 73 [2020-10-24 00:57:54,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:54,268 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2020-10-24 00:57:54,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:57:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2020-10-24 00:57:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-24 00:57:54,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:54,271 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:54,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:57:54,271 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1118871710, now seen corresponding path program 1 times [2020-10-24 00:57:54,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:54,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489500207] [2020-10-24 00:57:54,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:57:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:57:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 00:57:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 00:57:54,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489500207] [2020-10-24 00:57:54,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:54,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:57:54,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195304853] [2020-10-24 00:57:54,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:57:54,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:54,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:57:54,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:57:54,623 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand 15 states. [2020-10-24 00:57:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:56,000 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2020-10-24 00:57:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:57:56,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2020-10-24 00:57:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:56,003 INFO L225 Difference]: With dead ends: 213 [2020-10-24 00:57:56,003 INFO L226 Difference]: Without dead ends: 148 [2020-10-24 00:57:56,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:57:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-24 00:57:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2020-10-24 00:57:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-24 00:57:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2020-10-24 00:57:56,045 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 85 [2020-10-24 00:57:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:56,046 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2020-10-24 00:57:56,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:57:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2020-10-24 00:57:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-24 00:57:56,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:56,059 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:56,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:57:56,060 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:56,062 INFO L82 PathProgramCache]: Analyzing trace with hash 753971012, now seen corresponding path program 2 times [2020-10-24 00:57:56,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:56,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408567637] [2020-10-24 00:57:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:57:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:57:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:57:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-24 00:57:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-24 00:57:56,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408567637] [2020-10-24 00:57:56,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:56,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:57:56,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066536605] [2020-10-24 00:57:56,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:57:56,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:57:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:57:56,623 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 20 states. [2020-10-24 00:57:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:59,036 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2020-10-24 00:57:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 00:57:59,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2020-10-24 00:57:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:59,041 INFO L225 Difference]: With dead ends: 175 [2020-10-24 00:57:59,041 INFO L226 Difference]: Without dead ends: 172 [2020-10-24 00:57:59,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-10-24 00:57:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-24 00:57:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2020-10-24 00:57:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-24 00:57:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2020-10-24 00:57:59,076 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 100 [2020-10-24 00:57:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:59,078 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2020-10-24 00:57:59,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:57:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2020-10-24 00:57:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-24 00:57:59,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:59,082 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:57:59,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:57:59,082 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 339057124, now seen corresponding path program 1 times [2020-10-24 00:57:59,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:59,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [819539240] [2020-10-24 00:57:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-24 00:57:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-10-24 00:57:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 00:57:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:57:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-10-24 00:57:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-10-24 00:57:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-10-24 00:57:59,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [819539240] [2020-10-24 00:57:59,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:59,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:57:59,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820779995] [2020-10-24 00:57:59,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:57:59,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:59,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:57:59,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:57:59,361 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 11 states. [2020-10-24 00:57:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:59,949 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2020-10-24 00:57:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:57:59,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2020-10-24 00:57:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:59,950 INFO L225 Difference]: With dead ends: 129 [2020-10-24 00:57:59,950 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:57:59,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:57:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:57:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:57:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:57:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:57:59,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2020-10-24 00:57:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:59,964 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:57:59,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:57:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:57:59,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:57:59,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:57:59,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:58:01,252 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-10-24 00:58:01,381 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2020-10-24 00:58:01,564 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2020-10-24 00:58:01,757 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-10-24 00:58:01,924 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-10-24 00:58:02,167 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-10-24 00:58:02,368 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-10-24 00:58:02,551 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-10-24 00:58:02,834 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-10-24 00:58:03,045 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2020-10-24 00:58:03,219 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-10-24 00:58:03,470 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-10-24 00:58:03,669 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-10-24 00:58:04,001 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-10-24 00:58:04,212 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2020-10-24 00:58:04,477 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-10-24 00:58:04,679 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2020-10-24 00:58:04,874 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-10-24 00:58:05,099 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2020-10-24 00:58:05,280 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-10-24 00:58:05,484 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2020-10-24 00:58:05,674 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-10-24 00:58:05,886 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2020-10-24 00:58:06,155 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-10-24 00:58:06,317 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-10-24 00:58:06,541 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-10-24 00:58:06,694 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-10-24 00:58:06,898 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2020-10-24 00:58:07,083 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2020-10-24 00:58:07,112 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,112 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,112 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,113 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,113 INFO L277 CegarLoopResult]: At program point L5-4(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,113 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,113 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,113 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,113 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,113 INFO L277 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,114 INFO L277 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,114 INFO L277 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,114 INFO L277 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-10-24 00:58:07,114 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,114 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,115 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,115 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,115 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:58:07,115 INFO L277 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2020-10-24 00:58:07,115 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-24 00:58:07,115 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-24 00:58:07,116 INFO L277 CegarLoopResult]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2020-10-24 00:58:07,116 INFO L277 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2020-10-24 00:58:07,116 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 40 54) the Hoare annotation is: true [2020-10-24 00:58:07,116 INFO L277 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-10-24 00:58:07,116 INFO L270 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ax~1 0) (= main_~ai~1 0))) [2020-10-24 00:58:07,116 INFO L277 CegarLoopResult]: At program point L50-1(line 50) the Hoare annotation is: true [2020-10-24 00:58:07,116 INFO L270 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2020-10-24 00:58:07,117 INFO L270 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= |main_#t~mem19| 0))) [2020-10-24 00:58:07,117 INFO L270 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-10-24 00:58:07,117 INFO L270 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ai~1 0) (= |main_#t~mem19| 0))) [2020-10-24 00:58:07,117 INFO L270 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2020-10-24 00:58:07,117 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 40 54) the Hoare annotation is: true [2020-10-24 00:58:07,117 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,117 INFO L270 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,118 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 40 54) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,118 INFO L270 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ai~1 0))) [2020-10-24 00:58:07,118 INFO L270 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= |main_#t~mem20| 0) (= main_~ai~1 0))) [2020-10-24 00:58:07,118 INFO L270 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2020-10-24 00:58:07,118 INFO L270 CegarLoopResult]: At program point L49-2(line 49) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)) (= main_~ax~1 0) (= |main_#t~mem20| 0) (= main_~ai~1 0))) [2020-10-24 00:58:07,118 INFO L270 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2020-10-24 00:58:07,119 INFO L270 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,119 INFO L270 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2020-10-24 00:58:07,119 INFO L270 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,119 INFO L270 CegarLoopResult]: At program point L47-3(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2020-10-24 00:58:07,119 INFO L270 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,119 INFO L270 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,120 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,120 INFO L270 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:58:07,120 INFO L270 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:58:07,120 INFO L270 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (= |check_#t~mem13| 0)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (and .cse0 .cse1) .cse2 (not (<= 1 |check_#in~x|)) .cse3) (or .cse2 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse0 .cse1) (not (= |check_#in~x| 0)) .cse3)))) [2020-10-24 00:58:07,120 INFO L277 CegarLoopResult]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2020-10-24 00:58:07,121 INFO L270 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse3 (= |check_#t~mem13| 0)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse1 .cse2 .cse3) .cse4) (or .cse0 (and (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2 .cse3) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,121 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:58:07,121 INFO L270 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:58:07,121 INFO L270 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:58:07,121 INFO L270 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:58:07,122 INFO L270 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:58:07,122 INFO L270 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:58:07,122 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,122 INFO L270 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,123 INFO L270 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,123 INFO L270 CegarLoopResult]: At program point checkFINAL(lines 16 38) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-10-24 00:58:07,123 INFO L270 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2020-10-24 00:58:07,123 INFO L270 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= |check_#t~mem14| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3 .cse4))))) [2020-10-24 00:58:07,123 INFO L270 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem14| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (and .cse2 (or (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4 .cse5) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:58:07,124 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,124 INFO L270 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (<= .cse7 |check_#in~n|)) (.cse4 (<= .cse7 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0))) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse1)))) [2020-10-24 00:58:07,124 INFO L270 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,125 INFO L270 CegarLoopResult]: At program point L26-2(lines 26 27) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse1 (= |check_#t~mem8| 0)) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= |check_#t~mem9| 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse6) (or .cse0 (not (= |check_#in~x| 0)) .cse6 (and .cse1 .cse2 .cse3 .cse4 .cse5 (= check_~x 0)))))) [2020-10-24 00:58:07,125 INFO L270 CegarLoopResult]: At program point L26-3(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse9 ((as const (Array Int Int)) 0)) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse5)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (and (let ((.cse8 (+ check_~y 1))) (let ((.cse6 (<= .cse8 |check_#in~n|)) (.cse7 (<= .cse8 check_~n))) (or (and .cse5 .cse4 .cse6 .cse7 (= check_~x 0)) (and .cse5 .cse6 .cse7 .cse1 (<= 1 check_~x))))) (= |check_#t~mem8| 0) (= |check_#t~mem9| 0) (= (select |#memory_int| check_~a.base) .cse9)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-10-24 00:58:07,125 INFO L270 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse10 ((as const (Array Int Int)) 0))) (let ((.cse2 (= |check_#in~x| 0)) (.cse5 (= (select |#memory_int| |check_#in~a.base|) .cse10)) (.cse4 (<= 1 |check_#in~x|)) (.cse6 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse6)) (.cse1 (and (= |check_#t~mem8| 0) (let ((.cse9 (+ check_~y 1))) (let ((.cse7 (<= .cse9 |check_#in~n|)) (.cse8 (<= .cse9 check_~n))) (or (and .cse5 .cse6 .cse2 .cse7 .cse8 (= check_~x 0)) (and .cse5 .cse6 .cse7 .cse8 .cse4 (<= 1 check_~x))))) (= (select |#memory_int| check_~a.base) .cse10))) (.cse3 (not .cse5))) (and (or .cse0 .cse1 (not .cse2) .cse3) (or .cse0 (not .cse4) .cse1 .cse3))))) [2020-10-24 00:58:07,125 INFO L270 CegarLoopResult]: At program point L26-5(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse9 ((as const (Array Int Int)) 0)) (.cse5 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse5)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (and (let ((.cse8 (+ check_~y 1))) (let ((.cse6 (<= .cse8 |check_#in~n|)) (.cse7 (<= .cse8 check_~n))) (or (and .cse5 .cse4 .cse6 .cse7 (= check_~x 0)) (and .cse5 .cse6 .cse7 .cse1 (<= 1 check_~x))))) (= (select |#memory_int| check_~a.base) .cse9)))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-10-24 00:58:07,126 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,126 INFO L270 CegarLoopResult]: At program point L26-6(line 26) the Hoare annotation is: (let ((.cse1 (<= 1 |check_#in~x|)) (.cse4 (= |check_#in~x| 0)) (.cse5 ((as const (Array Int Int)) 0)) (.cse6 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse6)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse3 (and (= (select |#memory_int| check_~a.base) .cse5) (let ((.cse9 (+ check_~y 1))) (let ((.cse7 (<= .cse9 |check_#in~n|)) (.cse8 (<= .cse9 check_~n))) (or (and .cse6 .cse7 (<= 1 |check_#t~post10|) .cse8 .cse1 (<= 1 check_~x)) (and .cse6 .cse4 .cse7 .cse8 (= |check_#t~post10| 0) (= check_~x 0)))))))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-10-24 00:58:07,126 INFO L270 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,126 INFO L270 CegarLoopResult]: At program point L26-7(line 26) the Hoare annotation is: (let ((.cse4 (= |check_#in~x| 0)) (.cse1 (<= 1 |check_#in~x|)) (.cse5 ((as const (Array Int Int)) 0)) (.cse6 (<= (+ |check_#in~y| 1) |check_#in~n|))) (let ((.cse0 (not .cse6)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse3 (and (= (select |#memory_int| check_~a.base) .cse5) (let ((.cse9 (+ check_~y 1))) (let ((.cse7 (<= .cse9 |check_#in~n|)) (.cse8 (<= .cse9 check_~n))) (or (and .cse6 .cse4 .cse7 .cse8 (= |check_#t~post10| 0) (<= 1 check_~x)) (and .cse6 .cse7 (<= 1 |check_#t~post10|) .cse8 (<= 2 check_~x) .cse1))))))) (and (or .cse0 (not .cse1) .cse2 .cse3) (or .cse0 (not .cse4) .cse2 .cse3)))) [2020-10-24 00:58:07,127 INFO L270 CegarLoopResult]: At program point checkEXIT(lines 16 38) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-10-24 00:58:07,127 INFO L270 CegarLoopResult]: At program point L26-9(line 26) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:58:07,127 INFO L270 CegarLoopResult]: At program point L16(lines 16 38) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-10-24 00:58:07,127 INFO L270 CegarLoopResult]: At program point L26-10(line 26) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:58:07,127 INFO L270 CegarLoopResult]: At program point L16-1(lines 16 38) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= (+ check_~y 1) |check_#in~n|)) (.cse2 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (and .cse1 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse2) (or .cse0 (and .cse1 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse2))) [2020-10-24 00:58:07,128 INFO L270 CegarLoopResult]: At program point L26-11(lines 26 27) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,128 INFO L270 CegarLoopResult]: At program point L16-2(lines 16 38) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= (+ check_~y 1) |check_#in~n|)) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (and .cse1 .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (and .cse1 .cse2 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse3)))) [2020-10-24 00:58:07,128 INFO L270 CegarLoopResult]: At program point L16-3(lines 16 38) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= (+ check_~y 1) |check_#in~n|)) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (and .cse1 .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (and .cse1 .cse2 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse3)))) [2020-10-24 00:58:07,128 INFO L270 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-10-24 00:58:07,129 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 00:58:07,129 INFO L270 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-10-24 00:58:07,130 INFO L270 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-10-24 00:58:07,130 INFO L270 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-10-24 00:58:07,147 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:707) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-10-24 00:58:07,151 INFO L168 Benchmark]: Toolchain (without parser) took 23149.72 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 127.3 MB in the beginning and 164.8 MB in the end (delta: -37.4 MB). Peak memory consumption was 201.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:58:07,152 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 124.0 MB in the end (delta: 435.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:58:07,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 116.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:58:07,154 INFO L168 Benchmark]: Boogie Preprocessor took 86.87 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 114.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:58:07,154 INFO L168 Benchmark]: RCFGBuilder took 624.32 ms. Allocated memory is still 151.0 MB. Free memory was 114.4 MB in the beginning and 123.5 MB in the end (delta: -9.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:58:07,155 INFO L168 Benchmark]: TraceAbstraction took 22111.06 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 123.0 MB in the beginning and 164.8 MB in the end (delta: -41.8 MB). Peak memory consumption was 195.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:58:07,159 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 124.0 MB in the end (delta: 435.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 303.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 116.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 86.87 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 114.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 624.32 ms. Allocated memory is still 151.0 MB. Free memory was 114.4 MB in the beginning and 123.5 MB in the end (delta: -9.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22111.06 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 123.0 MB in the beginning and 164.8 MB in the end (delta: -41.8 MB). Peak memory consumption was 195.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 40]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...