./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-simple/fibo_7_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:50:59,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:50:59,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:50:59,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:50:59,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:50:59,452 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:50:59,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:50:59,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:50:59,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:50:59,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:50:59,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:50:59,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:50:59,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:50:59,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:50:59,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:50:59,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:50:59,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:50:59,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:50:59,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:50:59,476 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:50:59,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:50:59,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:50:59,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:50:59,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:50:59,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:50:59,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:50:59,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:50:59,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:50:59,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:50:59,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:50:59,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:50:59,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:50:59,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:50:59,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:50:59,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:50:59,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:50:59,492 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:50:59,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:50:59,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:50:59,511 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:50:59,511 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:50:59,512 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:50:59,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:50:59,512 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:50:59,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:50:59,513 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:50:59,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:50:59,514 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:50:59,514 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:50:59,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:50:59,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:50:59,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:50:59,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:50:59,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:50:59,515 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:50:59,515 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:50:59,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:50:59,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:50:59,516 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:50:59,517 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:50:59,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:50:59,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:50:59,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:50:59,518 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:50:59,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:50:59,518 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:50:59,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:50:59,520 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2018-11-28 18:50:59,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:50:59,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:50:59,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:50:59,615 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:50:59,615 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:50:59,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-28 18:50:59,685 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44911417f/255845a897ca4c0996442811779eadbe/FLAG10f217c63 [2018-11-28 18:51:00,128 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:51:00,134 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_7_false-unreach-call_true-termination.c [2018-11-28 18:51:00,142 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44911417f/255845a897ca4c0996442811779eadbe/FLAG10f217c63 [2018-11-28 18:51:00,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44911417f/255845a897ca4c0996442811779eadbe [2018-11-28 18:51:00,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:51:00,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:51:00,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:51:00,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:51:00,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:51:00,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a57947c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00, skipping insertion in model container [2018-11-28 18:51:00,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:51:00,535 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:51:00,786 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:51:00,792 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:51:00,813 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:51:00,832 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:51:00,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00 WrapperNode [2018-11-28 18:51:00,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:51:00,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:51:00,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:51:00,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:51:00,846 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:51:00" (1/1) ... [2018-11-28 18:51:00,854 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:51:00" (1/1) ... [2018-11-28 18:51:00,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:51:00,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:51:00,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:51:00,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:51:00,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... [2018-11-28 18:51:00,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:51:00,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:51:00,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:51:00,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:51:00,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:51:01,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:51:01,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:51:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:51:01,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:51:01,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:51:01,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:51:01,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-28 18:51:01,033 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-28 18:51:01,253 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:51:01,254 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:51:01,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:01 BoogieIcfgContainer [2018-11-28 18:51:01,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:51:01,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:51:01,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:51:01,260 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:51:01,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:51:00" (1/3) ... [2018-11-28 18:51:01,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8fa9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:51:01, skipping insertion in model container [2018-11-28 18:51:01,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:00" (2/3) ... [2018-11-28 18:51:01,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8fa9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:51:01, skipping insertion in model container [2018-11-28 18:51:01,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:01" (3/3) ... [2018-11-28 18:51:01,266 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7_false-unreach-call_true-termination.c [2018-11-28 18:51:01,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:51:01,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:51:01,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:51:01,335 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:51:01,336 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:51:01,336 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:51:01,336 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:51:01,336 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:51:01,337 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:51:01,337 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:51:01,337 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:51:01,337 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:51:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-28 18:51:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:51:01,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:01,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:01,370 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:01,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-11-28 18:51:01,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:01,715 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:51:01,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:51:01,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:51:01,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:51:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:51:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:51:01,745 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-28 18:51:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:01,926 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-28 18:51:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:51:01,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:51:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:01,941 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:51:01,942 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 18:51:01,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 18:51:01,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 18:51:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:51:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:51:01,991 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-28 18:51:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:01,992 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:51:01,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:51:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:51:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:51:01,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:01,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:01,995 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:01,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-11-28 18:51:01,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:01,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:01,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,064 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:51:02,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:51:02,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:51:02,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:51:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:51:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:51:02,068 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-28 18:51:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:02,324 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-28 18:51:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:51:02,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:51:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:02,326 INFO L225 Difference]: With dead ends: 27 [2018-11-28 18:51:02,327 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:51:02,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:51:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 18:51:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:51:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-28 18:51:02,336 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-28 18:51:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:02,336 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-28 18:51:02,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:51:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-28 18:51:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:51:02,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:02,338 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:51:02,338 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:02,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-11-28 18:51:02,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:02,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,566 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:51:02,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:02,566 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:51:02,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:02,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:02,738 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:51:02,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:02,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 18:51:02,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:51:02,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:51:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:51:02,766 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-28 18:51:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:03,102 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-28 18:51:03,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:51:03,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-28 18:51:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:03,104 INFO L225 Difference]: With dead ends: 38 [2018-11-28 18:51:03,104 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 18:51:03,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:51:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 18:51:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-28 18:51:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:51:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-28 18:51:03,115 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-28 18:51:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:03,116 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-28 18:51:03,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:51:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-28 18:51:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 18:51:03,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:03,119 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:51:03,119 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:03,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:03,119 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-11-28 18:51:03,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,225 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:51:03,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:03,225 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:51:03,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:03,302 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:51:03,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:03,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 18:51:03,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:51:03,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:51:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:03,332 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-28 18:51:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:03,619 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-28 18:51:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:51:03,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-28 18:51:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:03,622 INFO L225 Difference]: With dead ends: 32 [2018-11-28 18:51:03,622 INFO L226 Difference]: Without dead ends: 28 [2018-11-28 18:51:03,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:51:03,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-28 18:51:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 18:51:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 18:51:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-28 18:51:03,644 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-28 18:51:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:03,645 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-28 18:51:03,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:51:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-28 18:51:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 18:51:03,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:03,648 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:51:03,648 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:03,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-11-28 18:51:03,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:03,852 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:51:03,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:03,853 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:51:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:03,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:03,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:03,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:03,987 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:51:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:04,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-28 18:51:04,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:51:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:51:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:51:04,019 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-11-28 18:51:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:04,275 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-11-28 18:51:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:51:04,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-28 18:51:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:04,279 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:51:04,279 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:51:04,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:51:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:51:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-28 18:51:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:51:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-28 18:51:04,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-28 18:51:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:04,292 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-28 18:51:04,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:51:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-28 18:51:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 18:51:04,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:04,296 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:51:04,297 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:04,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-11-28 18:51:04,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:04,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:04,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:04,659 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:51:04,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:04,660 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:51:04,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:51:04,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 18:51:04,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:04,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:04,793 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:51:04,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:04,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-28 18:51:04,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:51:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:51:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:51:04,815 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-28 18:51:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:05,451 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-28 18:51:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:51:05,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-28 18:51:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:05,456 INFO L225 Difference]: With dead ends: 76 [2018-11-28 18:51:05,457 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:51:05,458 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:51:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:51:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-28 18:51:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 18:51:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-28 18:51:05,474 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-28 18:51:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:05,475 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-28 18:51:05,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:51:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-28 18:51:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 18:51:05,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:05,479 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:05,479 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:05,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2018-11-28 18:51:05,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:05,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-28 18:51:05,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:05,862 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:51:05,873 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:51:05,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:51:05,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:05,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-28 18:51:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-11-28 18:51:06,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 18:51:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 18:51:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:51:06,112 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 19 states. [2018-11-28 18:51:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:07,419 INFO L93 Difference]: Finished difference Result 75 states and 150 transitions. [2018-11-28 18:51:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-28 18:51:07,421 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-11-28 18:51:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:07,425 INFO L225 Difference]: With dead ends: 75 [2018-11-28 18:51:07,426 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 18:51:07,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 18:51:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 18:51:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2018-11-28 18:51:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 18:51:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-28 18:51:07,446 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 82 [2018-11-28 18:51:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:07,447 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-28 18:51:07,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 18:51:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-28 18:51:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-28 18:51:07,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:07,451 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 19, 11, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:07,452 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:07,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1548772748, now seen corresponding path program 5 times [2018-11-28 18:51:07,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:07,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 93 proven. 312 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2018-11-28 18:51:07,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:07,640 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:51:07,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:51:07,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-28 18:51:07,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:07,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 822 proven. 67 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-28 18:51:07,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:07,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-28 18:51:07,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:51:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:51:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:51:07,885 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 12 states. [2018-11-28 18:51:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:08,467 INFO L93 Difference]: Finished difference Result 125 states and 254 transitions. [2018-11-28 18:51:08,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 18:51:08,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2018-11-28 18:51:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:08,473 INFO L225 Difference]: With dead ends: 125 [2018-11-28 18:51:08,473 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 18:51:08,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:51:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 18:51:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-11-28 18:51:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 18:51:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-11-28 18:51:08,511 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 164 [2018-11-28 18:51:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:08,512 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-28 18:51:08,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:51:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-11-28 18:51:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 18:51:08,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:08,527 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:08,528 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:08,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash 713359980, now seen corresponding path program 6 times [2018-11-28 18:51:08,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:08,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:08,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:08,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:08,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 162 proven. 102 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2018-11-28 18:51:09,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:09,067 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:51:09,088 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:51:09,213 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-28 18:51:09,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:09,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 495 proven. 39 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-11-28 18:51:09,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:09,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-11-28 18:51:09,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:51:09,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:51:09,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:51:09,443 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 11 states. [2018-11-28 18:51:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:09,765 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2018-11-28 18:51:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:51:09,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2018-11-28 18:51:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:09,770 INFO L225 Difference]: With dead ends: 121 [2018-11-28 18:51:09,771 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:51:09,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:51:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:51:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-11-28 18:51:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 18:51:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-11-28 18:51:09,786 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 136 [2018-11-28 18:51:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:09,787 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-28 18:51:09,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:51:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-28 18:51:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-28 18:51:09,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:09,792 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:51:09,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:09,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 7 times [2018-11-28 18:51:09,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:09,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:10,128 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:51:10,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:10,129 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:51:10,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:10,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:10,305 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:51:10,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:10,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-11-28 18:51:10,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:10,342 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 10 states. [2018-11-28 18:51:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:10,782 INFO L93 Difference]: Finished difference Result 79 states and 118 transitions. [2018-11-28 18:51:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:10,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-11-28 18:51:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:10,787 INFO L225 Difference]: With dead ends: 79 [2018-11-28 18:51:10,788 INFO L226 Difference]: Without dead ends: 75 [2018-11-28 18:51:10,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-28 18:51:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-28 18:51:10,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-28 18:51:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 18:51:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2018-11-28 18:51:10,802 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 218 [2018-11-28 18:51:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:10,803 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2018-11-28 18:51:10,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2018-11-28 18:51:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-28 18:51:10,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:10,810 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:10,810 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:10,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 223191898, now seen corresponding path program 8 times [2018-11-28 18:51:10,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:10,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:10,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1015 proven. 551 refuted. 0 times theorem prover too weak. 5554 trivial. 0 not checked. [2018-11-28 18:51:11,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:11,167 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:51:11,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:11,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:11,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:11,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1021 proven. 540 refuted. 0 times theorem prover too weak. 5559 trivial. 0 not checked. [2018-11-28 18:51:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-11-28 18:51:11,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:51:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:51:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:51:11,630 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand 14 states. [2018-11-28 18:51:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:12,024 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2018-11-28 18:51:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:51:12,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 354 [2018-11-28 18:51:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:12,030 INFO L225 Difference]: With dead ends: 100 [2018-11-28 18:51:12,030 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 18:51:12,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-11-28 18:51:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 18:51:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-28 18:51:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 18:51:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2018-11-28 18:51:12,045 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 354 [2018-11-28 18:51:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:12,046 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2018-11-28 18:51:12,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:51:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2018-11-28 18:51:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-28 18:51:12,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:12,049 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:12,049 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:12,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 9 times [2018-11-28 18:51:12,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:12,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:12,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:12,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:12,162 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:51:12,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:51:12 BoogieIcfgContainer [2018-11-28 18:51:12,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:51:12,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:51:12,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:51:12,258 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:51:12,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:01" (3/4) ... [2018-11-28 18:51:12,264 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:51:12,400 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:51:12,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:51:12,405 INFO L168 Benchmark]: Toolchain (without parser) took 11922.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -274.1 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:12,407 INFO L168 Benchmark]: CDTParser took 0.22 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:51:12,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.42 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 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:51:12,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.42 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:12,407 INFO L168 Benchmark]: Boogie Preprocessor took 29.07 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:12,408 INFO L168 Benchmark]: RCFGBuilder took 361.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:12,408 INFO L168 Benchmark]: TraceAbstraction took 11001.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -140.8 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:12,408 INFO L168 Benchmark]: Witness Printer took 145.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:12,413 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.22 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 347.42 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 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 30.42 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.07 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 361.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11001.14 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -140.8 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Witness Printer took 145.88 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 10.9s OverallTime, 12 OverallIterations, 51 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 206 SDtfs, 256 SDslu, 752 SDs, 0 SdLazy, 1178 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1324 GetRequests, 1163 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, 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, 11 MinimizatonAttempts, 57 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2599 NumberOfCodeBlocks, 2413 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2293 ConstructedInterpolants, 0 QuantifiedInterpolants, 638591 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 22477/25662 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...