./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-acceleration/nested_true-unreach-call1.i --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/loop-acceleration/nested_true-unreach-call1.i -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 a5caa00ae79e87f00b53813a39ed64b4be57c6c3 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:09:40,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:09:40,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:09:40,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:09:40,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:09:40,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:09:40,712 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:09:40,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:09:40,716 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:09:40,717 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:09:40,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:09:40,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:09:40,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:09:40,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:09:40,722 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:09:40,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:09:40,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:09:40,725 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:09:40,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:09:40,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:09:40,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:09:40,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:09:40,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:09:40,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:09:40,735 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:09:40,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:09:40,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:09:40,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:09:40,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:09:40,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:09:40,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:09:40,741 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:09:40,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:09:40,742 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:09:40,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:09:40,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:09:40,744 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:09:40,760 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:09:40,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:09:40,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:09:40,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:09:40,761 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:09:40,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:09:40,762 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:09:40,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:09:40,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:09:40,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:09:40,763 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:09:40,763 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:09:40,763 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:09:40,763 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:09:40,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:09:40,765 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:09:40,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:09:40,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:09:40,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:09:40,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:09:40,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:09:40,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:09:40,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:09:40,766 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:09:40,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:09:40,766 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:09:40,766 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:09:40,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:09:40,768 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 -> a5caa00ae79e87f00b53813a39ed64b4be57c6c3 [2019-01-12 11:09:40,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:09:40,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:09:40,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:09:40,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:09:40,840 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:09:40,841 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-acceleration/nested_true-unreach-call1.i [2019-01-12 11:09:40,904 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039e3ed4c/a4c66798bf464933a888b408bd54c20c/FLAG2336ffe2d [2019-01-12 11:09:41,327 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:09:41,328 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-acceleration/nested_true-unreach-call1.i [2019-01-12 11:09:41,335 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039e3ed4c/a4c66798bf464933a888b408bd54c20c/FLAG2336ffe2d [2019-01-12 11:09:41,689 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/039e3ed4c/a4c66798bf464933a888b408bd54c20c [2019-01-12 11:09:41,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:09:41,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:09:41,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:09:41,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:09:41,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:09:41,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd0d229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41, skipping insertion in model container [2019-01-12 11:09:41,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:09:41,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:09:41,914 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:09:41,919 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:09:41,932 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:09:41,945 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:09:41,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41 WrapperNode [2019-01-12 11:09:41,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:09:41,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:09:41,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:09:41,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:09:41,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:09:41,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:09:41,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:09:41,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:09:41,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:41,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:42,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (1/1) ... [2019-01-12 11:09:42,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:09:42,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:09:42,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:09:42,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:09:42,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (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 11:09:42,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:09:42,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:09:42,279 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:09:42,279 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 11:09:42,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:09:42 BoogieIcfgContainer [2019-01-12 11:09:42,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:09:42,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:09:42,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:09:42,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:09:42,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:09:41" (1/3) ... [2019-01-12 11:09:42,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8ad74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:09:42, skipping insertion in model container [2019-01-12 11:09:42,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:09:41" (2/3) ... [2019-01-12 11:09:42,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8ad74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:09:42, skipping insertion in model container [2019-01-12 11:09:42,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:09:42" (3/3) ... [2019-01-12 11:09:42,287 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2019-01-12 11:09:42,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:09:42,302 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:09:42,316 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:09:42,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:09:42,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:09:42,345 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:09:42,345 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:09:42,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:09:42,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:09:42,345 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:09:42,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:09:42,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:09:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-12 11:09:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-12 11:09:42,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:42,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-12 11:09:42,365 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash 29817909, now seen corresponding path program 1 times [2019-01-12 11:09:42,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:42,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:42,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:42,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:42,688 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-01-12 11:09:42,699 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 11:09:42,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:09:42,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:09:42,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:09:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:09:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:09:42,717 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-12 11:09:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:42,819 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2019-01-12 11:09:42,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:09:42,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-12 11:09:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:42,831 INFO L225 Difference]: With dead ends: 24 [2019-01-12 11:09:42,831 INFO L226 Difference]: Without dead ends: 11 [2019-01-12 11:09:42,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:09:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-12 11:09:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-12 11:09:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-12 11:09:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-12 11:09:42,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-01-12 11:09:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:42,866 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-12 11:09:42,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:09:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-12 11:09:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:09:42,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:42,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:09:42,868 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:42,868 INFO L82 PathProgramCache]: Analyzing trace with hash 728659877, now seen corresponding path program 1 times [2019-01-12 11:09:42,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:42,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:42,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:42,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:42,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:09:42,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:09:42,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:09:42,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:09:42,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:09:42,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:09:42,992 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2019-01-12 11:09:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:43,017 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-12 11:09:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:09:43,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-12 11:09:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:43,018 INFO L225 Difference]: With dead ends: 17 [2019-01-12 11:09:43,019 INFO L226 Difference]: Without dead ends: 10 [2019-01-12 11:09:43,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:09:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-12 11:09:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-12 11:09:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-12 11:09:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-01-12 11:09:43,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-01-12 11:09:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:43,024 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-12 11:09:43,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:09:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-01-12 11:09:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:09:43,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:43,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:09:43,026 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1564831260, now seen corresponding path program 1 times [2019-01-12 11:09:43,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:43,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:43,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:09:43,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:43,158 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 11:09:43,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:43,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:09:43,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:43,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-12 11:09:43,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:09:43,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:09:43,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:09:43,392 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2019-01-12 11:09:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:43,711 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-01-12 11:09:43,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:09:43,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-12 11:09:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:43,714 INFO L225 Difference]: With dead ends: 28 [2019-01-12 11:09:43,714 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 11:09:43,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:09:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 11:09:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-01-12 11:09:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 11:09:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-01-12 11:09:43,720 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2019-01-12 11:09:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:43,720 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-12 11:09:43,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:09:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-01-12 11:09:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:09:43,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:43,721 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-12 11:09:43,722 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1249079755, now seen corresponding path program 2 times [2019-01-12 11:09:43,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:43,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:43,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 11:09:43,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:43,885 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 11:09:43,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:09:43,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:09:43,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:43,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 11:09:44,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:44,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 11:09:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:09:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:09:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:09:44,129 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-01-12 11:09:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:44,810 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-01-12 11:09:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 11:09:44,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 11:09:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:44,812 INFO L225 Difference]: With dead ends: 40 [2019-01-12 11:09:44,812 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 11:09:44,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:09:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 11:09:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-01-12 11:09:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 11:09:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-01-12 11:09:44,821 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-01-12 11:09:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:44,821 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-12 11:09:44,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:09:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-01-12 11:09:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:09:44,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:44,823 INFO L402 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-12 11:09:44,824 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1525597154, now seen corresponding path program 3 times [2019-01-12 11:09:44,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:44,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-12 11:09:44,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:44,971 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 11:09:44,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:09:45,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 11:09:45,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:45,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 11:09:45,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:45,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-12 11:09:45,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:09:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:09:45,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:09:45,083 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 7 states. [2019-01-12 11:09:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:45,129 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-01-12 11:09:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:09:45,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 11:09:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:45,131 INFO L225 Difference]: With dead ends: 45 [2019-01-12 11:09:45,131 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 11:09:45,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:09:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 11:09:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 11:09:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 11:09:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-01-12 11:09:45,139 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2019-01-12 11:09:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:45,139 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-01-12 11:09:45,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:09:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-01-12 11:09:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 11:09:45,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:45,140 INFO L402 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-12 11:09:45,141 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:45,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1967539557, now seen corresponding path program 4 times [2019-01-12 11:09:45,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:45,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:45,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:45,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 11:09:45,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:45,452 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 11:09:45,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:09:45,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:09:45,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:45,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 11:09:45,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:45,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 10 [2019-01-12 11:09:45,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 11:09:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 11:09:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:09:45,711 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 11 states. [2019-01-12 11:09:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:45,851 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-12 11:09:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:09:45,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-01-12 11:09:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:45,853 INFO L225 Difference]: With dead ends: 44 [2019-01-12 11:09:45,853 INFO L226 Difference]: Without dead ends: 40 [2019-01-12 11:09:45,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:09:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-12 11:09:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-01-12 11:09:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 11:09:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-12 11:09:45,864 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2019-01-12 11:09:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:45,865 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-12 11:09:45,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 11:09:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-12 11:09:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 11:09:45,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:45,867 INFO L402 BasicCegarLoop]: trace histogram [16, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-12 11:09:45,868 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash -899182539, now seen corresponding path program 5 times [2019-01-12 11:09:45,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:45,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:45,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:45,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 11:09:46,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:46,108 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 11:09:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:09:46,158 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-01-12 11:09:46,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:46,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 134 proven. 10 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-01-12 11:09:46,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:46,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2019-01-12 11:09:46,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 11:09:46,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 11:09:46,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:09:46,254 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2019-01-12 11:09:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:47,081 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2019-01-12 11:09:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 11:09:47,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-01-12 11:09:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:47,083 INFO L225 Difference]: With dead ends: 80 [2019-01-12 11:09:47,083 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 11:09:47,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:09:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 11:09:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-01-12 11:09:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 11:09:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-01-12 11:09:47,096 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2019-01-12 11:09:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:47,097 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-01-12 11:09:47,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 11:09:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-01-12 11:09:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 11:09:47,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:47,100 INFO L402 BasicCegarLoop]: trace histogram [25, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-12 11:09:47,100 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash -541355040, now seen corresponding path program 6 times [2019-01-12 11:09:47,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:47,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-12 11:09:47,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:47,431 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 11:09:47,461 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:09:47,689 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-12 11:09:47,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:47,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 264 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-12 11:09:47,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-01-12 11:09:47,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 11:09:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 11:09:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:09:47,787 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 14 states. [2019-01-12 11:09:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:49,481 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2019-01-12 11:09:49,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-12 11:09:49,483 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-01-12 11:09:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:49,484 INFO L225 Difference]: With dead ends: 106 [2019-01-12 11:09:49,485 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 11:09:49,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=2216, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 11:09:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 11:09:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-01-12 11:09:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 11:09:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-01-12 11:09:49,499 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 45 [2019-01-12 11:09:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:49,499 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-01-12 11:09:49,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 11:09:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-01-12 11:09:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 11:09:49,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:49,501 INFO L402 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-12 11:09:49,502 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1076613685, now seen corresponding path program 7 times [2019-01-12 11:09:49,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:49,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:49,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 0 proven. 771 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 11:09:49,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:49,796 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 11:09:49,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:49,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-12 11:09:50,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:50,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 15 [2019-01-12 11:09:50,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 11:09:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 11:09:50,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:09:50,251 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 16 states. [2019-01-12 11:09:50,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:50,540 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-01-12 11:09:50,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 11:09:50,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-01-12 11:09:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:50,545 INFO L225 Difference]: With dead ends: 81 [2019-01-12 11:09:50,545 INFO L226 Difference]: Without dead ends: 77 [2019-01-12 11:09:50,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:09:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-12 11:09:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-01-12 11:09:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-12 11:09:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-01-12 11:09:50,563 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 59 [2019-01-12 11:09:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:50,563 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-01-12 11:09:50,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 11:09:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-01-12 11:09:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 11:09:50,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:50,566 INFO L402 BasicCegarLoop]: trace histogram [42, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-12 11:09:50,567 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash 642437445, now seen corresponding path program 8 times [2019-01-12 11:09:50,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:50,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:50,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:09:50,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1078 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-12 11:09:50,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:50,954 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 11:09:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:09:51,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:09:51,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:51,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1078 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-12 11:09:51,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-12 11:09:51,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 11:09:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 11:09:51,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:09:51,167 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 11 states. [2019-01-12 11:09:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:51,543 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-01-12 11:09:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 11:09:51,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-01-12 11:09:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:51,545 INFO L225 Difference]: With dead ends: 90 [2019-01-12 11:09:51,545 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 11:09:51,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:09:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 11:09:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2019-01-12 11:09:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 11:09:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-01-12 11:09:51,566 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 68 [2019-01-12 11:09:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:51,568 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-01-12 11:09:51,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 11:09:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-01-12 11:09:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 11:09:51,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:51,570 INFO L402 BasicCegarLoop]: trace histogram [48, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-12 11:09:51,570 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:51,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1372470219, now seen corresponding path program 9 times [2019-01-12 11:09:51,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:51,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:51,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:51,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 0 proven. 1436 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-01-12 11:09:52,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:52,060 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 11:09:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:09:52,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-12 11:09:52,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:52,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 358 proven. 21 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-12 11:09:52,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:52,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-01-12 11:09:52,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 11:09:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 11:09:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:09:52,284 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 18 states. [2019-01-12 11:09:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:54,162 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2019-01-12 11:09:54,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-12 11:09:54,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2019-01-12 11:09:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:54,164 INFO L225 Difference]: With dead ends: 174 [2019-01-12 11:09:54,165 INFO L226 Difference]: Without dead ends: 105 [2019-01-12 11:09:54,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=405, Invalid=6075, Unknown=0, NotChecked=0, Total=6480 [2019-01-12 11:09:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-12 11:09:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2019-01-12 11:09:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-12 11:09:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2019-01-12 11:09:54,188 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 77 [2019-01-12 11:09:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:54,188 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2019-01-12 11:09:54,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 11:09:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2019-01-12 11:09:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 11:09:54,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:54,191 INFO L402 BasicCegarLoop]: trace histogram [63, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-12 11:09:54,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash -163007556, now seen corresponding path program 10 times [2019-01-12 11:09:54,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:54,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:54,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:54,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2637 backedges. 0 proven. 2385 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-01-12 11:09:54,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:54,461 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 11:09:54,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:09:54,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:09:54,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:54,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2637 backedges. 521 proven. 28 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-12 11:09:54,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:54,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-01-12 11:09:54,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 11:09:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 11:09:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-12 11:09:54,686 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 20 states. [2019-01-12 11:09:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:09:57,651 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2019-01-12 11:09:57,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-12 11:09:57,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2019-01-12 11:09:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:09:57,653 INFO L225 Difference]: With dead ends: 212 [2019-01-12 11:09:57,653 INFO L226 Difference]: Without dead ends: 126 [2019-01-12 11:09:57,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=510, Invalid=9390, Unknown=0, NotChecked=0, Total=9900 [2019-01-12 11:09:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-12 11:09:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2019-01-12 11:09:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-12 11:09:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2019-01-12 11:09:57,688 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 95 [2019-01-12 11:09:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:09:57,688 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2019-01-12 11:09:57,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 11:09:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2019-01-12 11:09:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-12 11:09:57,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:09:57,694 INFO L402 BasicCegarLoop]: trace histogram [80, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-12 11:09:57,695 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:09:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:09:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1037037109, now seen corresponding path program 11 times [2019-01-12 11:09:57,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:09:57,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:09:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:57,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:09:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:09:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:09:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 0 proven. 3745 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-01-12 11:09:58,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:09:58,001 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 11:09:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:09:58,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-12 11:09:58,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:09:58,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:09:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 2236 proven. 36 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2019-01-12 11:09:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:09:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-01-12 11:09:58,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 11:09:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 11:09:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:09:58,277 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 22 states. [2019-01-12 11:10:00,958 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 11:10:02,053 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 11:10:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:10:02,541 INFO L93 Difference]: Finished difference Result 254 states and 288 transitions. [2019-01-12 11:10:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-12 11:10:02,542 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-01-12 11:10:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:10:02,543 INFO L225 Difference]: With dead ends: 254 [2019-01-12 11:10:02,544 INFO L226 Difference]: Without dead ends: 149 [2019-01-12 11:10:02,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=627, Invalid=13893, Unknown=0, NotChecked=0, Total=14520 [2019-01-12 11:10:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-12 11:10:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2019-01-12 11:10:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 11:10:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2019-01-12 11:10:02,572 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 115 [2019-01-12 11:10:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:10:02,572 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2019-01-12 11:10:02,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 11:10:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2019-01-12 11:10:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-12 11:10:02,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:10:02,576 INFO L402 BasicCegarLoop]: trace histogram [99, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-12 11:10:02,576 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:10:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:10:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -313740614, now seen corresponding path program 12 times [2019-01-12 11:10:02,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:10:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:10:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:02,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:10:02,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:10:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6116 backedges. 0 proven. 5621 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 11:10:02,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:10:02,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:10:02,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:10:04,846 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-01-12 11:10:04,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:10:04,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:10:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6116 backedges. 3156 proven. 45 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2019-01-12 11:10:05,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:10:05,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-01-12 11:10:05,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 11:10:05,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 11:10:05,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:10:05,063 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 24 states. [2019-01-12 11:10:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:10:08,973 INFO L93 Difference]: Finished difference Result 300 states and 337 transitions. [2019-01-12 11:10:08,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-01-12 11:10:08,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 137 [2019-01-12 11:10:08,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:10:08,975 INFO L225 Difference]: With dead ends: 300 [2019-01-12 11:10:08,976 INFO L226 Difference]: Without dead ends: 174 [2019-01-12 11:10:08,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7150 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=756, Invalid=19836, Unknown=0, NotChecked=0, Total=20592 [2019-01-12 11:10:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-12 11:10:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 162. [2019-01-12 11:10:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-12 11:10:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2019-01-12 11:10:09,004 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 137 [2019-01-12 11:10:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:10:09,004 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2019-01-12 11:10:09,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 11:10:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2019-01-12 11:10:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-12 11:10:09,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:10:09,007 INFO L402 BasicCegarLoop]: trace histogram [120, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-12 11:10:09,008 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:10:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:10:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2096097333, now seen corresponding path program 13 times [2019-01-12 11:10:09,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:10:09,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:10:09,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:09,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:10:09,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:10:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-01-12 11:10:09,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:10:09,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:10:09,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:10:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:10:09,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:10:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8790 backedges. 0 proven. 8130 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-01-12 11:10:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:10:09,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-01-12 11:10:09,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 11:10:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 11:10:09,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:10:09,844 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 16 states. [2019-01-12 11:10:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:10:10,119 INFO L93 Difference]: Finished difference Result 191 states and 205 transitions. [2019-01-12 11:10:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 11:10:10,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 161 [2019-01-12 11:10:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:10:10,124 INFO L225 Difference]: With dead ends: 191 [2019-01-12 11:10:10,124 INFO L226 Difference]: Without dead ends: 187 [2019-01-12 11:10:10,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:10:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-12 11:10:10,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2019-01-12 11:10:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-12 11:10:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2019-01-12 11:10:10,153 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 161 [2019-01-12 11:10:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:10:10,153 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2019-01-12 11:10:10,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 11:10:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2019-01-12 11:10:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-12 11:10:10,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:10:10,157 INFO L402 BasicCegarLoop]: trace histogram [130, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-12 11:10:10,157 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:10:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:10:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2007548677, now seen corresponding path program 14 times [2019-01-12 11:10:10,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:10:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:10:10,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:10:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:10:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-01-12 11:10:11,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:10:11,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:10:11,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:10:11,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:10:11,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:10:11,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:10:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-01-12 11:10:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:10:11,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-01-12 11:10:11,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 11:10:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 11:10:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:10:11,858 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 17 states. [2019-01-12 11:10:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:10:12,243 INFO L93 Difference]: Finished difference Result 204 states and 219 transitions. [2019-01-12 11:10:12,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 11:10:12,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 174 [2019-01-12 11:10:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:10:12,245 INFO L225 Difference]: With dead ends: 204 [2019-01-12 11:10:12,246 INFO L226 Difference]: Without dead ends: 200 [2019-01-12 11:10:12,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:10:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-12 11:10:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2019-01-12 11:10:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-12 11:10:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2019-01-12 11:10:12,270 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 174 [2019-01-12 11:10:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:10:12,272 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2019-01-12 11:10:12,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 11:10:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2019-01-12 11:10:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-12 11:10:12,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:10:12,274 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-12 11:10:12,274 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:10:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:10:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash 165018165, now seen corresponding path program 15 times [2019-01-12 11:10:12,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:10:12,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:10:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:12,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:10:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:10:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:10:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 0 proven. 11207 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2019-01-12 11:10:12,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:10:12,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:10:12,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:10:13,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-12 11:10:13,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:10:13,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:10:22,776 WARN L181 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2019-01-12 11:10:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11977 backedges. 1600 proven. 0 refuted. 0 times theorem prover too weak. 10377 trivial. 0 not checked. [2019-01-12 11:10:22,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 11:10:22,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2019-01-12 11:10:22,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 11:10:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 11:10:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=337, Unknown=1, NotChecked=0, Total=420 [2019-01-12 11:10:22,835 INFO L87 Difference]: Start difference. First operand 188 states and 202 transitions. Second operand 21 states. [2019-01-12 11:10:30,321 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-01-12 11:10:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:10:30,322 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2019-01-12 11:10:30,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 11:10:30,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 187 [2019-01-12 11:10:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:10:30,322 INFO L225 Difference]: With dead ends: 216 [2019-01-12 11:10:30,322 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:10:30,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=123, Invalid=428, Unknown=1, NotChecked=0, Total=552 [2019-01-12 11:10:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:10:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:10:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:10:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:10:30,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2019-01-12 11:10:30,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:10:30,324 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:10:30,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 11:10:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:10:30,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:10:30,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:10:31,195 WARN L181 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 478 DAG size of output: 75 [2019-01-12 11:10:31,852 WARN L181 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 15 [2019-01-12 11:10:32,156 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 14 [2019-01-12 11:10:32,160 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:10:32,160 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-01-12 11:10:32,160 INFO L444 ceAbstractionStarter]: At program point L13-2(lines 13 15) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (and (< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 268435455) (< (mod ULTIMATE.start_main_~x~0 4294967296) 268435455))) [2019-01-12 11:10:32,160 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 13 15) no Hoare annotation was computed. [2019-01-12 11:10:32,161 INFO L444 ceAbstractionStarter]: At program point L11-2(lines 11 17) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~x~0 0) (= ULTIMATE.start_main_~y~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 268435455)) [2019-01-12 11:10:32,161 INFO L448 ceAbstractionStarter]: For program point L11-3(lines 11 17) no Hoare annotation was computed. [2019-01-12 11:10:32,161 INFO L448 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2019-01-12 11:10:32,161 INFO L451 ceAbstractionStarter]: At program point L3-2(lines 1 19) the Hoare annotation is: true [2019-01-12 11:10:32,161 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:10:32,161 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:10:32,162 INFO L448 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2019-01-12 11:10:32,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:10:32 BoogieIcfgContainer [2019-01-12 11:10:32,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:10:32,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:10:32,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:10:32,189 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:10:32,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:09:42" (3/4) ... [2019-01-12 11:10:32,196 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:10:32,213 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 11:10:32,213 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:10:32,279 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:10:32,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:10:32,281 INFO L168 Benchmark]: Toolchain (without parser) took 50587.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.5 MB). Free memory was 941.9 MB in the beginning and 1.0 GB in the end (delta: -100.9 MB). Peak memory consumption was 309.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:10:32,282 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:10:32,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.58 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:10:32,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.10 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:10:32,285 INFO L168 Benchmark]: Boogie Preprocessor took 19.21 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:10:32,288 INFO L168 Benchmark]: RCFGBuilder took 278.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:10:32,289 INFO L168 Benchmark]: TraceAbstraction took 49907.40 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 293.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:10:32,290 INFO L168 Benchmark]: Witness Printer took 91.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:10:32,299 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.58 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 931.2 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 35.10 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.21 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 278.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49907.40 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 293.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. * Witness Printer took 91.02 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 13]: Loop Invariant Derived loop invariant: (x <= 0 && 0 <= x) || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((x <= 0 && y == 0) && 0 <= x) || (x + 4294967295) % 4294967296 < 268435455 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. SAFE Result, 49.8s OverallTime, 17 OverallIterations, 140 TraceHistogramMax, 25.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 262 SDtfs, 401 SDslu, 2092 SDs, 0 SdLazy, 10407 SolverSat, 581 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1808 GetRequests, 1155 SyntacticMatches, 19 SemanticMatches, 634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18185 ImplicationChecksByTransitivity, 28.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=16, 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, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 197 NumberOfFragments, 40 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1949749 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 263 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2043 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 2429 ConstructedInterpolants, 1 QuantifiedInterpolants, 1571009 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2208 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 32 InterpolantComputations, 3 PerfectInterpolantSequences, 32597/97099 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...