./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:56:32,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:56:32,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:56:32,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:56:32,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:56:32,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:56:32,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:56:32,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:56:32,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:56:32,117 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:56:32,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:56:32,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:56:32,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:56:32,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:56:32,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:56:32,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:56:32,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:56:32,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:56:32,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:56:32,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:56:32,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:56:32,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:56:32,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:56:32,135 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:56:32,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:56:32,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:56:32,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:56:32,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:56:32,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:56:32,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:56:32,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:56:32,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:56:32,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:56:32,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:56:32,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:56:32,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:56:32,145 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:56:32,166 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:56:32,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:56:32,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:56:32,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:56:32,168 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:56:32,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:56:32,168 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:56:32,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:56:32,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:56:32,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:56:32,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:56:32,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:56:32,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:56:32,170 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:56:32,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:56:32,170 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:56:32,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:56:32,173 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:56:32,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:56:32,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:56:32,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:56:32,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:56:32,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:56:32,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:56:32,175 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:56:32,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:56:32,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:56:32,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:56:32,181 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 -> 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 [2019-01-12 14:56:32,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:56:32,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:56:32,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:56:32,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:56:32,266 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:56:32,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:32,330 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41de83f3/47c96aa2ef674544bc77f531cf6355bf/FLAGe1bb6dc0b [2019-01-12 14:56:32,754 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:56:32,755 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:32,761 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41de83f3/47c96aa2ef674544bc77f531cf6355bf/FLAGe1bb6dc0b [2019-01-12 14:56:33,119 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b41de83f3/47c96aa2ef674544bc77f531cf6355bf [2019-01-12 14:56:33,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:56:33,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:56:33,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:33,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:56:33,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:56:33,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e21fa69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33, skipping insertion in model container [2019-01-12 14:56:33,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:56:33,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:56:33,368 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:33,373 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:56:33,393 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:33,410 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:56:33,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33 WrapperNode [2019-01-12 14:56:33,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:33,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:33,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:56:33,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:56:33,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:33,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:56:33,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:56:33,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:56:33,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (1/1) ... [2019-01-12 14:56:33,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:56:33,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:56:33,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:56:33,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:56:33,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (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 [2019-01-12 14:56:33,604 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-01-12 14:56:33,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-01-12 14:56:33,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:56:33,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:56:33,810 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:56:33,811 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:56:33,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:33 BoogieIcfgContainer [2019-01-12 14:56:33,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:56:33,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:56:33,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:56:33,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:56:33,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:56:33" (1/3) ... [2019-01-12 14:56:33,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f3cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:33, skipping insertion in model container [2019-01-12 14:56:33,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:33" (2/3) ... [2019-01-12 14:56:33,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f3cf75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:33, skipping insertion in model container [2019-01-12 14:56:33,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:33" (3/3) ... [2019-01-12 14:56:33,821 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:33,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:56:33,840 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:56:33,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:56:33,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:56:33,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:56:33,886 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:56:33,887 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:56:33,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:56:33,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:56:33,887 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:56:33,887 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:56:33,887 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:56:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-12 14:56:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:56:33,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:33,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:33,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:33,923 INFO L82 PathProgramCache]: Analyzing trace with hash -337677157, now seen corresponding path program 1 times [2019-01-12 14:56:33,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:33,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:33,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:33,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:56:34,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:34,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:34,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:34,234 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-12 14:56:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:34,400 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-01-12 14:56:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:34,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:56:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:34,412 INFO L225 Difference]: With dead ends: 31 [2019-01-12 14:56:34,413 INFO L226 Difference]: Without dead ends: 18 [2019-01-12 14:56:34,416 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 [2019-01-12 14:56:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-12 14:56:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-12 14:56:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 14:56:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-12 14:56:34,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2019-01-12 14:56:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:34,459 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-12 14:56:34,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-12 14:56:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 14:56:34,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:34,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:34,462 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1185838437, now seen corresponding path program 1 times [2019-01-12 14:56:34,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:34,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:34,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:56:34,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:34,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:34,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:34,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:34,582 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2019-01-12 14:56:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:34,881 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-01-12 14:56:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:34,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-12 14:56:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:34,885 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:56:34,885 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 14:56:34,887 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 [2019-01-12 14:56:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 14:56:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-12 14:56:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 14:56:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-01-12 14:56:34,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2019-01-12 14:56:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:34,899 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-01-12 14:56:34,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-01-12 14:56:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:56:34,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:34,903 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:34,903 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:34,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash -461887010, now seen corresponding path program 1 times [2019-01-12 14:56:34,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:34,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:34,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:34,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:56:35,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:35,102 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 [2019-01-12 14:56:35,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:35,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 14:56:35,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-01-12 14:56:35,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:35,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:35,213 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2019-01-12 14:56:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:35,470 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2019-01-12 14:56:35,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:56:35,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-12 14:56:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:35,473 INFO L225 Difference]: With dead ends: 44 [2019-01-12 14:56:35,473 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 14:56:35,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:56:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 14:56:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-12 14:56:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 14:56:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-01-12 14:56:35,483 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 23 [2019-01-12 14:56:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:35,484 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-01-12 14:56:35,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-01-12 14:56:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:56:35,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:35,486 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:35,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1032875874, now seen corresponding path program 1 times [2019-01-12 14:56:35,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:35,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:35,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:56:35,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:35,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-12 14:56:35,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:35,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:56:35,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-01-12 14:56:35,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:35,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:35,727 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 8 states. [2019-01-12 14:56:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:36,149 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2019-01-12 14:56:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:56:36,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-12 14:56:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:36,152 INFO L225 Difference]: With dead ends: 48 [2019-01-12 14:56:36,153 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 14:56:36,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:56:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 14:56:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-12 14:56:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:56:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2019-01-12 14:56:36,168 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 24 [2019-01-12 14:56:36,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:36,168 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2019-01-12 14:56:36,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2019-01-12 14:56:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:56:36,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:36,171 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:36,172 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:36,172 INFO L82 PathProgramCache]: Analyzing trace with hash 502327423, now seen corresponding path program 2 times [2019-01-12 14:56:36,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:36,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:36,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:36,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-12 14:56:36,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:36,324 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 [2019-01-12 14:56:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:36,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:36,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:36,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 14:56:36,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:36,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 14:56:36,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:56:36,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:56:36,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:56:36,559 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand 9 states. [2019-01-12 14:56:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:36,850 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2019-01-12 14:56:36,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:56:36,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-01-12 14:56:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:36,853 INFO L225 Difference]: With dead ends: 82 [2019-01-12 14:56:36,854 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 14:56:36,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:56:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 14:56:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-01-12 14:56:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 14:56:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-01-12 14:56:36,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 36 [2019-01-12 14:56:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:36,866 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-01-12 14:56:36,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:56:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-01-12 14:56:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 14:56:36,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:36,868 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:36,869 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:36,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2107265955, now seen corresponding path program 2 times [2019-01-12 14:56:36,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:36,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:36,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:36,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:36,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 14:56:36,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:36,962 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 [2019-01-12 14:56:36,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:37,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:37,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:37,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 14:56:37,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:37,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-12 14:56:37,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:37,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:37,085 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 8 states. [2019-01-12 14:56:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:37,369 INFO L93 Difference]: Finished difference Result 60 states and 90 transitions. [2019-01-12 14:56:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:37,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-12 14:56:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:37,377 INFO L225 Difference]: With dead ends: 60 [2019-01-12 14:56:37,377 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 14:56:37,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:56:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 14:56:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-12 14:56:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 14:56:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2019-01-12 14:56:37,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 38 [2019-01-12 14:56:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:37,397 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2019-01-12 14:56:37,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2019-01-12 14:56:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-12 14:56:37,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:37,403 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:37,403 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash -150955077, now seen corresponding path program 3 times [2019-01-12 14:56:37,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:37,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:37,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 95 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-01-12 14:56:37,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:37,748 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 [2019-01-12 14:56:37,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:37,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 14:56:37,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:37,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-12 14:56:37,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:37,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-12 14:56:37,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 14:56:37,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 14:56:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:56:37,892 INFO L87 Difference]: Start difference. First operand 50 states and 77 transitions. Second operand 11 states. [2019-01-12 14:56:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:38,117 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-01-12 14:56:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:38,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2019-01-12 14:56:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:38,120 INFO L225 Difference]: With dead ends: 112 [2019-01-12 14:56:38,120 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 14:56:38,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:56:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 14:56:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-01-12 14:56:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:56:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2019-01-12 14:56:38,134 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 90 [2019-01-12 14:56:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:38,135 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2019-01-12 14:56:38,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 14:56:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2019-01-12 14:56:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-12 14:56:38,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:38,139 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:38,139 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:38,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash 186783566, now seen corresponding path program 4 times [2019-01-12 14:56:38,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:38,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 135 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-01-12 14:56:38,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:38,368 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 [2019-01-12 14:56:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:38,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:38,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:38,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 74 proven. 118 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-12 14:56:38,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:38,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2019-01-12 14:56:38,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:56:38,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:56:38,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:56:38,563 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand 15 states. [2019-01-12 14:56:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:39,217 INFO L93 Difference]: Finished difference Result 103 states and 159 transitions. [2019-01-12 14:56:39,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:56:39,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2019-01-12 14:56:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:39,220 INFO L225 Difference]: With dead ends: 103 [2019-01-12 14:56:39,221 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 14:56:39,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:56:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 14:56:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-12 14:56:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 14:56:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-01-12 14:56:39,236 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 79 [2019-01-12 14:56:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:39,238 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-12 14:56:39,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:56:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2019-01-12 14:56:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 14:56:39,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:39,243 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:39,243 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:39,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1624397958, now seen corresponding path program 5 times [2019-01-12 14:56:39,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:39,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 67 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-01-12 14:56:39,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:39,467 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 [2019-01-12 14:56:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:56:39,528 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-01-12 14:56:39,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:39,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-01-12 14:56:39,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:39,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 14:56:39,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:56:39,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:56:39,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:56:39,624 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 10 states. [2019-01-12 14:56:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:39,897 INFO L93 Difference]: Finished difference Result 116 states and 169 transitions. [2019-01-12 14:56:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:56:39,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-01-12 14:56:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:39,908 INFO L225 Difference]: With dead ends: 116 [2019-01-12 14:56:39,911 INFO L226 Difference]: Without dead ends: 112 [2019-01-12 14:56:39,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:56:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-12 14:56:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2019-01-12 14:56:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 14:56:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2019-01-12 14:56:39,948 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 106 [2019-01-12 14:56:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:39,950 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2019-01-12 14:56:39,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:56:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2019-01-12 14:56:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-12 14:56:39,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:39,953 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:39,953 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:39,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1761307917, now seen corresponding path program 6 times [2019-01-12 14:56:39,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:39,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:39,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 125 refuted. 0 times theorem prover too weak. 1201 trivial. 0 not checked. [2019-01-12 14:56:40,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:40,300 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 [2019-01-12 14:56:40,311 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:56:40,516 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-01-12 14:56:40,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:40,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-01-12 14:56:40,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:40,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-01-12 14:56:40,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:56:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:56:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:56:40,623 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand 10 states. [2019-01-12 14:56:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:40,937 INFO L93 Difference]: Finished difference Result 254 states and 408 transitions. [2019-01-12 14:56:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:56:40,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-01-12 14:56:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:40,943 INFO L225 Difference]: With dead ends: 254 [2019-01-12 14:56:40,943 INFO L226 Difference]: Without dead ends: 250 [2019-01-12 14:56:40,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:56:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-12 14:56:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 233. [2019-01-12 14:56:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-12 14:56:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 381 transitions. [2019-01-12 14:56:40,981 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 381 transitions. Word has length 174 [2019-01-12 14:56:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:40,982 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 381 transitions. [2019-01-12 14:56:40,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:56:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 381 transitions. [2019-01-12 14:56:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-12 14:56:40,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:40,989 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:40,989 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1791445318, now seen corresponding path program 7 times [2019-01-12 14:56:40,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:40,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:40,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:40,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:41,384 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2019-01-12 14:56:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 340 proven. 1046 refuted. 0 times theorem prover too weak. 3627 trivial. 0 not checked. [2019-01-12 14:56:41,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:41,615 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 [2019-01-12 14:56:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:41,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 180 proven. 1212 refuted. 0 times theorem prover too weak. 3621 trivial. 0 not checked. [2019-01-12 14:56:41,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:41,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2019-01-12 14:56:41,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 14:56:41,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 14:56:41,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-01-12 14:56:41,942 INFO L87 Difference]: Start difference. First operand 233 states and 381 transitions. Second operand 19 states. [2019-01-12 14:56:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:43,469 INFO L93 Difference]: Finished difference Result 343 states and 628 transitions. [2019-01-12 14:56:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 14:56:43,472 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 296 [2019-01-12 14:56:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:43,474 INFO L225 Difference]: With dead ends: 343 [2019-01-12 14:56:43,474 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 14:56:43,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 14:56:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 14:56:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2019-01-12 14:56:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 14:56:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2019-01-12 14:56:43,492 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 296 [2019-01-12 14:56:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:43,493 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2019-01-12 14:56:43,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 14:56:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2019-01-12 14:56:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-01-12 14:56:43,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:43,511 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:43,511 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1118315856, now seen corresponding path program 8 times [2019-01-12 14:56:43,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:43,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:43,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 452 proven. 2661 refuted. 0 times theorem prover too weak. 17878 trivial. 0 not checked. [2019-01-12 14:56:43,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:43,963 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 [2019-01-12 14:56:43,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:44,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:44,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:44,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 411 proven. 3108 refuted. 0 times theorem prover too weak. 17472 trivial. 0 not checked. [2019-01-12 14:56:44,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:44,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-01-12 14:56:44,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 14:56:44,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 14:56:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:56:44,416 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand 14 states. [2019-01-12 14:56:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:44,892 INFO L93 Difference]: Finished difference Result 356 states and 564 transitions. [2019-01-12 14:56:44,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 14:56:44,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 596 [2019-01-12 14:56:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:44,901 INFO L225 Difference]: With dead ends: 356 [2019-01-12 14:56:44,902 INFO L226 Difference]: Without dead ends: 352 [2019-01-12 14:56:44,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-01-12 14:56:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-12 14:56:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-01-12 14:56:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-12 14:56:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 531 transitions. [2019-01-12 14:56:44,937 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 531 transitions. Word has length 596 [2019-01-12 14:56:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:44,939 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 531 transitions. [2019-01-12 14:56:44,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 14:56:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 531 transitions. [2019-01-12 14:56:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2019-01-12 14:56:44,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:44,964 INFO L402 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:44,964 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:44,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1222363509, now seen corresponding path program 9 times [2019-01-12 14:56:44,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:44,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:44,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-01-12 14:56:47,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:47,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:47,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:48,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-01-12 14:56:48,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:48,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2019-01-12 14:56:49,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:49,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2019-01-12 14:56:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 14:56:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 14:56:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 14:56:49,061 INFO L87 Difference]: Start difference. First operand 334 states and 531 transitions. Second operand 36 states. [2019-01-12 14:56:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:49,933 INFO L93 Difference]: Finished difference Result 579 states and 1039 transitions. [2019-01-12 14:56:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 14:56:49,934 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 746 [2019-01-12 14:56:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:49,936 INFO L225 Difference]: With dead ends: 579 [2019-01-12 14:56:49,936 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:56:49,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=527, Invalid=1635, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:56:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:56:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:56:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:56:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:56:49,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 746 [2019-01-12 14:56:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:49,944 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:56:49,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 14:56:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:56:49,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:56:49,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:56:52,150 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2019-01-12 14:56:54,249 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 159 DAG size of output: 36 [2019-01-12 14:56:54,254 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-01-12 14:56:54,254 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-01-12 14:56:54,254 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (<= 2 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) [2019-01-12 14:56:54,254 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-12 14:56:54,254 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (<= 1 |fibonacci_#t~ret0|) (or (and (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|)) (<= |fibonacci_#in~n| 3) (and (<= 8 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 7)) (and (<= 3 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 5)) (<= 21 |fibonacci_#t~ret0|) (and (<= 13 |fibonacci_#t~ret0|) (<= fibonacci_~n 8)) (and (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6))) (<= 2 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2019-01-12 14:56:54,254 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L451 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: true [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:56:54,255 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. [2019-01-12 14:56:54,256 INFO L451 ceAbstractionStarter]: At program point L25(lines 25 36) the Hoare annotation is: true [2019-01-12 14:56:54,256 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2019-01-12 14:56:54,256 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 14:56:54,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:56:54 BoogieIcfgContainer [2019-01-12 14:56:54,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:56:54,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:56:54,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:56:54,262 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:56:54,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:33" (3/4) ... [2019-01-12 14:56:54,275 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:56:54,282 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-01-12 14:56:54,286 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:56:54,287 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:56:54,331 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:56:54,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:56:54,333 INFO L168 Benchmark]: Toolchain (without parser) took 21210.21 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 658.5 MB). Free memory was 952.7 MB in the beginning and 1.6 GB in the end (delta: -694.6 MB). Peak memory consumption was 695.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:54,334 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-12 14:56:54,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.49 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:54,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.89 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:56:54,337 INFO L168 Benchmark]: Boogie Preprocessor took 28.10 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:56:54,337 INFO L168 Benchmark]: RCFGBuilder took 331.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:54,338 INFO L168 Benchmark]: TraceAbstraction took 20448.81 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 413.1 MB). Free memory was 1.1 GB in the beginning and 785.6 MB in the end (delta: 304.5 MB). Peak memory consumption was 717.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:54,339 INFO L168 Benchmark]: Witness Printer took 69.85 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 785.6 MB in the beginning and 1.6 GB in the end (delta: -861.6 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2019-01-12 14:56:54,344 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.16 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 287.49 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.89 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.10 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 331.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20448.81 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 413.1 MB). Free memory was 1.1 GB in the beginning and 785.6 MB in the end (delta: 304.5 MB). Peak memory consumption was 717.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.85 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 785.6 MB in the beginning and 1.6 GB in the end (delta: -861.6 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: 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: 25]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. SAFE Result, 20.3s OverallTime, 13 OverallIterations, 109 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 496 SDslu, 857 SDs, 0 SdLazy, 1604 SolverSat, 618 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2620 GetRequests, 2405 SyntacticMatches, 1 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 566 PreInvPairs, 1097 NumberOfFragments, 66 HoareAnnotationTreeSize, 566 FomulaSimplifications, 8139 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 8146 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 4437 NumberOfCodeBlocks, 4386 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 4413 ConstructedInterpolants, 0 QuantifiedInterpolants, 3754909 SizeOfPredicates, 52 NumberOfNonLiveVariables, 4821 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 105257/124280 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...