./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_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-simple/fibo_7_false-unreach-call_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 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53:59,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:53:59,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:53:59,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:53:59,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:53:59,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:53:59,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:53:59,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:53:59,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:53:59,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:53:59,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:53:59,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:53:59,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:53:59,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:53:59,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:53:59,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:53:59,038 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:53:59,040 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:53:59,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:53:59,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:53:59,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:53:59,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:53:59,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:53:59,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:53:59,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:53:59,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:53:59,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:53:59,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:53:59,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:53:59,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:53:59,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:53:59,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:53:59,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:53:59,061 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:53:59,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:53:59,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:53:59,067 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:53:59,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:53:59,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:53:59,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:53:59,101 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:53:59,101 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:53:59,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:53:59,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:53:59,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:53:59,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:53:59,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:53:59,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:53:59,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:53:59,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:53:59,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:53:59,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:53:59,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:53:59,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:53:59,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:53:59,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:53:59,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:53:59,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:53:59,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:53:59,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:53:59,110 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:53:59,110 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:53:59,110 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:53:59,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:53:59,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:53:59,111 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 -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-12-31 09:53:59,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:53:59,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:53:59,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:53:59,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:53:59,184 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:53:59,185 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-12-31 09:53:59,238 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0db60ec4/03985b28e16c4c6f8b0fe8d7262e47d6/FLAGca41eab3b [2018-12-31 09:53:59,724 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:53:59,725 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-12-31 09:53:59,733 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0db60ec4/03985b28e16c4c6f8b0fe8d7262e47d6/FLAGca41eab3b [2018-12-31 09:54:00,037 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0db60ec4/03985b28e16c4c6f8b0fe8d7262e47d6 [2018-12-31 09:54:00,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:54:00,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:54:00,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:54:00,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:54:00,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:54:00,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e08ee6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00, skipping insertion in model container [2018-12-31 09:54:00,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:54:00,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:54:00,288 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:54:00,294 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:54:00,313 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:54:00,330 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:54:00,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00 WrapperNode [2018-12-31 09:54:00,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:54:00,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:54:00,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:54:00,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:54:00,344 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:54:00" (1/1) ... [2018-12-31 09:54:00,350 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:54:00" (1/1) ... [2018-12-31 09:54:00,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:54:00,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:54:00,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:54:00,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:54:00,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... [2018-12-31 09:54:00,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:54:00,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:54:00,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:54:00,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:54:00,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:54:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:54:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:54:00,523 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-12-31 09:54:00,523 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-12-31 09:54:00,761 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:54:00,761 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:54:00,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:54:00 BoogieIcfgContainer [2018-12-31 09:54:00,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:54:00,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:54:00,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:54:00,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:54:00,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:54:00" (1/3) ... [2018-12-31 09:54:00,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608be3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:54:00, skipping insertion in model container [2018-12-31 09:54:00,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:54:00" (2/3) ... [2018-12-31 09:54:00,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608be3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:54:00, skipping insertion in model container [2018-12-31 09:54:00,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:54:00" (3/3) ... [2018-12-31 09:54:00,770 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-12-31 09:54:00,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:54:00,788 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:54:00,802 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:54:00,841 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:54:00,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:54:00,842 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:54:00,842 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:54:00,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:54:00,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:54:00,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:54:00,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:54:00,843 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:54:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-31 09:54:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:54:00,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:00,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:00,871 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2018-12-31 09:54:00,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:00,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:00,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:01,198 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:54:01,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:54:01,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:54:01,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:54:01,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:54:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:54:01,234 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-12-31 09:54:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:01,415 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-12-31 09:54:01,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:54:01,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:54:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:01,428 INFO L225 Difference]: With dead ends: 29 [2018-12-31 09:54:01,428 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 09:54:01,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:54:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 09:54:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 09:54:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:54:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:54:01,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2018-12-31 09:54:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:01,481 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:54:01,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:54:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:54:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:54:01,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:01,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:01,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2018-12-31 09:54:01,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:01,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:01,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:01,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:01,544 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:54:01,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:54:01,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:54:01,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:54:01,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:54:01,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:54:01,550 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2018-12-31 09:54:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:01,773 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-31 09:54:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:54:01,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:54:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:01,776 INFO L225 Difference]: With dead ends: 23 [2018-12-31 09:54:01,776 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:54:01,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:54:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:54:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-31 09:54:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 09:54:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 09:54:01,785 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2018-12-31 09:54:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:01,787 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 09:54:01,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:54:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 09:54:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:54:01,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:01,788 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:54:01,789 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2018-12-31 09:54:01,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:01,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:01,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:01,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:02,032 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:54:02,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:02,033 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:54:02,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:02,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:02,210 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:54:02,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:02,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-31 09:54:02,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:54:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:54:02,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:54:02,238 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2018-12-31 09:54:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:02,606 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-12-31 09:54:02,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:54:02,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 09:54:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:02,609 INFO L225 Difference]: With dead ends: 34 [2018-12-31 09:54:02,609 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 09:54:02,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:54:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 09:54:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-31 09:54:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 09:54:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-31 09:54:02,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2018-12-31 09:54:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:02,621 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-31 09:54:02,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:54:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-12-31 09:54:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:54:02,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:02,623 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:54:02,624 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:02,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:02,624 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2018-12-31 09:54:02,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:02,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:02,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:02,760 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:54:02,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:02,761 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:54:02,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:02,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:02,813 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:54:02,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:02,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:54:02,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:54:02,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:54:02,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:54:02,836 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2018-12-31 09:54:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:03,195 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2018-12-31 09:54:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:54:03,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-31 09:54:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:03,202 INFO L225 Difference]: With dead ends: 28 [2018-12-31 09:54:03,203 INFO L226 Difference]: Without dead ends: 24 [2018-12-31 09:54:03,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:54:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-31 09:54:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-31 09:54:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 09:54:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-31 09:54:03,221 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2018-12-31 09:54:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:03,221 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-31 09:54:03,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:54:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-12-31 09:54:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:54:03,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:03,225 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:54:03,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash 645818342, now seen corresponding path program 2 times [2018-12-31 09:54:03,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:03,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:03,400 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:54:03,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:03,400 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:54:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:54:03,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:54:03,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:03,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:03,502 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:54:03,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:03,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-12-31 09:54:03,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:54:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:54:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:54:03,533 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2018-12-31 09:54:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:03,734 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2018-12-31 09:54:03,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:54:03,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-31 09:54:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:03,737 INFO L225 Difference]: With dead ends: 36 [2018-12-31 09:54:03,738 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 09:54:03,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:54:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 09:54:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-12-31 09:54:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 09:54:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-12-31 09:54:03,749 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2018-12-31 09:54:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:03,749 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2018-12-31 09:54:03,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:54:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2018-12-31 09:54:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 09:54:03,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:03,753 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:03,754 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:03,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1193104726, now seen corresponding path program 3 times [2018-12-31 09:54:03,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:03,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:03,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:03,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-12-31 09:54:04,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:04,080 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:54:04,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:54:04,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 09:54:04,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:04,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 130 proven. 12 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-12-31 09:54:04,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:04,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-12-31 09:54:04,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 09:54:04,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 09:54:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:54:04,307 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 11 states. [2018-12-31 09:54:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:04,665 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2018-12-31 09:54:04,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:54:04,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-12-31 09:54:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:04,668 INFO L225 Difference]: With dead ends: 61 [2018-12-31 09:54:04,668 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 09:54:04,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:54:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 09:54:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-31 09:54:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 09:54:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2018-12-31 09:54:04,680 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 77 [2018-12-31 09:54:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:04,680 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2018-12-31 09:54:04,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 09:54:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2018-12-31 09:54:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-31 09:54:04,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:04,683 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:04,683 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2018-12-31 09:54:04,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:04,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-12-31 09:54:04,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:04,896 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:54:04,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:54:04,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:54:04,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:04,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-12-31 09:54:05,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:05,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-12-31 09:54:05,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 09:54:05,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 09:54:05,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:54:05,336 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 19 states. [2018-12-31 09:54:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:06,411 INFO L93 Difference]: Finished difference Result 68 states and 148 transitions. [2018-12-31 09:54:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-31 09:54:06,413 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-12-31 09:54:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:06,420 INFO L225 Difference]: With dead ends: 68 [2018-12-31 09:54:06,421 INFO L226 Difference]: Without dead ends: 64 [2018-12-31 09:54:06,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-12-31 09:54:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-31 09:54:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2018-12-31 09:54:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 09:54:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-12-31 09:54:06,444 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 78 [2018-12-31 09:54:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:06,445 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2018-12-31 09:54:06,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 09:54:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2018-12-31 09:54:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-31 09:54:06,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:06,450 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:06,451 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash -481968661, now seen corresponding path program 5 times [2018-12-31 09:54:06,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:06,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:06,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:06,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 254 proven. 314 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2018-12-31 09:54:06,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:06,897 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:54:06,914 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 09:54:07,054 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-31 09:54:07,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:07,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1139 proven. 17 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2018-12-31 09:54:07,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:07,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-31 09:54:07,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 09:54:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 09:54:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:54:07,374 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 12 states. [2018-12-31 09:54:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:07,885 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2018-12-31 09:54:07,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:54:07,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2018-12-31 09:54:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:07,889 INFO L225 Difference]: With dead ends: 84 [2018-12-31 09:54:07,889 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 09:54:07,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:54:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 09:54:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-12-31 09:54:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-31 09:54:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-12-31 09:54:07,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 188 [2018-12-31 09:54:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:07,903 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2018-12-31 09:54:07,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 09:54:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2018-12-31 09:54:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-31 09:54:07,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:07,907 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 27, 15, 15, 15, 15, 15, 15, 15, 12, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:07,907 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash 938563531, now seen corresponding path program 6 times [2018-12-31 09:54:07,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:07,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:07,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:07,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 217 proven. 331 refuted. 0 times theorem prover too weak. 2083 trivial. 0 not checked. [2018-12-31 09:54:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:08,055 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:54:08,066 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 09:54:08,141 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-12-31 09:54:08,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:08,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 1174 proven. 4 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2018-12-31 09:54:08,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:08,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:54:08,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:54:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:54:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:54:08,270 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand 7 states. [2018-12-31 09:54:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:08,614 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2018-12-31 09:54:08,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:54:08,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2018-12-31 09:54:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:08,617 INFO L225 Difference]: With dead ends: 84 [2018-12-31 09:54:08,617 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:54:08,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:54:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:54:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 09:54:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 09:54:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2018-12-31 09:54:08,632 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 216 [2018-12-31 09:54:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:08,632 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2018-12-31 09:54:08,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:54:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2018-12-31 09:54:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-31 09:54:08,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:08,643 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:08,643 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 7 times [2018-12-31 09:54:08,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:08,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-12-31 09:54:08,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:08,871 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:54:08,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:08,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-12-31 09:54:09,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:09,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-12-31 09:54:09,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:54:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:54:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:54:09,030 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 9 states. [2018-12-31 09:54:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:09,295 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2018-12-31 09:54:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:54:09,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2018-12-31 09:54:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:09,299 INFO L225 Difference]: With dead ends: 50 [2018-12-31 09:54:09,299 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 09:54:09,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:54:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 09:54:09,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-31 09:54:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-31 09:54:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2018-12-31 09:54:09,310 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 132 [2018-12-31 09:54:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:09,311 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2018-12-31 09:54:09,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:54:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2018-12-31 09:54:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-31 09:54:09,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:09,315 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:09,315 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash 938070515, now seen corresponding path program 8 times [2018-12-31 09:54:09,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:09,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:09,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:09,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:54:09,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-12-31 09:54:09,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:09,603 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:54:09,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 09:54:09,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 09:54:09,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:09,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-12-31 09:54:09,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:09,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-12-31 09:54:09,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:54:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:54:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:54:09,856 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand 10 states. [2018-12-31 09:54:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:10,593 INFO L93 Difference]: Finished difference Result 55 states and 88 transitions. [2018-12-31 09:54:10,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:54:10,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2018-12-31 09:54:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:10,597 INFO L225 Difference]: With dead ends: 55 [2018-12-31 09:54:10,597 INFO L226 Difference]: Without dead ends: 51 [2018-12-31 09:54:10,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:54:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-31 09:54:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-31 09:54:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-31 09:54:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2018-12-31 09:54:10,615 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 214 [2018-12-31 09:54:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:10,616 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 84 transitions. [2018-12-31 09:54:10,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:54:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2018-12-31 09:54:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-12-31 09:54:10,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:10,619 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 44, 27, 27, 27, 27, 27, 27, 27, 17, 11, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:10,620 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2072375044, now seen corresponding path program 9 times [2018-12-31 09:54:10,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:10,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:10,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:11,343 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-31 09:54:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8290 backedges. 1158 proven. 546 refuted. 0 times theorem prover too weak. 6586 trivial. 0 not checked. [2018-12-31 09:54:11,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:11,643 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:54:11,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 09:54:11,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-31 09:54:11,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:11,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8290 backedges. 2911 proven. 189 refuted. 0 times theorem prover too weak. 5190 trivial. 0 not checked. [2018-12-31 09:54:12,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:12,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2018-12-31 09:54:12,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-31 09:54:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-31 09:54:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:54:12,164 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. Second operand 19 states. [2018-12-31 09:54:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:13,443 INFO L93 Difference]: Finished difference Result 169 states and 415 transitions. [2018-12-31 09:54:13,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 09:54:13,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 377 [2018-12-31 09:54:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:13,449 INFO L225 Difference]: With dead ends: 169 [2018-12-31 09:54:13,449 INFO L226 Difference]: Without dead ends: 93 [2018-12-31 09:54:13,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=394, Invalid=1412, Unknown=0, NotChecked=0, Total=1806 [2018-12-31 09:54:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-31 09:54:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-12-31 09:54:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-31 09:54:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2018-12-31 09:54:13,468 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 377 [2018-12-31 09:54:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:13,468 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2018-12-31 09:54:13,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-31 09:54:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2018-12-31 09:54:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-12-31 09:54:13,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:13,472 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:13,472 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:13,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1700555500, now seen corresponding path program 10 times [2018-12-31 09:54:13,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:13,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:13,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:54:14,126 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-12-31 09:54:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 649 proven. 779 refuted. 0 times theorem prover too weak. 4611 trivial. 0 not checked. [2018-12-31 09:54:14,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:54:14,255 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:54:14,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 09:54:14,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 09:54:14,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 09:54:14,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:54:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 655 proven. 768 refuted. 0 times theorem prover too weak. 4616 trivial. 0 not checked. [2018-12-31 09:54:14,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:54:14,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-12-31 09:54:14,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 09:54:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 09:54:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:54:14,508 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand 14 states. [2018-12-31 09:54:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:54:14,709 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2018-12-31 09:54:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:54:14,710 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 323 [2018-12-31 09:54:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:54:14,713 INFO L225 Difference]: With dead ends: 110 [2018-12-31 09:54:14,714 INFO L226 Difference]: Without dead ends: 90 [2018-12-31 09:54:14,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-31 09:54:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-31 09:54:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-31 09:54:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-31 09:54:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2018-12-31 09:54:14,728 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 323 [2018-12-31 09:54:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:54:14,729 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2018-12-31 09:54:14,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 09:54:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2018-12-31 09:54:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-31 09:54:14,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:54:14,732 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2018-12-31 09:54:14,732 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:54:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:54:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash 960836894, now seen corresponding path program 11 times [2018-12-31 09:54:14,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:54:14,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:54:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:14,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 09:54:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:54:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:54:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:54:14,825 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:54:14,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:54:14 BoogieIcfgContainer [2018-12-31 09:54:14,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:54:14,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:54:14,942 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:54:14,942 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:54:14,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:54:00" (3/4) ... [2018-12-31 09:54:14,948 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:54:15,074 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:54:15,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:54:15,076 INFO L168 Benchmark]: Toolchain (without parser) took 15031.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -200.7 MB). Peak memory consumption was 169.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:54:15,077 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:54:15,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.29 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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:54:15,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.43 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:54:15,078 INFO L168 Benchmark]: Boogie Preprocessor took 19.25 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:54:15,078 INFO L168 Benchmark]: RCFGBuilder took 372.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:54:15,081 INFO L168 Benchmark]: TraceAbstraction took 14178.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -45.7 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:54:15,082 INFO L168 Benchmark]: Witness Printer took 132.54 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:54:15,085 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.29 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 37.43 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.25 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14178.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -45.7 MB). Peak memory consumption was 189.7 MB. Max. memory is 11.5 GB. * Witness Printer took 132.54 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 13 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. UNSAFE Result, 14.1s OverallTime, 14 OverallIterations, 55 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 212 SDtfs, 364 SDslu, 559 SDs, 0 SdLazy, 1430 SolverSat, 507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1911 GetRequests, 1711 SyntacticMatches, 2 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred 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, 45 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 3673 NumberOfCodeBlocks, 3170 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 3367 ConstructedInterpolants, 0 QuantifiedInterpolants, 1057227 SizeOfPredicates, 53 NumberOfNonLiveVariables, 2613 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 41132/46196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...