/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_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:16,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:16,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:16,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:16,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:16,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:16,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:16,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:16,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:16,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:16,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:16,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:16,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:16,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:16,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:16,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:16,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:16,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:16,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:16,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:16,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:16,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:16,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:16,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:16,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:16,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:16,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:16,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:16,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:16,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:16,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:16,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:16,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:16,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:16,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:16,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:16,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:16,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:16,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:16,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:16,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:16,351 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:41:16,377 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:16,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:16,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:16,384 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:16,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:16,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:16,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:16,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:16,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:16,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:16,386 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:16,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:16,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:16,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:16,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:16,387 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:16,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:16,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:16,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:16,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:16,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:16,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:16,388 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:41:16,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:16,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:16,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:16,879 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:16,880 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:16,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-11-07 00:41:16,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec8b5eac/ec9e85f46eb44129bcf3a8e92039a59b/FLAG6bf860574 [2020-11-07 00:41:17,736 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:17,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-11-07 00:41:17,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec8b5eac/ec9e85f46eb44129bcf3a8e92039a59b/FLAG6bf860574 [2020-11-07 00:41:18,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec8b5eac/ec9e85f46eb44129bcf3a8e92039a59b [2020-11-07 00:41:18,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:18,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:18,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:18,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:18,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:18,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d821c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18, skipping insertion in model container [2020-11-07 00:41:18,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:18,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:18,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:18,351 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:18,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:18,385 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:18,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18 WrapperNode [2020-11-07 00:41:18,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:18,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:18,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:18,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:18,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... [2020-11-07 00:41:18,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:18,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:18,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:18,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:18,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:18,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:18,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:18,505 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:18,505 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 00:41:18,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:18,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:41:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 00:41:18,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:18,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:18,781 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:18,781 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:18,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:18 BoogieIcfgContainer [2020-11-07 00:41:18,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:18,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:18,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:18,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:18,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:18" (1/3) ... [2020-11-07 00:41:18,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446e3ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:18, skipping insertion in model container [2020-11-07 00:41:18,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:18" (2/3) ... [2020-11-07 00:41:18,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446e3ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:18, skipping insertion in model container [2020-11-07 00:41:18,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:18" (3/3) ... [2020-11-07 00:41:18,793 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-11-07 00:41:18,811 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:18,815 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:18,830 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:18,859 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:18,859 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:18,860 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:18,860 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:18,860 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:18,860 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:18,860 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:18,861 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 00:41:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:18,945 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:18,946 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:41:18,947 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 00:41:18,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:18,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265130223] [2020-11-07 00:41:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:19,069 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:19,618 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:41:19,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265130223] [2020-11-07 00:41:19,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:19,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:19,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59989202] [2020-11-07 00:41:19,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:19,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:19,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:19,656 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 00:41:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:20,132 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-11-07 00:41:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:20,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:20,147 INFO L225 Difference]: With dead ends: 60 [2020-11-07 00:41:20,147 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:41:20,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:41:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:41:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:41:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:41:20,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 00:41:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:20,229 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:41:20,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:41:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 00:41:20,232 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:20,232 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:41:20,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:20,233 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 00:41:20,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:20,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201825186] [2020-11-07 00:41:20,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:20,240 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,381 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:41:20,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201825186] [2020-11-07 00:41:20,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:20,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:20,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727974044] [2020-11-07 00:41:20,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:20,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:20,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:20,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:20,387 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 00:41:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:20,751 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 00:41:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:20,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 00:41:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:20,754 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:41:20,755 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:41:20,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:41:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 00:41:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:41:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 00:41:20,774 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 00:41:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:20,774 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 00:41:20,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 00:41:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 00:41:20,780 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:20,780 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:41:20,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:20,781 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 00:41:20,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:20,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390651886] [2020-11-07 00:41:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:20,787 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:20,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 00:41:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,074 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:41:21,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390651886] [2020-11-07 00:41:21,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:21,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:41:21,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374449221] [2020-11-07 00:41:21,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:41:21,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:41:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:41:21,086 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 00:41:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:21,405 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 00:41:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:21,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 00:41:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:21,408 INFO L225 Difference]: With dead ends: 62 [2020-11-07 00:41:21,408 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:41:21,410 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:41:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:41:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:41:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:41:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 00:41:21,423 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 00:41:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:21,424 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 00:41:21,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:41:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 00:41:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 00:41:21,426 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:21,426 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:41:21,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:21,427 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 00:41:21,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:21,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1685748573] [2020-11-07 00:41:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:21,431 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:21,566 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:41:21,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1685748573] [2020-11-07 00:41:21,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:21,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:41:21,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758775429] [2020-11-07 00:41:21,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:41:21,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:41:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:41:21,570 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 00:41:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:21,962 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 00:41:21,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:21,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 00:41:21,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:21,966 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:41:21,966 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:41:21,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:41:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:41:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:41:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:41:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 00:41:21,990 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 00:41:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:21,990 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 00:41:21,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:41:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 00:41:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 00:41:21,994 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:21,994 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:41:21,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:21,994 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 00:41:21,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:21,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [900591552] [2020-11-07 00:41:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:22,000 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,182 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:41:22,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [900591552] [2020-11-07 00:41:22,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:22,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:22,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579766189] [2020-11-07 00:41:22,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:22,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:22,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:22,186 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 00:41:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:22,584 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 00:41:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:22,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 00:41:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:22,588 INFO L225 Difference]: With dead ends: 118 [2020-11-07 00:41:22,588 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 00:41:22,590 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:41:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 00:41:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 00:41:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:41:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 00:41:22,615 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 00:41:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:22,616 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 00:41:22,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 00:41:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 00:41:22,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:22,620 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:41:22,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:22,621 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:22,621 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 00:41:22,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:22,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1224749743] [2020-11-07 00:41:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:22,626 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:22,818 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:41:22,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1224749743] [2020-11-07 00:41:22,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:22,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:22,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31479757] [2020-11-07 00:41:22,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:22,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:22,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:22,822 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 00:41:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:23,319 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 00:41:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:41:23,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 00:41:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:23,323 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:41:23,323 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:41:23,329 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:41:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:41:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 00:41:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 00:41:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 00:41:23,362 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 00:41:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:23,363 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 00:41:23,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 00:41:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 00:41:23,367 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:23,367 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:41:23,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:23,367 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 00:41:23,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:23,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [841506311] [2020-11-07 00:41:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:23,372 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:23,737 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:41:23,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [841506311] [2020-11-07 00:41:23,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:23,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:23,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808865879] [2020-11-07 00:41:23,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:23,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:23,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:23,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:23,741 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 00:41:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:24,398 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 00:41:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:24,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 00:41:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:24,404 INFO L225 Difference]: With dead ends: 146 [2020-11-07 00:41:24,405 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 00:41:24,406 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:41:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 00:41:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 00:41:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 00:41:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 00:41:24,492 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 00:41:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:24,493 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 00:41:24,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 00:41:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 00:41:24,502 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:24,502 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:41:24,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:24,503 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 00:41:24,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:24,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903158779] [2020-11-07 00:41:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:24,509 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:24,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,016 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:41:25,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903158779] [2020-11-07 00:41:25,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:25,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:41:25,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379983831] [2020-11-07 00:41:25,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:41:25,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:41:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:25,020 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-11-07 00:41:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:25,754 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-11-07 00:41:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:41:25,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-11-07 00:41:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:25,761 INFO L225 Difference]: With dead ends: 240 [2020-11-07 00:41:25,761 INFO L226 Difference]: Without dead ends: 233 [2020-11-07 00:41:25,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:41:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-07 00:41:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-11-07 00:41:25,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-11-07 00:41:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-11-07 00:41:25,826 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-11-07 00:41:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:25,827 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-11-07 00:41:25,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:41:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-11-07 00:41:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-11-07 00:41:25,832 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:25,832 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:41:25,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:25,832 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:25,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash -509020704, now seen corresponding path program 6 times [2020-11-07 00:41:25,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:25,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [77679051] [2020-11-07 00:41:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:25,838 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:25,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:26,388 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:41:26,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [77679051] [2020-11-07 00:41:26,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:26,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:41:26,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624881150] [2020-11-07 00:41:26,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:41:26,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:41:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:26,398 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 11 states. [2020-11-07 00:41:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:27,257 INFO L93 Difference]: Finished difference Result 422 states and 653 transitions. [2020-11-07 00:41:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:41:27,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2020-11-07 00:41:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:27,265 INFO L225 Difference]: With dead ends: 422 [2020-11-07 00:41:27,266 INFO L226 Difference]: Without dead ends: 415 [2020-11-07 00:41:27,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:41:27,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-11-07 00:41:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2020-11-07 00:41:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-11-07 00:41:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2020-11-07 00:41:27,359 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 237 [2020-11-07 00:41:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:27,360 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2020-11-07 00:41:27,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:41:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2020-11-07 00:41:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-11-07 00:41:27,373 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:27,374 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:41:27,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:41:27,374 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1781154385, now seen corresponding path program 7 times [2020-11-07 00:41:27,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:27,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584474677] [2020-11-07 00:41:27,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:27,381 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:27,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-11-07 00:41:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 00:41:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 00:41:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-11-07 00:41:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:41:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 00:41:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 00:41:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:28,857 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:41:28,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584474677] [2020-11-07 00:41:28,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:28,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:41:28,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561570853] [2020-11-07 00:41:28,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:41:28,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:28,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:41:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:41:28,861 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 18 states. [2020-11-07 00:41:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:31,227 INFO L93 Difference]: Finished difference Result 533 states and 935 transitions. [2020-11-07 00:41:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-07 00:41:31,229 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 431 [2020-11-07 00:41:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:31,238 INFO L225 Difference]: With dead ends: 533 [2020-11-07 00:41:31,239 INFO L226 Difference]: Without dead ends: 155 [2020-11-07 00:41:31,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2020-11-07 00:41:31,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-07 00:41:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2020-11-07 00:41:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:41:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 159 transitions. [2020-11-07 00:41:31,274 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 159 transitions. Word has length 431 [2020-11-07 00:41:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:31,275 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 159 transitions. [2020-11-07 00:41:31,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:41:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2020-11-07 00:41:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2020-11-07 00:41:31,282 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:31,283 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:31,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:41:31,283 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:31,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1553933834, now seen corresponding path program 8 times [2020-11-07 00:41:31,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:31,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [900339284] [2020-11-07 00:41:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:31,290 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:41:31,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:41:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:41:31,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:41:31,604 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:41:31,604 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:41:31,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:41:31,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:31 BoogieIcfgContainer [2020-11-07 00:41:31,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:31,677 INFO L168 Benchmark]: Toolchain (without parser) took 13564.74 ms. Allocated memory was 151.0 MB in the beginning and 422.6 MB in the end (delta: 271.6 MB). Free memory was 127.5 MB in the beginning and 243.4 MB in the end (delta: -115.9 MB). Peak memory consumption was 156.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:31,678 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 151.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:31,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.74 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 118.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:31,684 INFO L168 Benchmark]: Boogie Preprocessor took 36.06 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:31,684 INFO L168 Benchmark]: RCFGBuilder took 358.67 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 102.9 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:41:31,688 INFO L168 Benchmark]: TraceAbstraction took 12887.60 ms. Allocated memory was 151.0 MB in the beginning and 422.6 MB in the end (delta: 271.6 MB). Free memory was 102.5 MB in the beginning and 243.4 MB in the end (delta: -140.9 MB). Peak memory consumption was 131.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:31,699 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 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 262.74 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 118.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.06 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 358.67 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 102.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12887.60 ms. Allocated memory was 151.0 MB in the beginning and 422.6 MB in the end (delta: 271.6 MB). Free memory was 102.5 MB in the beginning and 243.4 MB in the end (delta: -140.9 MB). Peak memory consumption was 131.4 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 = 7; [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 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); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_7-2.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: 12.7s, OverallIterations: 11, TraceHistogramMax: 47, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 398 SDtfs, 880 SDslu, 572 SDs, 0 SdLazy, 1604 SolverSat, 583 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 105 StatesRemovedByMinimization, 7 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...