./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-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 ffdaeeffc8c5fdb555812137dbba1199bd1a626d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:06:26,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:06:26,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:06:26,173 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:06:26,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:06:26,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:06:26,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:06:26,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:06:26,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:06:26,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:06:26,192 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:06:26,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:06:26,193 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:06:26,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:06:26,201 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:06:26,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:06:26,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:06:26,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:06:26,213 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:06:26,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:06:26,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:06:26,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:06:26,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:06:26,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:06:26,227 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:06:26,228 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:06:26,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:06:26,230 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:06:26,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:06:26,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:06:26,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:06:26,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:06:26,237 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:06:26,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:06:26,238 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:06:26,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:06:26,238 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:06:26,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:06:26,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:06:26,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:06:26,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:06:26,257 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:06:26,258 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:06:26,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:06:26,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:06:26,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:06:26,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:06:26,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:06:26,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:06:26,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:06:26,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:06:26,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:06:26,260 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:06:26,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:06:26,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:06:26,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:06:26,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:06:26,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:06:26,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:06:26,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:06:26,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:06:26,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:06:26,263 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:06:26,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:06:26,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:06:26,264 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 -> ffdaeeffc8c5fdb555812137dbba1199bd1a626d [2018-12-31 10:06:26,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:06:26,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:06:26,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:06:26,359 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:06:26,360 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:06:26,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c [2018-12-31 10:06:26,436 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805cc9f4f/fa581b5fddd947c3bd05d87a68204e7c/FLAG9f8fda124 [2018-12-31 10:06:26,874 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:06:26,875 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_true-unreach-call_true-termination.c [2018-12-31 10:06:26,882 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805cc9f4f/fa581b5fddd947c3bd05d87a68204e7c/FLAG9f8fda124 [2018-12-31 10:06:27,257 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805cc9f4f/fa581b5fddd947c3bd05d87a68204e7c [2018-12-31 10:06:27,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:06:27,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:06:27,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:06:27,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:06:27,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:06:27,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5711b596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27, skipping insertion in model container [2018-12-31 10:06:27,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:06:27,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:06:27,580 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:06:27,587 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:06:27,612 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:06:27,632 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:06:27,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27 WrapperNode [2018-12-31 10:06:27,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:06:27,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:06:27,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:06:27,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:06:27,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:06:27,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:06:27,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:06:27,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:06:27,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... [2018-12-31 10:06:27,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:06:27,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:06:27,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:06:27,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:06:27,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:06:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:06:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:06:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-31 10:06:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-31 10:06:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-31 10:06:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-31 10:06:28,337 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:06:28,338 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 10:06:28,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:06:28 BoogieIcfgContainer [2018-12-31 10:06:28,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:06:28,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:06:28,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:06:28,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:06:28,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:06:27" (1/3) ... [2018-12-31 10:06:28,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41293178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:06:28, skipping insertion in model container [2018-12-31 10:06:28,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:06:27" (2/3) ... [2018-12-31 10:06:28,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41293178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:06:28, skipping insertion in model container [2018-12-31 10:06:28,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:06:28" (3/3) ... [2018-12-31 10:06:28,351 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4_true-unreach-call_true-termination.c [2018-12-31 10:06:28,363 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:06:28,373 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:06:28,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:06:28,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:06:28,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:06:28,432 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:06:28,432 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:06:28,433 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:06:28,433 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:06:28,433 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:06:28,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:06:28,434 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:06:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 10:06:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 10:06:28,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:28,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:28,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2018-12-31 10:06:28,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:28,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:28,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:06:28,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:06:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:06:28,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:06:28,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:06:28,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:06:28,736 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-31 10:06:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:28,938 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-12-31 10:06:28,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:06:28,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 10:06:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:28,953 INFO L225 Difference]: With dead ends: 38 [2018-12-31 10:06:28,953 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 10:06:28,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:06:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 10:06:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 10:06:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:06:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 10:06:29,011 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2018-12-31 10:06:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:29,012 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 10:06:29,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:06:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 10:06:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 10:06:29,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:29,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:29,015 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2018-12-31 10:06:29,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:29,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:29,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:06:29,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:06:29,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:06:29,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:06:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:06:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:06:29,095 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2018-12-31 10:06:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:29,421 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-12-31 10:06:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:06:29,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 10:06:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:29,425 INFO L225 Difference]: With dead ends: 32 [2018-12-31 10:06:29,425 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 10:06:29,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:06:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 10:06:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 10:06:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:06:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 10:06:29,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2018-12-31 10:06:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:29,438 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 10:06:29,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:06:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 10:06:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 10:06:29,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:29,441 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:29,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2018-12-31 10:06:29,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:29,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:29,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:29,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:29,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:29,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:29,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:29,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:29,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:29,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:29,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-31 10:06:29,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 10:06:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 10:06:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:06:29,855 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2018-12-31 10:06:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:30,592 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2018-12-31 10:06:30,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:06:30,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-31 10:06:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:30,598 INFO L225 Difference]: With dead ends: 54 [2018-12-31 10:06:30,598 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 10:06:30,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:06:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 10:06:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-31 10:06:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 10:06:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 10:06:30,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2018-12-31 10:06:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:30,622 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 10:06:30,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 10:06:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 10:06:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:06:30,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:30,625 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:30,625 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2018-12-31 10:06:30,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:30,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:30,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:30,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:30,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:30,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:30,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:30,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 10:06:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:30,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 10:06:30,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:06:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:06:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:06:30,914 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-12-31 10:06:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:31,152 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2018-12-31 10:06:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 10:06:31,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 10:06:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:31,155 INFO L225 Difference]: With dead ends: 39 [2018-12-31 10:06:31,155 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 10:06:31,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:06:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 10:06:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-31 10:06:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 10:06:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-31 10:06:31,167 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2018-12-31 10:06:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:31,167 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-31 10:06:31,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:06:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-31 10:06:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 10:06:31,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:31,170 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:31,170 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:31,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:31,170 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2018-12-31 10:06:31,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:31,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 10:06:31,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:31,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:31,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:31,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:06:31,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:31,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-31 10:06:31,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:06:31,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:06:31,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:06:31,505 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2018-12-31 10:06:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:31,918 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2018-12-31 10:06:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:06:31,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-31 10:06:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:31,922 INFO L225 Difference]: With dead ends: 66 [2018-12-31 10:06:31,922 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 10:06:31,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:06:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 10:06:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 10:06:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 10:06:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-12-31 10:06:31,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2018-12-31 10:06:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:31,935 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-12-31 10:06:31,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:06:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2018-12-31 10:06:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 10:06:31,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:31,937 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:31,938 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2018-12-31 10:06:31,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:31,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:31,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:31,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:31,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:06:32,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:32,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:32,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:32,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 10:06:32,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:32,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-31 10:06:32,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:06:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:06:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:06:32,167 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2018-12-31 10:06:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:32,458 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-12-31 10:06:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:06:32,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-31 10:06:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:32,462 INFO L225 Difference]: With dead ends: 57 [2018-12-31 10:06:32,462 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 10:06:32,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:06:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 10:06:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-12-31 10:06:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 10:06:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-12-31 10:06:32,483 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2018-12-31 10:06:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:32,484 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-31 10:06:32,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:06:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2018-12-31 10:06:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 10:06:32,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:32,493 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:32,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2018-12-31 10:06:32,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:32,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:32,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:32,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 10:06:32,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:32,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:32,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:32,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 10:06:32,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:32,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-31 10:06:32,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 10:06:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 10:06:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:06:32,780 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 9 states. [2018-12-31 10:06:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:32,949 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2018-12-31 10:06:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:06:32,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-31 10:06:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:32,953 INFO L225 Difference]: With dead ends: 62 [2018-12-31 10:06:32,953 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 10:06:32,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:06:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 10:06:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-12-31 10:06:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 10:06:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-12-31 10:06:32,967 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 50 [2018-12-31 10:06:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:32,967 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-12-31 10:06:32,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 10:06:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-12-31 10:06:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:06:32,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:32,970 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:32,971 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -26046796, now seen corresponding path program 1 times [2018-12-31 10:06:32,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-31 10:06:33,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:33,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:33,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-31 10:06:34,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:34,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-12-31 10:06:34,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 10:06:34,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 10:06:34,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-12-31 10:06:34,360 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 21 states. [2018-12-31 10:06:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:34,884 INFO L93 Difference]: Finished difference Result 78 states and 136 transitions. [2018-12-31 10:06:34,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 10:06:34,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-12-31 10:06:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:34,890 INFO L225 Difference]: With dead ends: 78 [2018-12-31 10:06:34,890 INFO L226 Difference]: Without dead ends: 74 [2018-12-31 10:06:34,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-12-31 10:06:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-31 10:06:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-12-31 10:06:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-31 10:06:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2018-12-31 10:06:34,910 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 64 [2018-12-31 10:06:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:34,911 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2018-12-31 10:06:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 10:06:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2018-12-31 10:06:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-31 10:06:34,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:34,915 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:34,915 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:34,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 527912280, now seen corresponding path program 1 times [2018-12-31 10:06:34,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:34,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:34,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:34,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 46 proven. 17 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-31 10:06:35,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:35,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:35,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:35,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 44 proven. 18 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-31 10:06:35,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:35,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2018-12-31 10:06:35,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 10:06:35,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 10:06:35,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:06:35,641 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand 12 states. [2018-12-31 10:06:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:35,894 INFO L93 Difference]: Finished difference Result 70 states and 121 transitions. [2018-12-31 10:06:35,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:06:35,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-12-31 10:06:35,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:35,898 INFO L225 Difference]: With dead ends: 70 [2018-12-31 10:06:35,899 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 10:06:35,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:06:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 10:06:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2018-12-31 10:06:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 10:06:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2018-12-31 10:06:35,920 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 79 [2018-12-31 10:06:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:35,921 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 85 transitions. [2018-12-31 10:06:35,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 10:06:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2018-12-31 10:06:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 10:06:35,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:35,924 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:35,924 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash -33377407, now seen corresponding path program 1 times [2018-12-31 10:06:35,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:35,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:35,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-31 10:06:36,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:36,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:36,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:36,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-31 10:06:36,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-31 10:06:36,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 10:06:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 10:06:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:06:36,175 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand 9 states. [2018-12-31 10:06:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:36,551 INFO L93 Difference]: Finished difference Result 78 states and 147 transitions. [2018-12-31 10:06:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:06:36,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-12-31 10:06:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:36,554 INFO L225 Difference]: With dead ends: 78 [2018-12-31 10:06:36,554 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 10:06:36,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:06:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 10:06:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-31 10:06:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-31 10:06:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2018-12-31 10:06:36,565 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 65 [2018-12-31 10:06:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:36,565 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2018-12-31 10:06:36,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 10:06:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2018-12-31 10:06:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 10:06:36,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:36,568 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:36,568 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash -373696391, now seen corresponding path program 2 times [2018-12-31 10:06:36,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:36,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:36,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:06:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-31 10:06:36,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:36,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:06:36,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:06:36,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:36,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 40 proven. 39 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-31 10:06:37,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:37,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-12-31 10:06:37,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 10:06:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 10:06:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:06:37,650 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand 13 states. [2018-12-31 10:06:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:38,132 INFO L93 Difference]: Finished difference Result 127 states and 179 transitions. [2018-12-31 10:06:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 10:06:38,133 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-12-31 10:06:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:38,135 INFO L225 Difference]: With dead ends: 127 [2018-12-31 10:06:38,135 INFO L226 Difference]: Without dead ends: 57 [2018-12-31 10:06:38,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-12-31 10:06:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-31 10:06:38,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-31 10:06:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-31 10:06:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-12-31 10:06:38,144 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 91 [2018-12-31 10:06:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:38,144 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-12-31 10:06:38,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 10:06:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-12-31 10:06:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 10:06:38,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:06:38,146 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:06:38,146 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:06:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:06:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 732405831, now seen corresponding path program 3 times [2018-12-31 10:06:38,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:06:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:06:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:38,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:06:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:06:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:06:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 39 proven. 56 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-12-31 10:06:38,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:06:38,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:06:38,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:06:38,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 10:06:38,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:06:38,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:06:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 115 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-31 10:06:38,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:06:38,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-12-31 10:06:38,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 10:06:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 10:06:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:06:38,698 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 16 states. [2018-12-31 10:06:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:06:39,016 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2018-12-31 10:06:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:06:39,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-12-31 10:06:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:06:39,018 INFO L225 Difference]: With dead ends: 99 [2018-12-31 10:06:39,018 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 10:06:39,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-12-31 10:06:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 10:06:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 10:06:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 10:06:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 10:06:39,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-12-31 10:06:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:06:39,021 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 10:06:39,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 10:06:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 10:06:39,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 10:06:39,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 10:06:39,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:06:39,556 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-31 10:06:40,267 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2018-12-31 10:06:40,481 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2018-12-31 10:06:40,484 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 10:06:40,484 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 10:06:40,485 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 10:06:40,485 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-12-31 10:06:40,485 INFO L444 ceAbstractionStarter]: At program point L41(lines 35 42) the Hoare annotation is: (<= 4 ULTIMATE.start_main_~x~0) [2018-12-31 10:06:40,485 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-31 10:06:40,485 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-31 10:06:40,485 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 4) (<= 4 ULTIMATE.start_main_~x~0)) [2018-12-31 10:06:40,485 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-12-31 10:06:40,486 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2018-12-31 10:06:40,486 INFO L451 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2018-12-31 10:06:40,486 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (<= 2 fibo2_~n) (<= |fibo2_#in~n| fibo2_~n)) [2018-12-31 10:06:40,486 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-12-31 10:06:40,486 INFO L444 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (and (<= fibo2_~n |fibo2_#in~n|) (<= 2 fibo2_~n) (<= |fibo2_#in~n| fibo2_~n) (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1)) (<= 4 |fibo2_#in~n|))) [2018-12-31 10:06:40,486 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-12-31 10:06:40,486 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-12-31 10:06:40,486 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2018-12-31 10:06:40,486 INFO L448 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2018-12-31 10:06:40,487 INFO L448 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2018-12-31 10:06:40,487 INFO L451 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2018-12-31 10:06:40,487 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (<= fibo1_~n |fibo1_#in~n|) (< 1 fibo1_~n) (<= |fibo1_#in~n| fibo1_~n)) [2018-12-31 10:06:40,487 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-12-31 10:06:40,487 INFO L444 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (<= fibo1_~n |fibo1_#in~n|)) (.cse2 (<= |fibo1_#in~n| 3)) (.cse1 (<= |fibo1_#in~n| fibo1_~n))) (or (and .cse0 .cse1 (<= 5 |fibo1_#in~n|)) (and (<= 3 fibo1_~n) .cse0 (or .cse2 (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse1))) (and .cse0 (<= 1 |fibo1_#t~ret0|) .cse2 (<= |fibo1_#t~ret0| 1) .cse1))) (< 1 |fibo1_#in~n|)) [2018-12-31 10:06:40,487 INFO L448 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2018-12-31 10:06:40,487 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2018-12-31 10:06:40,487 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2018-12-31 10:06:40,487 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2018-12-31 10:06:40,488 INFO L448 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2018-12-31 10:06:40,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:06:40 BoogieIcfgContainer [2018-12-31 10:06:40,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:06:40,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:06:40,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:06:40,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:06:40,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:06:28" (3/4) ... [2018-12-31 10:06:40,506 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 10:06:40,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2018-12-31 10:06:40,512 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2018-12-31 10:06:40,517 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 10:06:40,517 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 10:06:40,576 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:06:40,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:06:40,579 INFO L168 Benchmark]: Toolchain (without parser) took 13316.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -250.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-12-31 10:06:40,584 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:06:40,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:06:40,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:06:40,585 INFO L168 Benchmark]: Boogie Preprocessor took 25.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:06:40,586 INFO L168 Benchmark]: RCFGBuilder took 631.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-31 10:06:40,586 INFO L168 Benchmark]: TraceAbstraction took 12160.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.0 MB). Peak memory consumption was 396.3 MB. Max. memory is 11.5 GB. [2018-12-31 10:06:40,590 INFO L168 Benchmark]: Witness Printer took 75.00 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-12-31 10:06:40,601 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.39 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 368.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.47 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 631.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12160.62 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.0 MB). Peak memory consumption was 396.3 MB. Max. memory is 11.5 GB. * Witness Printer took 75.00 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 4 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. SAFE Result, 12.0s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 241 SDslu, 1732 SDs, 0 SdLazy, 1544 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 709 GetRequests, 553 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, 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, 12 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 119 PreInvPairs, 271 NumberOfFragments, 108 HoareAnnotationTreeSize, 119 FomulaSimplifications, 7402 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 444 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1124 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1109 ConstructedInterpolants, 0 QuantifiedInterpolants, 144173 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1238 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1178/1528 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...