/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/recursive-simple/id2_b3_o5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:54:16,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:54:16,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:54:16,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:54:16,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:54:16,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:54:16,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:54:16,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:54:16,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:54:16,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:54:16,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:54:16,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:54:16,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:54:16,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:54:16,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:54:16,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:54:16,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:54:16,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:54:16,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:54:16,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:54:16,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:54:16,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:54:16,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:54:16,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:54:16,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:54:16,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:54:16,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:54:16,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:54:16,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:54:16,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:54:16,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:54:16,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:54:16,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:54:16,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:54:16,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:54:16,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:54:16,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:54:16,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:54:16,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:54:16,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:54:16,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:54:16,533 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:54:16,560 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:54:16,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:54:16,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:54:16,566 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:54:16,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:54:16,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:54:16,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:54:16,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:54:16,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:54:16,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:54:16,568 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:54:16,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:54:16,569 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:54:16,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:54:16,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:54:16,570 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:54:16,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:54:16,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:54:16,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:54:16,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:54:16,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:54:16,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:54:16,572 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:54:17,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:54:17,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:54:17,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:54:17,078 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:54:17,078 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:54:17,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-10-24 00:54:17,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bffbeb23b/529f87a496e445c59365b6f625c8a411/FLAG1dda70a9c [2020-10-24 00:54:17,849 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:54:17,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-10-24 00:54:17,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bffbeb23b/529f87a496e445c59365b6f625c8a411/FLAG1dda70a9c [2020-10-24 00:54:18,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bffbeb23b/529f87a496e445c59365b6f625c8a411 [2020-10-24 00:54:18,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:54:18,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:54:18,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:18,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:54:18,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:54:18,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acbae04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18, skipping insertion in model container [2020-10-24 00:54:18,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:54:18,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:54:18,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:18,468 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:54:18,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:18,529 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:54:18,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18 WrapperNode [2020-10-24 00:54:18,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:18,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:54:18,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:54:18,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:54:18,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2020-10-24 00:54:18,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:54:18,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:54:18,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:54:18,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:54:18,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (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:54:18,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:54:18,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:54:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:54:18,709 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:54:18,710 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-10-24 00:54:18,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:54:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 00:54:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:54:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:54:18,712 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:54:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:54:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:54:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-10-24 00:54:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:54:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:54:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:54:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:54:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:54:18,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:54:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:54:19,300 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:54:19,301 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:54:19,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:19 BoogieIcfgContainer [2020-10-24 00:54:19,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:54:19,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:54:19,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:54:19,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:54:19,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:54:18" (1/3) ... [2020-10-24 00:54:19,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448ad0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:19, skipping insertion in model container [2020-10-24 00:54:19,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (2/3) ... [2020-10-24 00:54:19,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448ad0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:19, skipping insertion in model container [2020-10-24 00:54:19,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:19" (3/3) ... [2020-10-24 00:54:19,319 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2020-10-24 00:54:19,335 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:54:19,341 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:54:19,356 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:54:19,396 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:54:19,400 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:54:19,400 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:54:19,401 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:54:19,401 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:54:19,401 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:54:19,401 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:54:19,401 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:54:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-10-24 00:54:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:54:19,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:19,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:19,431 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 138014369, now seen corresponding path program 1 times [2020-10-24 00:54:19,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:19,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864829574] [2020-10-24 00:54:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:19,844 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-10-24 00:54:19,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:19,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:19,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864829574] [2020-10-24 00:54:19,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:19,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:19,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874374208] [2020-10-24 00:54:19,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:19,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:19,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:19,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:19,961 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2020-10-24 00:54:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:20,591 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-10-24 00:54:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:20,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:54:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:20,604 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:54:20,604 INFO L226 Difference]: Without dead ends: 45 [2020-10-24 00:54:20,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-24 00:54:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-24 00:54:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 00:54:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-10-24 00:54:20,667 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2020-10-24 00:54:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:20,668 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-10-24 00:54:20,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-10-24 00:54:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-24 00:54:20,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:20,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:20,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:54:20,672 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1111577060, now seen corresponding path program 1 times [2020-10-24 00:54:20,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:20,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780509583] [2020-10-24 00:54:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:20,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:20,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:20,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:20,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780509583] [2020-10-24 00:54:20,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:20,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:20,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290996837] [2020-10-24 00:54:20,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:20,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:20,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:20,903 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-10-24 00:54:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:21,295 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-10-24 00:54:21,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:21,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-10-24 00:54:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:21,299 INFO L225 Difference]: With dead ends: 73 [2020-10-24 00:54:21,299 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:54:21,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:54:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-10-24 00:54:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-24 00:54:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-10-24 00:54:21,319 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2020-10-24 00:54:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:21,320 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-10-24 00:54:21,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-10-24 00:54:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-24 00:54:21,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:21,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:21,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:54:21,322 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 982288804, now seen corresponding path program 1 times [2020-10-24 00:54:21,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:21,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039591532] [2020-10-24 00:54:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:21,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:21,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:21,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:21,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039591532] [2020-10-24 00:54:21,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:21,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:54:21,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580599214] [2020-10-24 00:54:21,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:21,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:21,570 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-10-24 00:54:22,115 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-24 00:54:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:22,291 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-10-24 00:54:22,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:22,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-10-24 00:54:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:22,293 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:54:22,294 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 00:54:22,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 00:54:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 00:54:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:54:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-10-24 00:54:22,313 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-10-24 00:54:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:22,313 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-10-24 00:54:22,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-10-24 00:54:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:54:22,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:22,316 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:22,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:54:22,316 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:22,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:22,317 INFO L82 PathProgramCache]: Analyzing trace with hash 935446002, now seen corresponding path program 1 times [2020-10-24 00:54:22,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:22,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254596561] [2020-10-24 00:54:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:22,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:22,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:22,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:22,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:22,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254596561] [2020-10-24 00:54:22,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:22,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:22,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952689376] [2020-10-24 00:54:22,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:22,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:22,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:22,616 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-10-24 00:54:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:22,982 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-10-24 00:54:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:22,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-10-24 00:54:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:22,985 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:54:22,985 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:54:22,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:54:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-10-24 00:54:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-24 00:54:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-10-24 00:54:23,004 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2020-10-24 00:54:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:23,005 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-10-24 00:54:23,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-10-24 00:54:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:54:23,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:23,007 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:23,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:54:23,007 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1355534926, now seen corresponding path program 1 times [2020-10-24 00:54:23,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:23,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [13522509] [2020-10-24 00:54:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:23,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:23,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:23,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:23,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:23,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [13522509] [2020-10-24 00:54:23,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:23,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:54:23,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781964027] [2020-10-24 00:54:23,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:23,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:23,271 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-10-24 00:54:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:23,946 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-10-24 00:54:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:23,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-10-24 00:54:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:23,950 INFO L225 Difference]: With dead ends: 85 [2020-10-24 00:54:23,950 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 00:54:23,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 00:54:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-10-24 00:54:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 00:54:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-10-24 00:54:23,972 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2020-10-24 00:54:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:23,973 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-10-24 00:54:23,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-10-24 00:54:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:54:23,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:23,974 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:23,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:54:23,975 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1484823182, now seen corresponding path program 1 times [2020-10-24 00:54:23,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:23,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [687343722] [2020-10-24 00:54:23,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:24,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:24,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:24,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:24,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:24,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [687343722] [2020-10-24 00:54:24,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:24,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:54:24,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270521877] [2020-10-24 00:54:24,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:54:24,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:54:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:54:24,351 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2020-10-24 00:54:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:25,344 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2020-10-24 00:54:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:54:25,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-10-24 00:54:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:25,349 INFO L225 Difference]: With dead ends: 71 [2020-10-24 00:54:25,349 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 00:54:25,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:54:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 00:54:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2020-10-24 00:54:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 00:54:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-10-24 00:54:25,367 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 43 [2020-10-24 00:54:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:25,367 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-10-24 00:54:25,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:54:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-10-24 00:54:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 00:54:25,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:25,369 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:25,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:54:25,369 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash 463887169, now seen corresponding path program 1 times [2020-10-24 00:54:25,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:25,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [147534027] [2020-10-24 00:54:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:25,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:25,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:25,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:25,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:25,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:54:25,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [147534027] [2020-10-24 00:54:25,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:25,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-24 00:54:25,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820196270] [2020-10-24 00:54:25,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:25,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:25,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:25,629 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 9 states. [2020-10-24 00:54:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:26,271 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-10-24 00:54:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:26,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-10-24 00:54:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:26,273 INFO L225 Difference]: With dead ends: 91 [2020-10-24 00:54:26,273 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 00:54:26,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 00:54:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2020-10-24 00:54:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-24 00:54:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-10-24 00:54:26,295 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2020-10-24 00:54:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:26,295 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-10-24 00:54:26,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-10-24 00:54:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 00:54:26,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:26,297 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:26,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:54:26,297 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1827093759, now seen corresponding path program 1 times [2020-10-24 00:54:26,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:26,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112600115] [2020-10-24 00:54:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:26,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:26,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:26,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:26,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:26,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:54:26,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112600115] [2020-10-24 00:54:26,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:26,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:54:26,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915400029] [2020-10-24 00:54:26,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:54:26,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:26,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:54:26,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:54:26,565 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 12 states. [2020-10-24 00:54:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:27,478 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2020-10-24 00:54:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:54:27,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-10-24 00:54:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:27,481 INFO L225 Difference]: With dead ends: 97 [2020-10-24 00:54:27,481 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:54:27,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:54:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:54:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2020-10-24 00:54:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-24 00:54:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-10-24 00:54:27,513 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 52 [2020-10-24 00:54:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:27,513 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-10-24 00:54:27,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:54:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-10-24 00:54:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-24 00:54:27,515 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:27,515 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:27,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:54:27,516 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:27,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1956382015, now seen corresponding path program 1 times [2020-10-24 00:54:27,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:27,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755512295] [2020-10-24 00:54:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:27,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:27,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:27,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:27,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:27,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:54:27,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755512295] [2020-10-24 00:54:27,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:27,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:54:27,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259714781] [2020-10-24 00:54:27,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:54:27,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:54:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:54:27,909 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 15 states. [2020-10-24 00:54:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:29,327 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2020-10-24 00:54:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:54:29,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-10-24 00:54:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:29,329 INFO L225 Difference]: With dead ends: 85 [2020-10-24 00:54:29,329 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 00:54:29,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:54:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 00:54:29,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-10-24 00:54:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 00:54:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-24 00:54:29,348 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 52 [2020-10-24 00:54:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:29,349 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-24 00:54:29,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:54:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-24 00:54:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:54:29,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:29,351 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:29,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:54:29,351 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1484609405, now seen corresponding path program 1 times [2020-10-24 00:54:29,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:29,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1924222587] [2020-10-24 00:54:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-24 00:54:29,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1924222587] [2020-10-24 00:54:29,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:29,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:54:29,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991798557] [2020-10-24 00:54:29,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:54:29,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:29,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:54:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:54:29,639 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 12 states. [2020-10-24 00:54:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:30,514 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2020-10-24 00:54:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:54:30,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-10-24 00:54:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:30,517 INFO L225 Difference]: With dead ends: 105 [2020-10-24 00:54:30,518 INFO L226 Difference]: Without dead ends: 83 [2020-10-24 00:54:30,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-10-24 00:54:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-24 00:54:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-10-24 00:54:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-24 00:54:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2020-10-24 00:54:30,566 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 61 [2020-10-24 00:54:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:30,568 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2020-10-24 00:54:30,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:54:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2020-10-24 00:54:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:54:30,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:30,573 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:30,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:54:30,574 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash 519376963, now seen corresponding path program 2 times [2020-10-24 00:54:30,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:30,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1269691569] [2020-10-24 00:54:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:30,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:30,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:30,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:30,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:30,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:30,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-24 00:54:31,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1269691569] [2020-10-24 00:54:31,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:31,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:54:31,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633623726] [2020-10-24 00:54:31,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:54:31,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:54:31,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:54:31,035 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 15 states. [2020-10-24 00:54:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:32,297 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2020-10-24 00:54:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:54:32,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-10-24 00:54:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:32,300 INFO L225 Difference]: With dead ends: 113 [2020-10-24 00:54:32,300 INFO L226 Difference]: Without dead ends: 91 [2020-10-24 00:54:32,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:54:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-24 00:54:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2020-10-24 00:54:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 00:54:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2020-10-24 00:54:32,348 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 61 [2020-10-24 00:54:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:32,348 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2020-10-24 00:54:32,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:54:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2020-10-24 00:54:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 00:54:32,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:32,352 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-24 00:54:32,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:54:32,352 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -123538722, now seen corresponding path program 2 times [2020-10-24 00:54:32,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:32,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1501904566] [2020-10-24 00:54:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-24 00:54:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-24 00:54:32,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1501904566] [2020-10-24 00:54:32,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:32,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:54:32,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233979862] [2020-10-24 00:54:32,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:54:32,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:54:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:54:32,775 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 15 states. [2020-10-24 00:54:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:34,016 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2020-10-24 00:54:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:54:34,017 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2020-10-24 00:54:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:34,017 INFO L225 Difference]: With dead ends: 102 [2020-10-24 00:54:34,017 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:54:34,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:54:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:54:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:54:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:54:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:54:34,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2020-10-24 00:54:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:34,020 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:54:34,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:54:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:54:34,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:54:34,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:54:34,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:54:35,077 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 14 [2020-10-24 00:54:35,225 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2020-10-24 00:54:35,338 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 16 [2020-10-24 00:54:35,597 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-10-24 00:54:35,812 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 22 [2020-10-24 00:54:36,103 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-10-24 00:54:36,243 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-10-24 00:54:36,367 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 18 [2020-10-24 00:54:36,603 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2020-10-24 00:54:36,858 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-10-24 00:54:37,088 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-10-24 00:54:37,222 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2020-10-24 00:54:37,230 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,230 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,230 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,230 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,230 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,231 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,231 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,231 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,231 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,231 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:54:37,232 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,232 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,232 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:54:37,232 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,232 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-10-24 00:54:37,232 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-10-24 00:54:37,233 INFO L270 CegarLoopResult]: At program point id2FINAL(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-10-24 00:54:37,233 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-24 00:54:37,233 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-10-24 00:54:37,233 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 00:54:37,233 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= |id2_#t~ret8| 0)) (and (<= 2 |id2_#t~ret8|) (<= |id2_#t~ret8| 2)) (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3)) (and (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|))) [2020-10-24 00:54:37,233 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-24 00:54:37,234 INFO L270 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= 1 id2_~ret~1) (<= |id2_#t~ret8| 0) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= |id2_#t~ret8| 2) (<= 2 |id2_#t~ret8|)) (and (<= 3 |id2_#t~ret8|) (<= 4 id2_~ret~1) (<= |id2_#t~ret8| 3) (<= (div id2_~ret~1 4294967296) 0))) [2020-10-24 00:54:37,234 INFO L270 CegarLoopResult]: At program point id2EXIT(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-10-24 00:54:37,234 INFO L277 CegarLoopResult]: At program point id2ENTRY(lines 16 21) the Hoare annotation is: true [2020-10-24 00:54:37,234 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,234 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,234 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,234 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:54:37,234 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 23 29) the Hoare annotation is: true [2020-10-24 00:54:37,235 INFO L270 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-10-24 00:54:37,235 INFO L270 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~result~0 3) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-10-24 00:54:37,235 INFO L270 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: false [2020-10-24 00:54:37,235 INFO L277 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-10-24 00:54:37,235 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 23 29) the Hoare annotation is: true [2020-10-24 00:54:37,235 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-24 00:54:37,236 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (and (<= |main_#t~ret10| 3) (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|)) (= |main_#t~ret10| 0) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|))) [2020-10-24 00:54:37,236 INFO L277 CegarLoopResult]: At program point L26-2(lines 23 29) the Hoare annotation is: true [2020-10-24 00:54:37,236 INFO L270 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= main_~result~0 3) (<= |main_#t~ret10| 3) .cse0 (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|) (<= main_~result~0 1) .cse0) (and (= main_~result~0 0) (= |main_#t~ret10| 0)) (and (<= main_~result~0 2) (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|) .cse0))) [2020-10-24 00:54:37,236 INFO L270 CegarLoopResult]: At program point idFINAL(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-10-24 00:54:37,236 INFO L270 CegarLoopResult]: At program point idEXIT(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-10-24 00:54:37,236 INFO L277 CegarLoopResult]: At program point idENTRY(lines 9 14) the Hoare annotation is: true [2020-10-24 00:54:37,237 INFO L270 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-10-24 00:54:37,237 INFO L270 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-10-24 00:54:37,237 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-24 00:54:37,237 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-24 00:54:37,237 INFO L277 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-10-24 00:54:37,237 INFO L270 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (or (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|)) (and (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= 0 |id_#t~ret7|) (<= |id_#t~ret7| 0)) (and (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3))) [2020-10-24 00:54:37,237 INFO L277 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-10-24 00:54:37,237 INFO L270 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= 3 |id_#t~ret7|) (<= (div id_~ret~0 4294967296) 0) (<= |id_#t~ret7| 3)) (and (<= 3 id_~ret~0) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= id_~ret~0 3)) (and (<= id_~ret~0 2) (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 id_~ret~0)) (and (<= 0 |id_#t~ret7|) (<= id_~ret~0 1) (<= |id_#t~ret7| 0) (<= 1 id_~ret~0))) [2020-10-24 00:54:37,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:54:37 BoogieIcfgContainer [2020-10-24 00:54:37,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:54:37,258 INFO L168 Benchmark]: Toolchain (without parser) took 19031.10 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 127.9 MB in the beginning and 88.9 MB in the end (delta: 39.0 MB). Peak memory consumption was 123.8 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:37,259 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 125.8 MB. Free memory is still 86.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:54:37,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.71 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 117.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:37,260 INFO L168 Benchmark]: Boogie Preprocessor took 63.27 ms. Allocated memory is still 151.0 MB. Free memory was 117.4 MB in the beginning and 116.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:37,261 INFO L168 Benchmark]: RCFGBuilder took 709.81 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 101.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:37,262 INFO L168 Benchmark]: TraceAbstraction took 17947.83 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 100.9 MB in the beginning and 88.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 96.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:37,265 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.23 ms. Allocated memory is still 125.8 MB. Free memory is still 86.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 290.71 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 117.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 63.27 ms. Allocated memory is still 151.0 MB. Free memory was 117.4 MB in the beginning and 116.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 709.81 ms. Allocated memory is still 151.0 MB. Free memory was 116.1 MB in the beginning and 101.1 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17947.83 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 100.9 MB in the beginning and 88.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 96.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for id2 Derived contract for procedure id2: (((((1 <= ret && \result <= 1) && ret <= 1) && 1 <= \result) || (\result <= 0 && 0 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret)) || (\result <= 3 && 3 <= \result) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: (((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (0 <= \result && \result <= 0)) || (\result <= 3 && 3 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.6s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 528 SDtfs, 504 SDslu, 1471 SDs, 0 SdLazy, 3843 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 105 PreInvPairs, 247 NumberOfFragments, 606 HoareAnnotationTreeSize, 105 FomulaSimplifications, 68689 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 50 FomulaSimplificationsInter, 5206 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 99750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 102/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...