./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:51:46,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:51:46,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:51:46,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:51:46,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:51:46,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:51:46,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:51:46,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:51:46,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:51:46,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:51:46,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:51:46,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:51:46,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:51:46,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:51:46,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:51:46,644 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:51:46,644 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:51:46,646 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:51:46,648 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:51:46,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:51:46,651 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:51:46,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:51:46,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:51:46,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:51:46,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:51:46,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:51:46,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:51:46,658 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:51:46,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:51:46,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:51:46,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:51:46,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:51:46,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:51:46,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:51:46,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:51:46,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:51:46,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:51:46,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:51:46,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:51:46,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:51:46,697 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:51:46,698 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:51:46,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:51:46,698 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:51:46,698 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:51:46,698 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:51:46,699 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:51:46,699 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:51:46,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:51:46,699 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:51:46,699 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:51:46,699 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:51:46,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:51:46,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:51:46,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:51:46,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:51:46,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:51:46,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:51:46,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:51:46,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:51:46,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:51:46,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:51:46,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:51:46,706 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:51:46,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:51:46,706 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-12-31 09:51:46,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:51:46,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:51:46,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:51:46,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:51:46,804 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:51:46,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:51:46,873 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed322ad97/eaedf777731942a09bf206cb260f21d3/FLAGef128e4c3 [2018-12-31 09:51:47,321 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:51:47,322 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:51:47,328 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed322ad97/eaedf777731942a09bf206cb260f21d3/FLAGef128e4c3 [2018-12-31 09:51:47,673 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed322ad97/eaedf777731942a09bf206cb260f21d3 [2018-12-31 09:51:47,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:51:47,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:51:47,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:51:47,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:51:47,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:51:47,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:51:47" (1/1) ... [2018-12-31 09:51:47,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d867b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:47, skipping insertion in model container [2018-12-31 09:51:47,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:51:47" (1/1) ... [2018-12-31 09:51:47,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:51:47,719 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:51:47,951 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:51:47,958 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:51:47,981 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:51:48,000 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:51:48,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48 WrapperNode [2018-12-31 09:51:48,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:51:48,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:51:48,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:51:48,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:51:48,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:51:48,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:51:48,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:51:48,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:51:48,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (1/1) ... [2018-12-31 09:51:48,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:51:48,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:51:48,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:51:48,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:51:48,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (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 [2018-12-31 09:51:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-31 09:51:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-31 09:51:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:51:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:51:48,491 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:51:48,492 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:51:48,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:48 BoogieIcfgContainer [2018-12-31 09:51:48,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:51:48,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:51:48,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:51:48,498 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:51:48,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:51:47" (1/3) ... [2018-12-31 09:51:48,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177dd2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:51:48, skipping insertion in model container [2018-12-31 09:51:48,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:51:48" (2/3) ... [2018-12-31 09:51:48,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177dd2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:51:48, skipping insertion in model container [2018-12-31 09:51:48,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:48" (3/3) ... [2018-12-31 09:51:48,502 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-31 09:51:48,521 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:51:48,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:51:48,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:51:48,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:51:48,635 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:51:48,635 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:51:48,635 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:51:48,635 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:51:48,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:51:48,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:51:48,636 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:51:48,636 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:51:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-31 09:51:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:51:48,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:48,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:48,686 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2018-12-31 09:51:48,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:48,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:48,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:48,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:48,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:48,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:48,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:48,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:48,947 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2018-12-31 09:51:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:49,128 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-31 09:51:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:51:49,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:51:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:49,144 INFO L225 Difference]: With dead ends: 30 [2018-12-31 09:51:49,144 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 09:51:49,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 09:51:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 09:51:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:51:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:51:49,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2018-12-31 09:51:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:49,193 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:51:49,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:51:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:51:49,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:49,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:49,196 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2018-12-31 09:51:49,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:49,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:49,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:49,295 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2018-12-31 09:51:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:49,648 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-31 09:51:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:51:49,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:51:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:49,653 INFO L225 Difference]: With dead ends: 23 [2018-12-31 09:51:49,653 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:51:49,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:51:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-31 09:51:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:51:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:51:49,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-12-31 09:51:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:49,663 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:51:49,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:51:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:51:49,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:49,666 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:49,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2018-12-31 09:51:49,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:49,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:49,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:51:49,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:49,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:49,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:49,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 09:51:49,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:49,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 09:51:49,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:51:49,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:51:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:49,981 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2018-12-31 09:51:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:50,295 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-12-31 09:51:50,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:51:50,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 09:51:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:50,301 INFO L225 Difference]: With dead ends: 34 [2018-12-31 09:51:50,301 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:51:50,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:51:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:51:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 09:51:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 09:51:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-31 09:51:50,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2018-12-31 09:51:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:50,311 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-31 09:51:50,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:51:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-31 09:51:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:51:50,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:50,314 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:50,315 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2018-12-31 09:51:50,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:50,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:50,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:51:50,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:50,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:50,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:50,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:51:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:51:50,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:51:50,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:51:50,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:50,540 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2018-12-31 09:51:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:50,943 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2018-12-31 09:51:50,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:51:50,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-31 09:51:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:50,948 INFO L225 Difference]: With dead ends: 28 [2018-12-31 09:51:50,948 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 09:51:50,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 09:51:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-31 09:51:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 09:51:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-31 09:51:50,958 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2018-12-31 09:51:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:50,958 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-31 09:51:50,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:51:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-12-31 09:51:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:50,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:50,960 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:50,961 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2018-12-31 09:51:50,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:50,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-31 09:51:51,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:51,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:51,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:51:51,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:51:51,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:51,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 09:51:51,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:51,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-31 09:51:51,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:51:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:51:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:51:51,199 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 9 states. [2018-12-31 09:51:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:51,484 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2018-12-31 09:51:51,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:51,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-31 09:51:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:51,489 INFO L225 Difference]: With dead ends: 38 [2018-12-31 09:51:51,489 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 09:51:51,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-31 09:51:51,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 09:51:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-12-31 09:51:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 09:51:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-12-31 09:51:51,500 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2018-12-31 09:51:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:51,500 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-12-31 09:51:51,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:51:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2018-12-31 09:51:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 09:51:51,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:51,504 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:51,504 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 300559544, now seen corresponding path program 3 times [2018-12-31 09:51:51,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:51,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:51,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-31 09:51:51,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:51,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:51:51,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-31 09:51:51,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:51,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-31 09:51:51,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:51,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:51:51,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:51:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:51:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:51:51,745 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 7 states. [2018-12-31 09:51:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:51,954 INFO L93 Difference]: Finished difference Result 44 states and 77 transitions. [2018-12-31 09:51:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:51:51,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-12-31 09:51:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:51,958 INFO L225 Difference]: With dead ends: 44 [2018-12-31 09:51:51,958 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 09:51:51,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:51:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 09:51:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2018-12-31 09:51:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 09:51:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 51 transitions. [2018-12-31 09:51:51,972 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 51 transitions. Word has length 64 [2018-12-31 09:51:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:51,972 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 51 transitions. [2018-12-31 09:51:51,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:51:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 51 transitions. [2018-12-31 09:51:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 09:51:51,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:51,975 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 10, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:51,975 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:51,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 88850548, now seen corresponding path program 4 times [2018-12-31 09:51:51,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:51,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 169 proven. 24 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-31 09:51:52,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:52,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:52,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:51:52,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:51:52,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:52,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 93 proven. 157 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-12-31 09:51:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:52,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2018-12-31 09:51:52,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 09:51:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 09:51:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:51:52,618 INFO L87 Difference]: Start difference. First operand 32 states and 51 transitions. Second operand 14 states. [2018-12-31 09:51:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:53,296 INFO L93 Difference]: Finished difference Result 75 states and 139 transitions. [2018-12-31 09:51:53,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 09:51:53,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2018-12-31 09:51:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:53,299 INFO L225 Difference]: With dead ends: 75 [2018-12-31 09:51:53,300 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 09:51:53,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-12-31 09:51:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 09:51:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-31 09:51:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:51:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-12-31 09:51:53,311 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 91 [2018-12-31 09:51:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:53,311 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-12-31 09:51:53,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 09:51:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-12-31 09:51:53,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-31 09:51:53,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:53,314 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:53,314 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:53,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:53,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 5 times [2018-12-31 09:51:53,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:53,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:53,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:53,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:53,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-12-31 09:51:53,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:53,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:51:53,604 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-12-31 09:51:53,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:53,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-12-31 09:51:53,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:53,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-12-31 09:51:53,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:51:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:51:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:51:53,674 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 9 states. [2018-12-31 09:51:54,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:54,076 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2018-12-31 09:51:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:54,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-31 09:51:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:54,080 INFO L225 Difference]: With dead ends: 54 [2018-12-31 09:51:54,080 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 09:51:54,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:51:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 09:51:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-31 09:51:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 09:51:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2018-12-31 09:51:54,097 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 105 [2018-12-31 09:51:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:54,098 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2018-12-31 09:51:54,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:51:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2018-12-31 09:51:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-31 09:51:54,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:54,103 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:54,103 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1461695804, now seen corresponding path program 6 times [2018-12-31 09:51:54,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:54,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:54,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:54,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:54,595 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-31 09:51:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-12-31 09:51:54,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:54,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:54,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 09:51:54,960 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-12-31 09:51:54,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:54,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 236 proven. 396 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2018-12-31 09:51:55,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:55,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2018-12-31 09:51:55,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-31 09:51:55,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-31 09:51:55,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-12-31 09:51:55,127 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand 18 states. [2018-12-31 09:51:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:56,719 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2018-12-31 09:51:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 09:51:56,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2018-12-31 09:51:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:56,725 INFO L225 Difference]: With dead ends: 140 [2018-12-31 09:51:56,726 INFO L226 Difference]: Without dead ends: 79 [2018-12-31 09:51:56,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 09:51:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-31 09:51:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-12-31 09:51:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 09:51:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2018-12-31 09:51:56,745 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 200 [2018-12-31 09:51:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:56,746 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2018-12-31 09:51:56,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-31 09:51:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2018-12-31 09:51:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-31 09:51:56,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:56,750 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:56,750 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1168697890, now seen corresponding path program 7 times [2018-12-31 09:51:56,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 403 proven. 124 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2018-12-31 09:51:56,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:56,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:57,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 117 proven. 639 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-31 09:51:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 10 [2018-12-31 09:51:57,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:51:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:51:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:51:57,228 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand 10 states. [2018-12-31 09:51:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:57,389 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-31 09:51:57,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:51:57,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 200 [2018-12-31 09:51:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:57,394 INFO L225 Difference]: With dead ends: 85 [2018-12-31 09:51:57,395 INFO L226 Difference]: Without dead ends: 81 [2018-12-31 09:51:57,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:51:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-31 09:51:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-12-31 09:51:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-31 09:51:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2018-12-31 09:51:57,408 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 200 [2018-12-31 09:51:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:57,409 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2018-12-31 09:51:57,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:51:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2018-12-31 09:51:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-12-31 09:51:57,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:57,417 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 17, 10, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:57,417 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:57,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 200217336, now seen corresponding path program 8 times [2018-12-31 09:51:57,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:57,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:57,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:57,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 253 proven. 1295 refuted. 0 times theorem prover too weak. 6167 trivial. 0 not checked. [2018-12-31 09:51:57,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:57,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:51:57,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:51:57,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:57,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 219 proven. 1566 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2018-12-31 09:51:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-12-31 09:51:57,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 09:51:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 09:51:57,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:51:57,982 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand 11 states. [2018-12-31 09:51:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:58,201 INFO L93 Difference]: Finished difference Result 87 states and 130 transitions. [2018-12-31 09:51:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:51:58,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 364 [2018-12-31 09:51:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:58,205 INFO L225 Difference]: With dead ends: 87 [2018-12-31 09:51:58,205 INFO L226 Difference]: Without dead ends: 83 [2018-12-31 09:51:58,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-31 09:51:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-31 09:51:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-31 09:51:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-31 09:51:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2018-12-31 09:51:58,219 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 364 [2018-12-31 09:51:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:58,220 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2018-12-31 09:51:58,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 09:51:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2018-12-31 09:51:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-12-31 09:51:58,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:58,238 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 72, 44, 44, 44, 44, 44, 44, 44, 28, 17, 1, 1, 1, 1, 1, 1] [2018-12-31 09:51:58,238 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:58,239 INFO L82 PathProgramCache]: Analyzing trace with hash 259026414, now seen corresponding path program 9 times [2018-12-31 09:51:58,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:58,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:58,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:51:58,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:58,902 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-31 09:51:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22004 backedges. 1970 proven. 2221 refuted. 0 times theorem prover too weak. 17813 trivial. 0 not checked. [2018-12-31 09:51:59,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:59,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:51:59,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:51:59,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-31 09:51:59,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:51:59,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22004 backedges. 3234 proven. 296 refuted. 0 times theorem prover too weak. 18474 trivial. 0 not checked. [2018-12-31 09:51:59,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:59,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2018-12-31 09:51:59,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 09:51:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 09:51:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:51:59,760 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand 19 states. [2018-12-31 09:52:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:00,599 INFO L93 Difference]: Finished difference Result 184 states and 328 transitions. [2018-12-31 09:52:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-31 09:52:00,601 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 609 [2018-12-31 09:52:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:00,605 INFO L225 Difference]: With dead ends: 184 [2018-12-31 09:52:00,605 INFO L226 Difference]: Without dead ends: 105 [2018-12-31 09:52:00,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 09:52:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-31 09:52:00,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-12-31 09:52:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-31 09:52:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 150 transitions. [2018-12-31 09:52:00,624 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 150 transitions. Word has length 609 [2018-12-31 09:52:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:00,628 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 150 transitions. [2018-12-31 09:52:00,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 09:52:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 150 transitions. [2018-12-31 09:52:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-12-31 09:52:00,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:00,635 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 83, 51, 51, 51, 51, 51, 51, 51, 32, 20, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:00,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1903105557, now seen corresponding path program 10 times [2018-12-31 09:52:00,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:00,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:00,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 1305 proven. 4613 refuted. 0 times theorem prover too weak. 23597 trivial. 0 not checked. [2018-12-31 09:52:01,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:01,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:52:01,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:52:01,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:52:01,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:52:01,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 15747 proven. 1793 refuted. 0 times theorem prover too weak. 11975 trivial. 0 not checked. [2018-12-31 09:52:02,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:02,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-12-31 09:52:02,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 09:52:02,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 09:52:02,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-12-31 09:52:02,329 INFO L87 Difference]: Start difference. First operand 99 states and 150 transitions. Second operand 20 states. [2018-12-31 09:52:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:03,488 INFO L93 Difference]: Finished difference Result 208 states and 351 transitions. [2018-12-31 09:52:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-31 09:52:03,489 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 704 [2018-12-31 09:52:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:03,492 INFO L225 Difference]: With dead ends: 208 [2018-12-31 09:52:03,492 INFO L226 Difference]: Without dead ends: 113 [2018-12-31 09:52:03,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 709 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2018-12-31 09:52:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-31 09:52:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-12-31 09:52:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-31 09:52:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2018-12-31 09:52:03,507 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 704 [2018-12-31 09:52:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:03,508 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2018-12-31 09:52:03,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 09:52:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2018-12-31 09:52:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-12-31 09:52:03,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:03,511 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:03,512 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1653353793, now seen corresponding path program 11 times [2018-12-31 09:52:03,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:03,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:03,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:52:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:52:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:52:03,639 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:52:03,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:52:03 BoogieIcfgContainer [2018-12-31 09:52:03,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:52:03,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:52:03,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:52:03,764 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:52:03,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:51:48" (3/4) ... [2018-12-31 09:52:03,767 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:52:03,920 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:52:03,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:52:03,921 INFO L168 Benchmark]: Toolchain (without parser) took 16243.12 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.2 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -245.8 MB). Peak memory consumption was 255.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:03,925 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:03,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:03,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.17 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:03,926 INFO L168 Benchmark]: Boogie Preprocessor took 23.10 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:52:03,926 INFO L168 Benchmark]: RCFGBuilder took 421.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:03,927 INFO L168 Benchmark]: TraceAbstraction took 15269.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 363.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.8 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:03,927 INFO L168 Benchmark]: Witness Printer took 156.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:52:03,931 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.85 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.17 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.10 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15269.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 363.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.8 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. * Witness Printer took 156.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. UNSAFE Result, 15.1s OverallTime, 14 OverallIterations, 103 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 527 SDslu, 729 SDs, 0 SdLazy, 1923 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2666 GetRequests, 2438 SyntacticMatches, 3 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 56 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 5314 NumberOfCodeBlocks, 4791 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 4831 ConstructedInterpolants, 0 QuantifiedInterpolants, 2763995 SizeOfPredicates, 67 NumberOfNonLiveVariables, 4162 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 116294/129928 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...