/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:26:33,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:26:33,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:26:33,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:26:33,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:26:33,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:26:33,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:26:33,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:26:33,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:26:33,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:26:33,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:26:33,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:26:33,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:26:33,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:26:33,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:26:33,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:26:33,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:26:33,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:26:33,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:26:33,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:26:33,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:26:33,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:26:33,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:26:33,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:26:33,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:26:33,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:26:33,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:26:33,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:26:33,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:26:33,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:26:33,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:26:33,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:26:33,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:26:33,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:26:33,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:26:33,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:26:33,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:26:33,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:26:33,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:26:33,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:26:33,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:26:33,822 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 00:26:33,834 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:26:33,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:26:33,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:26:33,836 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:26:33,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:26:33,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:26:33,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:26:33,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:26:33,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:26:33,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:26:33,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:26:33,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:26:33,838 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:26:33,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:26:33,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:26:33,839 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:26:33,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:26:33,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:26:33,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:26:33,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:26:33,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:26:33,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:26:33,840 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 [2020-11-07 00:26:34,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:26:34,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:26:34,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:26:34,231 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:26:34,232 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:26:34,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-11-07 00:26:34,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2d92acb/fde6172ff8f64549a6c7d5f270d500fb/FLAG194498b1e [2020-11-07 00:26:34,961 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:26:34,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-11-07 00:26:34,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2d92acb/fde6172ff8f64549a6c7d5f270d500fb/FLAG194498b1e [2020-11-07 00:26:35,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e2d92acb/fde6172ff8f64549a6c7d5f270d500fb [2020-11-07 00:26:35,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:26:35,332 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:26:35,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:26:35,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:26:35,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:26:35,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3a66a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35, skipping insertion in model container [2020-11-07 00:26:35,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:26:35,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:26:35,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:26:35,529 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:26:35,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:26:35,563 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:26:35,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35 WrapperNode [2020-11-07 00:26:35,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:26:35,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:26:35,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:26:35,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:26:35,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (1/1) ... [2020-11-07 00:26:35,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:26:35,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:26:35,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:26:35,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:26:35,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (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 00:26:35,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:26:35,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:26:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:26:35,693 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 00:26:35,694 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:26:35,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:26:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:26:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:26:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:26:35,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:26:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 00:26:35,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:26:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:26:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:26:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:26:35,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:26:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:26:35,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:26:36,029 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:26:36,030 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:26:36,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:26:36 BoogieIcfgContainer [2020-11-07 00:26:36,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:26:36,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:26:36,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:26:36,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:26:36,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:26:35" (1/3) ... [2020-11-07 00:26:36,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e5662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:26:36, skipping insertion in model container [2020-11-07 00:26:36,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:26:35" (2/3) ... [2020-11-07 00:26:36,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e5662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:26:36, skipping insertion in model container [2020-11-07 00:26:36,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:26:36" (3/3) ... [2020-11-07 00:26:36,068 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-11-07 00:26:36,086 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:26:36,089 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:26:36,103 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:26:36,135 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:26:36,135 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:26:36,135 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:26:36,135 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:26:36,136 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:26:36,136 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:26:36,139 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:26:36,139 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:26:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 00:26:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:26:36,185 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:36,186 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 00:26:36,187 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 00:26:36,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:36,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387507721] [2020-11-07 00:26:36,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:36,307 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:36,687 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 00:26:36,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387507721] [2020-11-07 00:26:36,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:36,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:26:36,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339686696] [2020-11-07 00:26:36,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:26:36,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:36,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:26:36,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:26:36,715 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 00:26:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:37,312 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-11-07 00:26:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:26:37,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:26:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:37,326 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:26:37,326 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:26:37,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:26:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:26:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:26:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:26:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:26:37,420 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 00:26:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:37,421 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:26:37,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:26:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:26:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:26:37,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:37,424 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 00:26:37,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:26:37,424 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 00:26:37,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:37,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958578815] [2020-11-07 00:26:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:37,430 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:37,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:37,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:37,670 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 00:26:37,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958578815] [2020-11-07 00:26:37,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:37,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:26:37,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918571878] [2020-11-07 00:26:37,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:26:37,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:37,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:26:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:26:37,674 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 00:26:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:38,087 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 00:26:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:26:38,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:26:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:38,090 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:26:38,090 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:26:38,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:26:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:26:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 00:26:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:26:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:26:38,108 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 00:26:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:38,108 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:26:38,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:26:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:26:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:26:38,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:38,111 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 00:26:38,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:26:38,111 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 00:26:38,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:38,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816571731] [2020-11-07 00:26:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:38,116 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:26:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 00:26:38,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816571731] [2020-11-07 00:26:38,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:38,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:26:38,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453352580] [2020-11-07 00:26:38,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:26:38,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:26:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:26:38,300 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 00:26:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:38,669 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 00:26:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:26:38,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:26:38,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:38,672 INFO L225 Difference]: With dead ends: 62 [2020-11-07 00:26:38,673 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:26:38,675 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 00:26:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:26:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:26:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:26:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:26:38,704 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 00:26:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:38,704 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:26:38,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:26:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:26:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:26:38,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:38,709 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 00:26:38,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:26:38,710 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 00:26:38,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:38,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886461569] [2020-11-07 00:26:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:38,718 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:26:38,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886461569] [2020-11-07 00:26:38,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:38,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:26:38,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176051834] [2020-11-07 00:26:38,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:26:38,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:26:38,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:26:38,911 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 00:26:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:39,360 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 00:26:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:26:39,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 00:26:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:39,363 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:26:39,363 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:26:39,366 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 00:26:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:26:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:26:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:26:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 00:26:39,397 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 00:26:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:39,398 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 00:26:39,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:26:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 00:26:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:26:39,401 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:39,401 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 00:26:39,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:26:39,401 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:39,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:39,402 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 00:26:39,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:39,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345587144] [2020-11-07 00:26:39,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:39,405 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 00:26:39,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345587144] [2020-11-07 00:26:39,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:39,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:26:39,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112809497] [2020-11-07 00:26:39,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:26:39,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:26:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:26:39,592 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 00:26:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:40,050 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 00:26:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:26:40,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:26:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:40,058 INFO L225 Difference]: With dead ends: 118 [2020-11-07 00:26:40,061 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 00:26:40,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:26:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 00:26:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 00:26:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:26:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 00:26:40,098 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 00:26:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:40,099 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 00:26:40,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:26:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 00:26:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:26:40,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:40,111 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 00:26:40,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:26:40,111 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:40,114 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 00:26:40,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:40,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967466107] [2020-11-07 00:26:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:40,129 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-07 00:26:40,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967466107] [2020-11-07 00:26:40,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:40,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:26:40,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944433830] [2020-11-07 00:26:40,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:26:40,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:26:40,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:26:40,295 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 00:26:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:40,741 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 00:26:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:26:40,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 00:26:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:40,744 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:26:40,744 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:26:40,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:26:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:26:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 00:26:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 00:26:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 00:26:40,774 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 00:26:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:40,774 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 00:26:40,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:26:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 00:26:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:26:40,777 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:40,777 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 00:26:40,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:26:40,778 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:40,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 00:26:40,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:40,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617056323] [2020-11-07 00:26:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:40,781 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:40,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2020-11-07 00:26:41,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617056323] [2020-11-07 00:26:41,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:41,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:26:41,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102680607] [2020-11-07 00:26:41,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:26:41,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:26:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:26:41,177 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 00:26:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:41,788 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 00:26:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:26:41,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 00:26:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:41,793 INFO L225 Difference]: With dead ends: 146 [2020-11-07 00:26:41,793 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 00:26:41,795 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 00:26:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 00:26:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 00:26:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 00:26:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 00:26:41,857 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 00:26:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:41,858 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 00:26:41,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:26:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 00:26:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 00:26:41,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:41,864 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 00:26:41,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:26:41,865 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 00:26:41,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:41,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99360173] [2020-11-07 00:26:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:41,877 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:41,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2020-11-07 00:26:42,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99360173] [2020-11-07 00:26:42,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:42,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:26:42,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21887472] [2020-11-07 00:26:42,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:26:42,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:26:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:26:42,434 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-11-07 00:26:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:43,186 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-11-07 00:26:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:26:43,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-11-07 00:26:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:43,194 INFO L225 Difference]: With dead ends: 240 [2020-11-07 00:26:43,195 INFO L226 Difference]: Without dead ends: 233 [2020-11-07 00:26:43,199 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 00:26:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-07 00:26:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-11-07 00:26:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 00:26:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-11-07 00:26:43,276 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-11-07 00:26:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:43,277 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-11-07 00:26:43,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:26:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-11-07 00:26:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 00:26:43,283 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:43,283 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:26:43,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:26:43,284 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash -509020704, now seen corresponding path program 6 times [2020-11-07 00:26:43,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:43,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271325592] [2020-11-07 00:26:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:43,289 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2020-11-07 00:26:43,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271325592] [2020-11-07 00:26:43,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:43,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:26:43,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674262831] [2020-11-07 00:26:43,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:26:43,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:26:43,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:26:43,918 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 11 states. [2020-11-07 00:26:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:44,847 INFO L93 Difference]: Finished difference Result 422 states and 653 transitions. [2020-11-07 00:26:44,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:26:44,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2020-11-07 00:26:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:44,855 INFO L225 Difference]: With dead ends: 422 [2020-11-07 00:26:44,855 INFO L226 Difference]: Without dead ends: 415 [2020-11-07 00:26:44,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:26:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-11-07 00:26:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2020-11-07 00:26:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-11-07 00:26:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2020-11-07 00:26:44,945 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 237 [2020-11-07 00:26:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:44,946 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2020-11-07 00:26:44,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:26:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2020-11-07 00:26:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-11-07 00:26:44,960 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:44,960 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:26:44,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:26:44,961 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:44,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:44,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1781154385, now seen corresponding path program 7 times [2020-11-07 00:26:44,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:44,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897372505] [2020-11-07 00:26:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:44,969 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:45,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:46,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:46,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:46,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 234 proven. 241 refuted. 0 times theorem prover too weak. 851 trivial. 0 not checked. [2020-11-07 00:26:46,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897372505] [2020-11-07 00:26:46,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:46,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:26:46,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076485508] [2020-11-07 00:26:46,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:26:46,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:46,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:26:46,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:26:46,315 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 18 states. [2020-11-07 00:26:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:49,058 INFO L93 Difference]: Finished difference Result 537 states and 953 transitions. [2020-11-07 00:26:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-11-07 00:26:49,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 431 [2020-11-07 00:26:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:49,062 INFO L225 Difference]: With dead ends: 537 [2020-11-07 00:26:49,062 INFO L226 Difference]: Without dead ends: 159 [2020-11-07 00:26:49,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 00:26:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-07 00:26:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2020-11-07 00:26:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 00:26:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2020-11-07 00:26:49,093 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 431 [2020-11-07 00:26:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:49,093 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2020-11-07 00:26:49,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:26:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2020-11-07 00:26:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2020-11-07 00:26:49,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:49,109 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 00:26:49,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:26:49,110 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:49,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash -240553225, now seen corresponding path program 8 times [2020-11-07 00:26:49,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:49,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682176496] [2020-11-07 00:26:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:49,120 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:49,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 00:26:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:50,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2822 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 2510 trivial. 0 not checked. [2020-11-07 00:26:51,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682176496] [2020-11-07 00:26:51,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:51,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:26:51,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759727591] [2020-11-07 00:26:51,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:26:51,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:26:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:26:51,064 INFO L87 Difference]: Start difference. First operand 134 states and 174 transitions. Second operand 13 states. [2020-11-07 00:26:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:52,220 INFO L93 Difference]: Finished difference Result 486 states and 687 transitions. [2020-11-07 00:26:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:26:52,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 607 [2020-11-07 00:26:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:52,229 INFO L225 Difference]: With dead ends: 486 [2020-11-07 00:26:52,230 INFO L226 Difference]: Without dead ends: 479 [2020-11-07 00:26:52,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:26:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-11-07 00:26:52,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 443. [2020-11-07 00:26:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-11-07 00:26:52,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 629 transitions. [2020-11-07 00:26:52,312 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 629 transitions. Word has length 607 [2020-11-07 00:26:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:52,313 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 629 transitions. [2020-11-07 00:26:52,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:26:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 629 transitions. [2020-11-07 00:26:52,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2020-11-07 00:26:52,334 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:52,335 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 34, 34, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:26:52,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:26:52,335 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1189682992, now seen corresponding path program 9 times [2020-11-07 00:26:52,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:52,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142337994] [2020-11-07 00:26:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:52,346 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:52,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:26:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:52,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:26:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:53,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-11-07 00:26:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-11-07 00:26:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:26:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:26:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:26:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:26:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:26:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:26:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:54,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:26:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:26:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7575 backedges. 0 proven. 535 refuted. 0 times theorem prover too weak. 7040 trivial. 0 not checked. [2020-11-07 00:26:55,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142337994] [2020-11-07 00:26:55,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:26:55,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:26:55,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208314355] [2020-11-07 00:26:55,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:26:55,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:26:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:26:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:26:55,659 INFO L87 Difference]: Start difference. First operand 443 states and 629 transitions. Second operand 14 states. [2020-11-07 00:26:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:26:57,160 INFO L93 Difference]: Finished difference Result 1339 states and 2002 transitions. [2020-11-07 00:26:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:26:57,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 977 [2020-11-07 00:26:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:26:57,187 INFO L225 Difference]: With dead ends: 1339 [2020-11-07 00:26:57,187 INFO L226 Difference]: Without dead ends: 1332 [2020-11-07 00:26:57,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2020-11-07 00:26:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2020-11-07 00:26:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1290. [2020-11-07 00:26:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2020-11-07 00:26:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1935 transitions. [2020-11-07 00:26:57,445 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1935 transitions. Word has length 977 [2020-11-07 00:26:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:26:57,447 INFO L481 AbstractCegarLoop]: Abstraction has 1290 states and 1935 transitions. [2020-11-07 00:26:57,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:26:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1935 transitions. [2020-11-07 00:26:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2020-11-07 00:26:57,472 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:26:57,473 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 55, 55, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:26:57,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:26:57,474 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:26:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:26:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2120852588, now seen corresponding path program 10 times [2020-11-07 00:26:57,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:26:57,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [428252159] [2020-11-07 00:26:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:26:57,512 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:26:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:26:57,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:26:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:26:58,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:26:59,399 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:26:59,399 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:26:59,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:26:59,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:26:59 BoogieIcfgContainer [2020-11-07 00:26:59,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:26:59,523 INFO L168 Benchmark]: Toolchain (without parser) took 24193.15 ms. Allocated memory was 151.0 MB in the beginning and 846.2 MB in the end (delta: 695.2 MB). Free memory was 127.2 MB in the beginning and 546.2 MB in the end (delta: -419.0 MB). Peak memory consumption was 277.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:59,524 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory is still 125.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:26:59,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.70 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 117.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:59,526 INFO L168 Benchmark]: Boogie Preprocessor took 34.37 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 115.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:59,526 INFO L168 Benchmark]: RCFGBuilder took 431.68 ms. Allocated memory is still 151.0 MB. Free memory was 115.7 MB in the beginning and 102.0 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:59,530 INFO L168 Benchmark]: TraceAbstraction took 23484.49 ms. Allocated memory was 151.0 MB in the beginning and 846.2 MB in the end (delta: 695.2 MB). Free memory was 101.6 MB in the beginning and 546.2 MB in the end (delta: -444.6 MB). Peak memory consumption was 252.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:26:59,537 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.26 ms. Allocated memory is still 151.0 MB. Free memory is still 125.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 227.70 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 117.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.37 ms. Allocated memory is still 151.0 MB. Free memory was 117.0 MB in the beginning and 115.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 431.68 ms. Allocated memory is still 151.0 MB. Free memory was 115.7 MB in the beginning and 102.0 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23484.49 ms. Allocated memory was 151.0 MB in the beginning and 846.2 MB in the end (delta: 695.2 MB). Free memory was 101.6 MB in the beginning and 546.2 MB in the end (delta: -444.6 MB). Peak memory consumption was 252.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 10; [L27] CALL, EXPR fibo(x) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND FALSE !(n < 1) [L10] COND FALSE !(n == 1) [L13] CALL, EXPR fibo(n-1) [L8] COND FALSE !(n < 1) [L10] COND TRUE n == 1 [L11] return 1; [L13] RET, EXPR fibo(n-1) [L13] CALL, EXPR fibo(n-2) [L8] COND TRUE n < 1 [L9] return 0; [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.2s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 475 SDtfs, 1236 SDslu, 697 SDs, 0 SdLazy, 2160 SolverSat, 848 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1290occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 incorrect! Received shutdown request...