/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/fibo_7-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:05:58,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:05:58,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:05:58,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:05:58,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:05:58,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:05:58,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:05:58,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:05:58,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:05:58,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:05:58,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:05:58,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:05:58,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:05:58,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:05:58,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:05:58,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:05:58,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:05:58,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:05:58,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:05:58,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:05:58,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:05:58,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:05:58,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:05:58,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:05:58,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:05:58,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:05:58,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:05:58,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:05:58,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:05:58,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:05:58,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:05:58,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:05:58,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:05:58,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:05:58,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:05:58,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:05:58,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:05:58,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:05:58,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:05:58,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:05:58,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:05:58,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:05:58,738 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:05:58,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:05:58,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:05:58,744 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:05:58,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:05:58,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:05:58,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:05:58,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:05:58,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:05:58,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:05:58,748 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:05:58,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:05:58,748 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:05:58,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:05:58,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:05:58,749 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:05:58,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:05:58,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:05:58,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:05:58,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:05:58,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:05:58,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:05:58,750 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-11-07 05:05:59,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:05:59,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:05:59,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:05:59,218 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:05:59,220 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:05:59,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-1.c [2020-11-07 05:05:59,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb87a2cb/61bfc2ca3ee44eadbe341f11dd0856a0/FLAG32f2242db [2020-11-07 05:06:00,090 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:06:00,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-1.c [2020-11-07 05:06:00,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb87a2cb/61bfc2ca3ee44eadbe341f11dd0856a0/FLAG32f2242db [2020-11-07 05:06:00,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb87a2cb/61bfc2ca3ee44eadbe341f11dd0856a0 [2020-11-07 05:06:00,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:06:00,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:06:00,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:06:00,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:06:00,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:06:00,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e164a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00, skipping insertion in model container [2020-11-07 05:06:00,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:06:00,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:06:00,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:06:00,667 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:06:00,686 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:06:00,705 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:06:00,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00 WrapperNode [2020-11-07 05:06:00,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:06:00,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:06:00,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:06:00,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:06:00,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (1/1) ... [2020-11-07 05:06:00,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:06:00,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:06:00,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:06:00,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:06:00,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (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-11-07 05:06:00,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:06:00,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:06:00,837 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:06:00,837 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 05:06:00,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:06:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:06:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:06:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:06:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:06:00,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:06:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 05:06:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:06:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:06:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:06:00,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:06:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:06:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:06:00,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:06:01,195 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:06:01,195 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:06:01,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:01 BoogieIcfgContainer [2020-11-07 05:06:01,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:06:01,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:06:01,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:06:01,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:06:01,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:06:00" (1/3) ... [2020-11-07 05:06:01,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ead81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:01, skipping insertion in model container [2020-11-07 05:06:01,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:00" (2/3) ... [2020-11-07 05:06:01,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ead81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:01, skipping insertion in model container [2020-11-07 05:06:01,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:01" (3/3) ... [2020-11-07 05:06:01,209 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2020-11-07 05:06:01,229 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:06:01,233 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:06:01,268 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:06:01,342 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:06:01,342 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:06:01,342 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:06:01,342 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:06:01,342 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:06:01,343 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:06:01,343 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:06:01,346 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:06:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 05:06:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:06:01,398 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:01,400 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-11-07 05:06:01,401 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:01,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 05:06:01,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:01,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1760099760] [2020-11-07 05:06:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:02,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1760099760] [2020-11-07 05:06:02,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:02,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:02,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777909505] [2020-11-07 05:06:02,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:02,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:02,120 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 05:06:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:02,520 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-11-07 05:06:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:06:02,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:06:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:02,536 INFO L225 Difference]: With dead ends: 57 [2020-11-07 05:06:02,536 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:06:02,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:06:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:06:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:06:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:06:02,608 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 05:06:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:02,609 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:06:02,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:06:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:06:02,612 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:02,612 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] [2020-11-07 05:06:02,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:06:02,613 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 05:06:02,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:02,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386160248] [2020-11-07 05:06:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:02,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386160248] [2020-11-07 05:06:02,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:02,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:02,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132697527] [2020-11-07 05:06:02,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:02,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:02,799 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 05:06:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:03,092 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 05:06:03,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:06:03,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:06:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:03,095 INFO L225 Difference]: With dead ends: 46 [2020-11-07 05:06:03,095 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:06:03,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:06:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 05:06:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:06:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:06:03,115 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 05:06:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:03,115 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:06:03,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:06:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:06:03,118 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:03,119 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:03,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:06:03,119 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:03,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 05:06:03,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:03,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [369979008] [2020-11-07 05:06:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:06:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 05:06:03,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [369979008] [2020-11-07 05:06:03,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:03,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:06:03,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913085507] [2020-11-07 05:06:03,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:06:03,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:03,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:06:03,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:06:03,340 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 05:06:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:03,630 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 05:06:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:03,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:06:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:03,633 INFO L225 Difference]: With dead ends: 62 [2020-11-07 05:06:03,633 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:06:03,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:06:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:06:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 05:06:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 05:06:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 05:06:03,649 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 05:06:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:03,650 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 05:06:03,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:06:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 05:06:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:06:03,652 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:03,652 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-11-07 05:06:03,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:06:03,653 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:03,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:03,654 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 05:06:03,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:03,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292485454] [2020-11-07 05:06:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:06:03,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292485454] [2020-11-07 05:06:03,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:03,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:06:03,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992678358] [2020-11-07 05:06:03,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:06:03,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:06:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:06:03,853 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 05:06:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:04,271 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 05:06:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:06:04,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 05:06:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:04,274 INFO L225 Difference]: With dead ends: 66 [2020-11-07 05:06:04,274 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:06:04,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:06:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:06:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:06:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:06:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 05:06:04,295 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 05:06:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:04,296 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 05:06:04,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:06:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 05:06:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:06:04,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:04,299 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 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-11-07 05:06:04,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:06:04,300 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 05:06:04,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:04,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405827649] [2020-11-07 05:06:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 05:06:04,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405827649] [2020-11-07 05:06:04,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:04,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:06:04,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348918129] [2020-11-07 05:06:04,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:06:04,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:06:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:06:04,540 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 05:06:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:04,999 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 05:06:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:06:05,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:06:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:05,003 INFO L225 Difference]: With dead ends: 118 [2020-11-07 05:06:05,003 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 05:06:05,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:06:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 05:06:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 05:06:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 05:06:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 05:06:05,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 05:06:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:05,027 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 05:06:05,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:06:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 05:06:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:06:05,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:05,030 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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-11-07 05:06:05,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:06:05,031 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 05:06:05,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:05,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335144009] [2020-11-07 05:06:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 05:06:05,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335144009] [2020-11-07 05:06:05,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:05,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:06:05,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488341695] [2020-11-07 05:06:05,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:06:05,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:05,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:06:05,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:06:05,271 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 05:06:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:05,853 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 05:06:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:06:05,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 05:06:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:05,858 INFO L225 Difference]: With dead ends: 96 [2020-11-07 05:06:05,859 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 05:06:05,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:06:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 05:06:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 05:06:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 05:06:05,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 05:06:05,901 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 05:06:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:05,902 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 05:06:05,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:06:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 05:06:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:06:05,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:05,905 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:05,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:06:05,906 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 05:06:05,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:05,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1406811847] [2020-11-07 05:06:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:05,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-11-07 05:06:06,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1406811847] [2020-11-07 05:06:06,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:06,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:06:06,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021944350] [2020-11-07 05:06:06,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:06:06,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:06:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:06,325 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 05:06:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:07,001 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 05:06:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:06:07,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 05:06:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:07,010 INFO L225 Difference]: With dead ends: 146 [2020-11-07 05:06:07,010 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 05:06:07,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:06:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 05:06:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 05:06:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:06:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 05:06:07,097 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 05:06:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:07,098 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 05:06:07,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:06:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 05:06:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 05:06:07,123 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:07,123 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:07,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:06:07,123 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:07,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 05:06:07,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:07,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984789713] [2020-11-07 05:06:07,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-11-07 05:06:07,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984789713] [2020-11-07 05:06:07,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:07,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:06:07,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294623431] [2020-11-07 05:06:07,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:06:07,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:07,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:06:07,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:07,598 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-11-07 05:06:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:08,463 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-11-07 05:06:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:06:08,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-11-07 05:06:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:08,469 INFO L225 Difference]: With dead ends: 240 [2020-11-07 05:06:08,469 INFO L226 Difference]: Without dead ends: 233 [2020-11-07 05:06:08,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:06:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-07 05:06:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-11-07 05:06:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 05:06:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-11-07 05:06:08,547 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-11-07 05:06:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:08,550 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-11-07 05:06:08,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:06:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-11-07 05:06:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-11-07 05:06:08,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:08,560 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:08,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:06:08,561 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2132540428, now seen corresponding path program 6 times [2020-11-07 05:06:08,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:08,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [491585952] [2020-11-07 05:06:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:08,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 536 proven. 797 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2020-11-07 05:06:09,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [491585952] [2020-11-07 05:06:09,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:09,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:06:09,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253589207] [2020-11-07 05:06:09,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:06:09,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:06:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:06:09,441 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 16 states. [2020-11-07 05:06:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:11,737 INFO L93 Difference]: Finished difference Result 334 states and 574 transitions. [2020-11-07 05:06:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 05:06:11,738 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 272 [2020-11-07 05:06:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:11,743 INFO L225 Difference]: With dead ends: 334 [2020-11-07 05:06:11,743 INFO L226 Difference]: Without dead ends: 132 [2020-11-07 05:06:11,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=393, Invalid=1499, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:06:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-07 05:06:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2020-11-07 05:06:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-11-07 05:06:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2020-11-07 05:06:11,785 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 272 [2020-11-07 05:06:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:11,786 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2020-11-07 05:06:11,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:06:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2020-11-07 05:06:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-11-07 05:06:11,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:11,808 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:11,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:06:11,808 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1553933834, now seen corresponding path program 7 times [2020-11-07 05:06:11,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:11,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580490185] [2020-11-07 05:06:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:12,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:06:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 0 proven. 1944 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2020-11-07 05:06:13,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580490185] [2020-11-07 05:06:13,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:13,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:06:13,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377411403] [2020-11-07 05:06:13,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:06:13,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:06:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:06:13,640 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand 23 states. [2020-11-07 05:06:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:17,192 INFO L93 Difference]: Finished difference Result 163 states and 216 transitions. [2020-11-07 05:06:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 05:06:17,193 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 378 [2020-11-07 05:06:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:17,197 INFO L225 Difference]: With dead ends: 163 [2020-11-07 05:06:17,197 INFO L226 Difference]: Without dead ends: 156 [2020-11-07 05:06:17,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=244, Invalid=2836, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 05:06:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-07 05:06:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2020-11-07 05:06:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 05:06:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2020-11-07 05:06:17,230 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 378 [2020-11-07 05:06:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:17,232 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2020-11-07 05:06:17,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:06:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2020-11-07 05:06:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2020-11-07 05:06:17,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:17,243 INFO L422 BasicCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 17, 17, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:17,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:06:17,244 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1414632126, now seen corresponding path program 8 times [2020-11-07 05:06:17,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:17,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1513796551] [2020-11-07 05:06:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:17,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:06:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2020-11-07 05:06:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8871 backedges. 2070 proven. 2058 refuted. 0 times theorem prover too weak. 4743 trivial. 0 not checked. [2020-11-07 05:06:18,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1513796551] [2020-11-07 05:06:18,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:18,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:06:18,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493490338] [2020-11-07 05:06:18,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:06:18,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:06:18,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:06:18,918 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand 18 states. [2020-11-07 05:06:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:21,569 INFO L93 Difference]: Finished difference Result 282 states and 463 transitions. [2020-11-07 05:06:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-07 05:06:21,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 484 [2020-11-07 05:06:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:21,574 INFO L225 Difference]: With dead ends: 282 [2020-11-07 05:06:21,575 INFO L226 Difference]: Without dead ends: 170 [2020-11-07 05:06:21,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=516, Invalid=1934, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 05:06:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-11-07 05:06:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2020-11-07 05:06:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-07 05:06:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2020-11-07 05:06:21,615 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 484 [2020-11-07 05:06:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:21,616 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2020-11-07 05:06:21,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:06:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2020-11-07 05:06:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2020-11-07 05:06:21,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:21,627 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 16, 16, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:21,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:06:21,627 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash 520351719, now seen corresponding path program 9 times [2020-11-07 05:06:21,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:21,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409872286] [2020-11-07 05:06:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:21,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:21,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:21,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:06:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2020-11-07 05:06:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:22,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8185 backedges. 1117 proven. 1869 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2020-11-07 05:06:23,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409872286] [2020-11-07 05:06:23,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:23,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:06:23,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894016740] [2020-11-07 05:06:23,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:06:23,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:06:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:06:23,017 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand 16 states. [2020-11-07 05:06:24,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:24,784 INFO L93 Difference]: Finished difference Result 280 states and 390 transitions. [2020-11-07 05:06:24,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:06:24,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 466 [2020-11-07 05:06:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:24,789 INFO L225 Difference]: With dead ends: 280 [2020-11-07 05:06:24,789 INFO L226 Difference]: Without dead ends: 156 [2020-11-07 05:06:24,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2020-11-07 05:06:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-07 05:06:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2020-11-07 05:06:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 05:06:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2020-11-07 05:06:24,822 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 466 [2020-11-07 05:06:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:24,823 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2020-11-07 05:06:24,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:06:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2020-11-07 05:06:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2020-11-07 05:06:24,839 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:24,839 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:24,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:06:24,840 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash -240553225, now seen corresponding path program 10 times [2020-11-07 05:06:24,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:24,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43869467] [2020-11-07 05:06:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 05:06:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 05:06:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:25,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 05:06:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 702 proven. 2341 refuted. 0 times theorem prover too weak. 11216 trivial. 0 not checked. [2020-11-07 05:06:26,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43869467] [2020-11-07 05:06:26,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:26,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:06:26,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976070212] [2020-11-07 05:06:26,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:06:26,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:06:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:06:26,545 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 13 states. [2020-11-07 05:06:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:28,057 INFO L93 Difference]: Finished difference Result 244 states and 336 transitions. [2020-11-07 05:06:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:06:28,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 607 [2020-11-07 05:06:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:28,061 INFO L225 Difference]: With dead ends: 244 [2020-11-07 05:06:28,061 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:06:28,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:06:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:06:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:06:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:06:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:06:28,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 607 [2020-11-07 05:06:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:28,066 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:06:28,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:06:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:06:28,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:06:28,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:06:28,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:06:33,017 WARN L194 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 63 [2020-11-07 05:06:33,291 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 3 [2020-11-07 05:06:33,483 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 6 [2020-11-07 05:06:34,319 WARN L194 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 46 [2020-11-07 05:06:34,479 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 6 [2020-11-07 05:06:35,351 WARN L194 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 57 [2020-11-07 05:06:36,534 WARN L194 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 154 DAG size of output: 74 [2020-11-07 05:06:37,434 WARN L194 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 63 [2020-11-07 05:06:38,334 WARN L194 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 58 [2020-11-07 05:06:38,587 WARN L194 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 6 [2020-11-07 05:06:39,516 WARN L194 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 58 [2020-11-07 05:06:40,342 WARN L194 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 46 [2020-11-07 05:06:40,511 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 8 [2020-11-07 05:06:40,516 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,517 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L262 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-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,518 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,519 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:06:40,519 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 25 32) the Hoare annotation is: true [2020-11-07 05:06:40,519 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: false [2020-11-07 05:06:40,519 INFO L262 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: (and (<= 7 main_~x~0) (< 12 main_~result~0) (<= main_~result~0 13)) [2020-11-07 05:06:40,519 INFO L262 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: false [2020-11-07 05:06:40,519 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 7 main_~x~0) (<= main_~x~0 7)) [2020-11-07 05:06:40,519 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 13 |main_#t~ret9|) (<= 7 main_~x~0) (<= |main_#t~ret9| 13)) [2020-11-07 05:06:40,519 INFO L262 CegarLoopResult]: At program point L28-2(lines 28 30) the Hoare annotation is: (<= 7 main_~x~0) [2020-11-07 05:06:40,520 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= 13 |main_#t~ret9|) (<= 7 main_~x~0) (<= |main_#t~ret9| 13)) [2020-11-07 05:06:40,520 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 25 32) the Hoare annotation is: (<= 7 main_~x~0) [2020-11-07 05:06:40,520 INFO L262 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= 13 |main_#t~ret9|) (<= 7 main_~x~0) (< 12 main_~result~0) (<= main_~result~0 13) (<= |main_#t~ret9| 13)) [2020-11-07 05:06:40,520 INFO L262 CegarLoopResult]: At program point mainFINAL(lines 25 32) the Hoare annotation is: (<= 7 main_~x~0) [2020-11-07 05:06:40,520 INFO L262 CegarLoopResult]: At program point fiboEXIT(lines 7 15) the Hoare annotation is: (let ((.cse1 (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1))) (.cse0 (= fibo_~n |fibo_#in~n|))) (and (or (and (<= |fibo_#in~n| 0) .cse0) .cse1 (not (<= |fibo_#in~n| 1))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (and (< 0 fibo_~n) .cse0)) (or (not (<= |fibo_#in~n| 2)) .cse1 (not (<= 2 |fibo_#in~n|))) (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= |fibo_#in~n| 3)) (and (<= |fibo_#res| 8) (<= 6 fibo_~n) (<= 8 |fibo_#res|) (<= |fibo_#in~n| 6)) (and (<= 13 |fibo_#res|) (<= |fibo_#res| 13) (<= 7 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#in~n| 5) (<= |fibo_#res| 5)) (and .cse0 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (not (<= 3 |fibo_#in~n|))))) [2020-11-07 05:06:40,521 INFO L262 CegarLoopResult]: At program point fiboFINAL(lines 7 15) the Hoare annotation is: (let ((.cse1 (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1))) (.cse0 (= fibo_~n |fibo_#in~n|))) (and (or (and (<= |fibo_#in~n| 0) .cse0) .cse1 (not (<= |fibo_#in~n| 1))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (and (< 0 fibo_~n) .cse0)) (or (not (<= |fibo_#in~n| 2)) .cse1 (not (<= 2 |fibo_#in~n|))) (or (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= |fibo_#in~n| 3)) (and (<= |fibo_#res| 8) (<= 6 fibo_~n) (<= 8 |fibo_#res|) (<= |fibo_#in~n| 6)) (and (<= 13 |fibo_#res|) (<= |fibo_#res| 13) (<= 7 |fibo_#in~n|)) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#in~n| 5) (<= |fibo_#res| 5)) (and .cse0 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) (<= 4 |fibo_#in~n|)) (not (<= 3 |fibo_#in~n|))))) [2020-11-07 05:06:40,521 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 |fibo_#in~n|) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:40,521 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (and .cse2 (<= 8 |fibo_#in~n|))) (.cse1 (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= 7 fibo_~n) .cse2))) (and (or .cse0 (and (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5)) .cse1 (and .cse2 (<= |fibo_#in~n| 5))) (let ((.cse3 (<= |fibo_#t~ret7| 1)) (.cse4 (<= 1 |fibo_#t~ret7|))) (or (and (<= 6 fibo_~n) (<= |fibo_#in~n| 6) .cse2) (and .cse3 .cse4 (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and .cse3 (<= 2 |fibo_#in~n|) .cse4 (<= |fibo_#in~n| 2)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) (<= 3 |fibo_#t~ret7|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) .cse0 .cse1))))) [2020-11-07 05:06:40,521 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo_#in~n| 1) (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:40,521 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse2 (= fibo_~n |fibo_#in~n|))) (let ((.cse0 (and .cse2 (<= 8 |fibo_#in~n|))) (.cse1 (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= 7 fibo_~n) .cse2))) (and (or .cse0 (and (<= 5 |fibo_#t~ret7|) (<= |fibo_#t~ret7| 5)) .cse1 (and .cse2 (<= |fibo_#in~n| 5))) (let ((.cse3 (<= |fibo_#t~ret7| 1)) (.cse4 (<= 1 |fibo_#t~ret7|))) (or (and (<= 6 fibo_~n) (<= |fibo_#in~n| 6) .cse2) (and .cse3 .cse4 (<= 3 |fibo_#in~n|) (<= |fibo_#in~n| 3)) (and .cse3 (<= 2 |fibo_#in~n|) .cse4 (<= |fibo_#in~n| 2)) (and (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) (<= 3 |fibo_#t~ret7|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) .cse0 .cse1))))) [2020-11-07 05:06:40,521 INFO L262 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:40,522 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse3 (= fibo_~n |fibo_#in~n|)) (.cse1 (+ |fibo_#t~ret8| |fibo_#t~ret7|))) (or (and .cse0 (<= 1 .cse1) (<= .cse1 1) (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#in~n| 2) .cse3) (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= .cse1 13) (<= 13 .cse1) (<= 7 |fibo_#in~n|) .cse3) (and .cse3 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse1) (<= .cse1 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 .cse1) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= .cse1 5)) (and (<= .cse1 2) .cse0 (<= 2 .cse1) .cse2 (<= 3 |fibo_#in~n|) .cse3 (<= |fibo_#in~n| 3)) (and (<= 8 .cse1) (<= 5 |fibo_#t~ret7|) (<= 6 fibo_~n) (<= |fibo_#t~ret7| 5) (<= |fibo_#in~n| 6) .cse3 (<= .cse1 8)))) [2020-11-07 05:06:40,522 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|)) [2020-11-07 05:06:40,522 INFO L262 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse3 (= fibo_~n |fibo_#in~n|)) (.cse1 (+ |fibo_#t~ret8| |fibo_#t~ret7|))) (or (and .cse0 (<= 1 .cse1) (<= .cse1 1) (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#in~n| 2) .cse3) (and (<= |fibo_#t~ret7| 8) (<= 8 |fibo_#t~ret7|) (<= .cse1 13) (<= 13 .cse1) (<= 7 |fibo_#in~n|) .cse3) (and .cse3 (<= 8 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse1) (<= .cse1 3) .cse3 (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and (<= 5 .cse1) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse3 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= .cse1 5)) (and (<= .cse1 2) .cse0 (<= 2 .cse1) .cse2 (<= 3 |fibo_#in~n|) .cse3 (<= |fibo_#in~n| 3)) (and (<= 8 .cse1) (<= 5 |fibo_#t~ret7|) (<= 6 fibo_~n) (<= |fibo_#t~ret7| 5) (<= |fibo_#in~n| 6) .cse3 (<= .cse1 8)))) [2020-11-07 05:06:40,522 INFO L262 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-11-07 05:06:40,523 INFO L262 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse1 (+ |fibo_#t~ret8| |fibo_#t~ret7|))) (and (or (not (<= |fibo_#in~n| 2)) (and (<= 1 |fibo_#res|) .cse0 (<= 1 .cse1) (<= .cse1 1) (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#res| 1))) (or (and (<= 8 .cse1) (<= |fibo_#res| 8) (<= 5 |fibo_#t~ret7|) (<= 6 fibo_~n) (<= |fibo_#t~ret7| 5) (<= 8 |fibo_#res|) (<= |fibo_#in~n| 6) (<= .cse1 8)) (and (<= 5 |fibo_#res|) (<= 5 .cse1) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= .cse1 5) (<= |fibo_#res| 5)) (and (<= |fibo_#t~ret7| 8) (<= 13 |fibo_#res|) (<= 8 |fibo_#t~ret7|) (<= .cse1 13) (<= 13 .cse1) (<= 7 |fibo_#in~n|) (<= |fibo_#res| 13)) (and (<= .cse1 2) .cse0 (<= 2 |fibo_#res|) (<= 2 .cse1) .cse2 (<= |fibo_#res| 2) (<= |fibo_#in~n| 3)) (not (<= 3 |fibo_#in~n|)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= 3 .cse1) (<= |fibo_#res| 3) (<= .cse1 3) (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (<= 8 |fibo_#in~n|)) (= fibo_~n |fibo_#in~n|))) [2020-11-07 05:06:40,523 INFO L262 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse1 (<= |fibo_#t~ret7| 1)) (.cse2 (<= 1 |fibo_#t~ret7|)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= |fibo_#t~ret7| 8) (<= 13 |fibo_#res|) (<= 8 |fibo_#t~ret7|) (<= 7 |fibo_#in~n|) .cse0 (<= |fibo_#res| 13)) (and (<= |fibo_#t~ret7| 2) (<= |fibo_#in~n| 4) (<= |fibo_#res| 3) .cse0 (<= 3 |fibo_#res|) (<= 2 |fibo_#t~ret7|) (<= 4 |fibo_#in~n|)) (and .cse1 (<= 2 |fibo_#res|) .cse2 (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|) .cse0 (<= |fibo_#in~n| 3)) (and (<= 1 |fibo_#res|) .cse1 (<= 2 |fibo_#in~n|) .cse2 (<= |fibo_#res| 1) (<= |fibo_#in~n| 2) .cse0) (and (<= 5 |fibo_#res|) (<= 5 |fibo_#in~n|) (<= |fibo_#t~ret7| 3) .cse0 (<= |fibo_#in~n| 5) (<= 3 |fibo_#t~ret7|) (<= |fibo_#res| 5)) (and (<= |fibo_#res| 8) (<= 5 |fibo_#t~ret7|) (<= 6 fibo_~n) (<= |fibo_#t~ret7| 5) (<= 8 |fibo_#res|) (<= |fibo_#in~n| 6) .cse0) (and .cse0 (<= 8 |fibo_#in~n|)))) [2020-11-07 05:06:40,523 INFO L269 CegarLoopResult]: At program point fiboENTRY(lines 7 15) the Hoare annotation is: true [2020-11-07 05:06:40,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:40 BoogieIcfgContainer [2020-11-07 05:06:40,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:06:40,550 INFO L168 Benchmark]: Toolchain (without parser) took 40108.79 ms. Allocated memory was 157.3 MB in the beginning and 679.5 MB in the end (delta: 522.2 MB). Free memory was 134.1 MB in the beginning and 555.9 MB in the end (delta: -421.8 MB). Peak memory consumption was 403.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:40,551 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 125.8 MB. Free memory is still 97.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:06:40,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.39 ms. Allocated memory is still 157.3 MB. Free memory was 133.4 MB in the beginning and 124.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:40,552 INFO L168 Benchmark]: Boogie Preprocessor took 37.07 ms. Allocated memory is still 157.3 MB. Free memory was 124.3 MB in the beginning and 123.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:40,553 INFO L168 Benchmark]: RCFGBuilder took 452.60 ms. Allocated memory is still 157.3 MB. Free memory was 122.9 MB in the beginning and 135.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 11.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:40,554 INFO L168 Benchmark]: TraceAbstraction took 39348.16 ms. Allocated memory was 157.3 MB in the beginning and 679.5 MB in the end (delta: 522.2 MB). Free memory was 135.1 MB in the beginning and 555.9 MB in the end (delta: -420.8 MB). Peak memory consumption was 404.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:40,562 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.38 ms. Allocated memory is still 125.8 MB. Free memory is still 97.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 257.39 ms. Allocated memory is still 157.3 MB. Free memory was 133.4 MB in the beginning and 124.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.07 ms. Allocated memory is still 157.3 MB. Free memory was 124.3 MB in the beginning and 123.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 452.60 ms. Allocated memory is still 157.3 MB. Free memory was 122.9 MB in the beginning and 135.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 11.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 39348.16 ms. Allocated memory was 157.3 MB in the beginning and 679.5 MB in the end (delta: 522.2 MB). Free memory was 135.1 MB in the beginning and 555.9 MB in the end (delta: -420.8 MB). Peak memory consumption was 404.3 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: 25]: Procedure Contract for main Derived contract for procedure main: 7 <= x - ProcedureContractResult [Line: 7]: Procedure Contract for fibo Derived contract for procedure fibo: (((((\old(n) <= 0 && n == \old(n)) || (1 <= \result && \result <= 1)) || !(\old(n) <= 1)) && ((0 <= \result && \result <= 0) || (0 < n && n == \old(n)))) && ((!(\old(n) <= 2) || (1 <= \result && \result <= 1)) || !(2 <= \old(n)))) && ((((((((2 <= \result && \result <= 2) && \old(n) <= 3) || (((\result <= 8 && 6 <= n) && 8 <= \result) && \old(n) <= 6)) || ((13 <= \result && \result <= 13) && 7 <= \old(n))) || (((5 <= \result && 5 <= \old(n)) && \old(n) <= 5) && \result <= 5)) || (n == \old(n) && 8 <= \old(n))) || (((\old(n) <= 4 && \result <= 3) && 3 <= \result) && 4 <= \old(n))) || !(3 <= \old(n))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.7s, OverallIterations: 13, TraceHistogramMax: 67, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 612 SDtfs, 1247 SDslu, 1236 SDs, 0 SdLazy, 4473 SolverSat, 786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 990 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 127 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 1575 PreInvPairs, 2700 NumberOfFragments, 1265 HoareAnnotationTreeSize, 1575 FomulaSimplifications, 75584 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 43 FomulaSimplificationsInter, 40301 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 2798 NumberOfCodeBlocks, 2798 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2785 ConstructedInterpolants, 0 QuantifiedInterpolants, 2133049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 31353/41056 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...