./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:49:33,138 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:49:33,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:49:33,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:49:33,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:49:33,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:49:33,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:49:33,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:49:33,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:49:33,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:49:33,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:49:33,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:49:33,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:49:33,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:49:33,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:49:33,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:49:33,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:49:33,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:49:33,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:49:33,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:49:33,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:49:33,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:49:33,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:49:33,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:49:33,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:49:33,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:49:33,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:49:33,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:49:33,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:49:33,195 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:49:33,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:49:33,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:49:33,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:49:33,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:49:33,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:49:33,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:49:33,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:49:33,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:49:33,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:49:33,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:49:33,215 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:49:33,216 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:49:33,216 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:49:33,216 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:49:33,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:49:33,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:49:33,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:49:33,217 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:49:33,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:49:33,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:49:33,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:49:33,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:49:33,218 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:49:33,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:49:33,218 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:49:33,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:49:33,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:49:33,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:49:33,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:49:33,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:49:33,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:49:33,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:49:33,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:49:33,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:49:33,220 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:49:33,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:49:33,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:49:33,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-11-28 18:49:33,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:49:33,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:49:33,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:49:33,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:49:33,305 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:49:33,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:33,374 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917388c7d/da7669833c9a4cdab87439fd6edd39c4/FLAG45b0a0255 [2018-11-28 18:49:33,781 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:49:33,782 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:33,788 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917388c7d/da7669833c9a4cdab87439fd6edd39c4/FLAG45b0a0255 [2018-11-28 18:49:34,166 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917388c7d/da7669833c9a4cdab87439fd6edd39c4 [2018-11-28 18:49:34,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:49:34,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:49:34,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:34,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:49:34,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:49:34,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72637f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34, skipping insertion in model container [2018-11-28 18:49:34,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:49:34,206 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:49:34,427 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:34,435 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:49:34,457 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:49:34,478 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:49:34,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34 WrapperNode [2018-11-28 18:49:34,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:49:34,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:34,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:49:34,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:49:34,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:49:34,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:49:34,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:49:34,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:49:34,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (1/1) ... [2018-11-28 18:49:34,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:49:34,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:49:34,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:49:34,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:49:34,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (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-11-28 18:49:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-11-28 18:49:34,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-11-28 18:49:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:49:34,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:49:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:49:34,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:49:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:49:34,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:49:35,050 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:49:35,050 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:49:35,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:35 BoogieIcfgContainer [2018-11-28 18:49:35,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:49:35,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:49:35,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:49:35,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:49:35,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:49:34" (1/3) ... [2018-11-28 18:49:35,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20223088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:35, skipping insertion in model container [2018-11-28 18:49:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:49:34" (2/3) ... [2018-11-28 18:49:35,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20223088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:49:35, skipping insertion in model container [2018-11-28 18:49:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:35" (3/3) ... [2018-11-28 18:49:35,060 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-11-28 18:49:35,072 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:49:35,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:49:35,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:49:35,139 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:49:35,140 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:49:35,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:49:35,141 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:49:35,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:49:35,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:49:35,141 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:49:35,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:49:35,141 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:49:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-28 18:49:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:49:35,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:35,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:35,183 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:35,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-11-28 18:49:35,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:35,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:35,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:35,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:49:35,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:49:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:49:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:49:35,429 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-28 18:49:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:35,583 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-28 18:49:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:49:35,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:49:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:35,595 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:49:35,595 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 18:49:35,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 18:49:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 18:49:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:49:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:49:35,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-28 18:49:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:35,642 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:49:35,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:49:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:49:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:49:35,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:35,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:35,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:35,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:35,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-11-28 18:49:35,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:35,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:49:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:49:35,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:49:35,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:49:35,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:49:35,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:49:35,765 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-28 18:49:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:36,021 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 18:49:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:49:36,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:49:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:36,023 INFO L225 Difference]: With dead ends: 27 [2018-11-28 18:49:36,023 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:49:36,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:49:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 18:49:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:49:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:49:36,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-28 18:49:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:36,033 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:49:36,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:49:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:49:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:49:36,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:36,034 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:36,035 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:36,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-11-28 18:49:36,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:36,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:36,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:36,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:49:36,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:36,244 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-11-28 18:49:36,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:36,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 18:49:36,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:36,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 18:49:36,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:49:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:49:36,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:36,424 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-28 18:49:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:36,749 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-28 18:49:36,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:49:36,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 18:49:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:36,752 INFO L225 Difference]: With dead ends: 38 [2018-11-28 18:49:36,752 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:49:36,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:49:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 18:49:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:49:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 18:49:36,768 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-28 18:49:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:36,769 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 18:49:36,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:49:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 18:49:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:49:36,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:36,773 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:36,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:36,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-11-28 18:49:36,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:36,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:49:36,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:36,960 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-11-28 18:49:36,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:37,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 18:49:37,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:37,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 18:49:37,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:49:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:49:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:49:37,049 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-28 18:49:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:37,539 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-28 18:49:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:49:37,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 18:49:37,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:37,542 INFO L225 Difference]: With dead ends: 32 [2018-11-28 18:49:37,542 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:49:37,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:49:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 18:49:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:49:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-28 18:49:37,552 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-28 18:49:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:37,552 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-28 18:49:37,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:49:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-28 18:49:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:49:37,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:37,555 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:37,555 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-11-28 18:49:37,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:37,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:37,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:37,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:37,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 18:49:37,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:37,668 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-11-28 18:49:37,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:49:37,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:49:37,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:37,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 18:49:37,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:37,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-11-28 18:49:37,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:49:37,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:49:37,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:49:37,829 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-11-28 18:49:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:38,206 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-11-28 18:49:38,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:49:38,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-11-28 18:49:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:38,211 INFO L225 Difference]: With dead ends: 42 [2018-11-28 18:49:38,211 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:49:38,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:49:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:49:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-28 18:49:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:49:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-28 18:49:38,223 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-28 18:49:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:38,224 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-28 18:49:38,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:49:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-28 18:49:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 18:49:38,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:38,228 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:38,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:38,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-11-28 18:49:38,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:38,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:38,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-28 18:49:38,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:38,534 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-11-28 18:49:38,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:49:38,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 18:49:38,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:38,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-28 18:49:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-28 18:49:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:49:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:49:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:38,835 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-28 18:49:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:39,483 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-28 18:49:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:49:39,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-28 18:49:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:39,491 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:49:39,491 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:49:39,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:49:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:49:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-28 18:49:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 18:49:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-28 18:49:39,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-28 18:49:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:39,527 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-28 18:49:39,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:49:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-28 18:49:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 18:49:39,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:39,535 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:39,535 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:39,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2018-11-28 18:49:39,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:39,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:39,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-28 18:49:39,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:39,683 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-11-28 18:49:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:49:39,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:49:39,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:39,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-28 18:49:39,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:39,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-28 18:49:39,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:49:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:49:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:49:39,828 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-11-28 18:49:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:40,063 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-28 18:49:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:49:40,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-28 18:49:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:40,066 INFO L225 Difference]: With dead ends: 52 [2018-11-28 18:49:40,066 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 18:49:40,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:49:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 18:49:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-28 18:49:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 18:49:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-28 18:49:40,078 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-11-28 18:49:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:40,079 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-28 18:49:40,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:49:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-28 18:49:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-28 18:49:40,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:40,085 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:40,085 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:40,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash 995062905, now seen corresponding path program 5 times [2018-11-28 18:49:40,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:40,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:40,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:40,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:40,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 195 proven. 269 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2018-11-28 18:49:40,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:40,285 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-11-28 18:49:40,303 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:49:40,449 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-28 18:49:40,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:40,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 958 proven. 4 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-11-28 18:49:40,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:40,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 18:49:40,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:49:40,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:49:40,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:49:40,558 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2018-11-28 18:49:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:40,781 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2018-11-28 18:49:40,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:49:40,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-11-28 18:49:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:40,786 INFO L225 Difference]: With dead ends: 88 [2018-11-28 18:49:40,787 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 18:49:40,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 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-11-28 18:49:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 18:49:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 18:49:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 18:49:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-11-28 18:49:40,798 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 192 [2018-11-28 18:49:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:40,800 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-11-28 18:49:40,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:49:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-11-28 18:49:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-28 18:49:40,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:40,803 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:40,804 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:40,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1737041458, now seen corresponding path program 6 times [2018-11-28 18:49:40,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:40,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:40,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:40,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:40,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-28 18:49:41,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:41,054 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-11-28 18:49:41,064 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:49:41,150 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-28 18:49:41,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:41,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-28 18:49:41,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:41,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-11-28 18:49:41,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:49:41,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:49:41,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:49:41,238 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 9 states. [2018-11-28 18:49:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:41,406 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-11-28 18:49:41,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:49:41,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-11-28 18:49:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:41,410 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:49:41,410 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 18:49:41,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:49:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 18:49:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-28 18:49:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 18:49:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2018-11-28 18:49:41,428 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 123 [2018-11-28 18:49:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:41,429 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2018-11-28 18:49:41,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:49:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2018-11-28 18:49:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-28 18:49:41,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:41,438 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:41,440 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:41,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1009195755, now seen corresponding path program 7 times [2018-11-28 18:49:41,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:41,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:41,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-11-28 18:49:41,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:41,735 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-11-28 18:49:41,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:41,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-11-28 18:49:41,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:41,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-11-28 18:49:41,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:49:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:49:41,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:49:41,963 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 10 states. [2018-11-28 18:49:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:42,386 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2018-11-28 18:49:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:49:42,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-11-28 18:49:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:42,388 INFO L225 Difference]: With dead ends: 59 [2018-11-28 18:49:42,389 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 18:49:42,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:49:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 18:49:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-28 18:49:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 18:49:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2018-11-28 18:49:42,403 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 218 [2018-11-28 18:49:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:42,404 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 88 transitions. [2018-11-28 18:49:42,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:49:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2018-11-28 18:49:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-11-28 18:49:42,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:42,417 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 63, 39, 39, 39, 39, 39, 39, 39, 24, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:42,418 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:42,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash 47677017, now seen corresponding path program 8 times [2018-11-28 18:49:42,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:42,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:42,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:49:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 17241 backedges. 381 proven. 2015 refuted. 0 times theorem prover too weak. 14845 trivial. 0 not checked. [2018-11-28 18:49:43,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:43,650 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-11-28 18:49:43,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:49:43,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:49:43,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:43,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17241 backedges. 347 proven. 2436 refuted. 0 times theorem prover too weak. 14458 trivial. 0 not checked. [2018-11-28 18:49:44,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:44,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-11-28 18:49:44,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:49:44,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:49:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:49:44,227 INFO L87 Difference]: Start difference. First operand 55 states and 88 transitions. Second operand 11 states. [2018-11-28 18:49:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:44,647 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2018-11-28 18:49:44,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:49:44,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 544 [2018-11-28 18:49:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:44,654 INFO L225 Difference]: With dead ends: 64 [2018-11-28 18:49:44,654 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 18:49:44,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:49:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 18:49:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 18:49:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 18:49:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 105 transitions. [2018-11-28 18:49:44,667 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 105 transitions. Word has length 544 [2018-11-28 18:49:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:44,668 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 105 transitions. [2018-11-28 18:49:44,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:49:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 105 transitions. [2018-11-28 18:49:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2018-11-28 18:49:44,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:44,693 INFO L402 BasicCegarLoop]: trace histogram [111, 111, 89, 55, 55, 55, 55, 55, 55, 55, 34, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:44,693 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:44,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:44,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1049826623, now seen corresponding path program 9 times [2018-11-28 18:49:44,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:44,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:44,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:44,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:44,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 831 proven. 4013 refuted. 0 times theorem prover too weak. 29432 trivial. 0 not checked. [2018-11-28 18:49:45,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:45,303 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-11-28 18:49:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:49:45,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-28 18:49:45,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:45,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34276 backedges. 6909 proven. 189 refuted. 0 times theorem prover too weak. 27178 trivial. 0 not checked. [2018-11-28 18:49:46,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:46,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2018-11-28 18:49:46,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 18:49:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 18:49:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:49:46,143 INFO L87 Difference]: Start difference. First operand 60 states and 105 transitions. Second operand 16 states. [2018-11-28 18:49:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:46,950 INFO L93 Difference]: Finished difference Result 126 states and 258 transitions. [2018-11-28 18:49:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 18:49:46,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 762 [2018-11-28 18:49:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:46,953 INFO L225 Difference]: With dead ends: 126 [2018-11-28 18:49:46,953 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 18:49:46,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2018-11-28 18:49:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 18:49:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 18:49:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 18:49:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2018-11-28 18:49:46,967 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 762 [2018-11-28 18:49:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:46,968 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2018-11-28 18:49:46,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 18:49:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2018-11-28 18:49:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-11-28 18:49:46,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:46,973 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:46,973 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:46,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:46,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1942503438, now seen corresponding path program 10 times [2018-11-28 18:49:46,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:46,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:46,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:46,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:49:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1240 proven. 3038 refuted. 0 times theorem prover too weak. 12129 trivial. 0 not checked. [2018-11-28 18:49:47,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:49:47,430 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-11-28 18:49:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:49:47,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:49:47,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:49:47,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:49:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 8261 proven. 1793 refuted. 0 times theorem prover too weak. 6353 trivial. 0 not checked. [2018-11-28 18:49:47,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:49:47,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-11-28 18:49:47,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 18:49:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 18:49:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-28 18:49:47,900 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 20 states. [2018-11-28 18:49:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:49:49,498 INFO L93 Difference]: Finished difference Result 178 states and 335 transitions. [2018-11-28 18:49:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 18:49:49,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 531 [2018-11-28 18:49:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:49:49,504 INFO L225 Difference]: With dead ends: 178 [2018-11-28 18:49:49,504 INFO L226 Difference]: Without dead ends: 112 [2018-11-28 18:49:49,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 18:49:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-28 18:49:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-11-28 18:49:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 18:49:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2018-11-28 18:49:49,533 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 531 [2018-11-28 18:49:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:49:49,535 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2018-11-28 18:49:49,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 18:49:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2018-11-28 18:49:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-28 18:49:49,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:49:49,540 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:49:49,540 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:49:49,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:49:49,540 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 11 times [2018-11-28 18:49:49,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:49:49,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:49:49,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:49,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:49:49,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:49:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:49:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:49:49,686 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:49:49,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:49:49 BoogieIcfgContainer [2018-11-28 18:49:49,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:49:49,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:49:49,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:49:49,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:49:49,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:49:35" (3/4) ... [2018-11-28 18:49:49,793 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:49:49,965 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:49:49,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:49:49,966 INFO L168 Benchmark]: Toolchain (without parser) took 15795.90 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 573.6 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -266.7 MB). Peak memory consumption was 306.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:49,968 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:49,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.60 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:49,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.53 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:49,969 INFO L168 Benchmark]: Boogie Preprocessor took 29.46 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:49:49,969 INFO L168 Benchmark]: RCFGBuilder took 513.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:49,971 INFO L168 Benchmark]: TraceAbstraction took 14735.18 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 454.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.9 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:49,972 INFO L168 Benchmark]: Witness Printer took 177.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:49:49,975 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.60 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 27.53 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.46 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 513.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14735.18 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 454.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.9 MB). Peak memory consumption was 315.7 MB. Max. memory is 11.5 GB. * Witness Printer took 177.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 14.6s OverallTime, 14 OverallIterations, 111 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 403 SDslu, 880 SDs, 0 SdLazy, 1339 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2846 GetRequests, 2657 SyntacticMatches, 2 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=13, 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, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 5744 NumberOfCodeBlocks, 4933 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 5257 ConstructedInterpolants, 0 QuantifiedInterpolants, 3072011 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4011 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 132231/147816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...