./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i25_o25_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/id_i25_o25_true-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 980109aaf5797fcdc56688cd1127831babfd66a2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:12:09,290 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:12:09,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:12:09,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:12:09,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:12:09,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:12:09,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:12:09,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:12:09,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:12:09,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:12:09,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:12:09,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:12:09,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:12:09,316 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:12:09,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:12:09,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:12:09,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:12:09,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:12:09,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:12:09,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:12:09,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:12:09,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:12:09,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:12:09,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:12:09,331 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:12:09,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:12:09,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:12:09,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:12:09,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:12:09,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:12:09,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:12:09,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:12:09,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:12:09,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:12:09,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:12:09,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:12:09,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:12:09,357 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:12:09,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:12:09,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:12:09,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:12:09,359 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:12:09,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:12:09,360 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:12:09,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:12:09,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:12:09,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:12:09,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:12:09,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:12:09,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:12:09,361 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:12:09,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:12:09,361 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:12:09,362 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:12:09,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:12:09,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:12:09,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:12:09,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:12:09,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:12:09,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:12:09,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:12:09,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:12:09,365 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:12:09,365 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:12:09,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:12:09,365 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 -> 980109aaf5797fcdc56688cd1127831babfd66a2 [2019-01-12 15:12:09,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:12:09,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:12:09,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:12:09,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:12:09,422 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:12:09,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i25_o25_true-unreach-call_true-termination.c [2019-01-12 15:12:09,475 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7837bc574/0e9b03c6d5f341a5b6028df2132704f0/FLAGb7f3967f1 [2019-01-12 15:12:09,908 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:12:09,909 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i25_o25_true-unreach-call_true-termination.c [2019-01-12 15:12:09,916 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7837bc574/0e9b03c6d5f341a5b6028df2132704f0/FLAGb7f3967f1 [2019-01-12 15:12:10,266 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7837bc574/0e9b03c6d5f341a5b6028df2132704f0 [2019-01-12 15:12:10,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:12:10,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:12:10,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:10,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:12:10,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:12:10,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707b848b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10, skipping insertion in model container [2019-01-12 15:12:10,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:12:10,315 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:12:10,538 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:10,543 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:12:10,565 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:12:10,582 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:12:10,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10 WrapperNode [2019-01-12 15:12:10,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:12:10,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:10,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:12:10,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:12:10,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:12:10,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:12:10,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:12:10,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:12:10,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (1/1) ... [2019-01-12 15:12:10,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:12:10,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:12:10,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:12:10,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:12:10,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (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 15:12:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:12:10,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:12:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:12:10,784 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:12:10,969 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:12:10,969 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:12:10,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:10 BoogieIcfgContainer [2019-01-12 15:12:10,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:12:10,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:12:10,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:12:10,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:12:10,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:12:10" (1/3) ... [2019-01-12 15:12:10,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd204b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:10, skipping insertion in model container [2019-01-12 15:12:10,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:12:10" (2/3) ... [2019-01-12 15:12:10,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd204b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:12:10, skipping insertion in model container [2019-01-12 15:12:10,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:10" (3/3) ... [2019-01-12 15:12:10,979 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i25_o25_true-unreach-call_true-termination.c [2019-01-12 15:12:10,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:12:10,997 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:12:11,014 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:12:11,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:12:11,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:12:11,045 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:12:11,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:12:11,045 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:12:11,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:12:11,046 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:12:11,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:12:11,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:12:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:12:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:12:11,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:11,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:11,074 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:12:11,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:11,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:11,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:11,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:11,367 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 15:12:11,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:12:11,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:12:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:12:11,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:12:11,388 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:12:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:11,539 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:12:11,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:12:11,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:12:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:11,551 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:11,551 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:12:11,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:12:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:12:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:12:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:12:11,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:12:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:11,590 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:12:11,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:12:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:12:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:12:11,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:11,593 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:11,593 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:12:11,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:11,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:11,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:11,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:11,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:11,685 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 15:12:11,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:11,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:12:11,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:11,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:12:11,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:12:11,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:12:11,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:12:11,804 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:12:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,006 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:12:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:12:12,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:12:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,009 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:12:12,009 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:12:12,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:12:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:12:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:12:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:12:12,017 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:12:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:12,018 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:12:12,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:12:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:12:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:12:12,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:12,021 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:12,021 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:12,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:12:12,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:12,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:12,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:12,253 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 15:12:12,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:12,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:12,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:12,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:12:12,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:12,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:12:12,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:12:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:12:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:12:12,354 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:12:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,510 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:12:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:12:12,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:12:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,513 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:12:12,514 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:12:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:12:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:12:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:12:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:12:12,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:12:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:12,521 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:12:12,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:12:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:12:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:12:12,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:12,523 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:12,523 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:12,524 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:12:12,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:12,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:12,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:12,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:12,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:12,747 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 15:12:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:12,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:12:12,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:12,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:12:12,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:12,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:12:12,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:12:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:12:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:12:12,836 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:12:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:12,986 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:12:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:12:12,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:12:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:12,992 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:12:12,992 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:12:12,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:12:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:12:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:12:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:12:13,003 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:12:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:13,004 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:12:13,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:12:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:12:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:12:13,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:13,006 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:13,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:12:13,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:13,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:13,590 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 15:12:13,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:13,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:13,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:13,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:12:13,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:13,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:12:13,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:12:13,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:12:13,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:12:13,684 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:12:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:13,842 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:12:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:12:13,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:12:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:13,845 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:12:13,845 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:12:13,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:12:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:12:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:12:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:12:13,853 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:12:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:13,854 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:12:13,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:12:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:12:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:12:13,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:13,856 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:13,856 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:12:13,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:13,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:14,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:14,013 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 15:12:14,040 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:14,068 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:12:14,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:14,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:12:14,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:14,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:12:14,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:12:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:12:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:12:14,130 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:12:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:14,337 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:12:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:12:14,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:12:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:14,341 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:12:14,341 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:12:14,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:12:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:12:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:12:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:12:14,350 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:12:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:14,350 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:12:14,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:12:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:12:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:12:14,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:14,353 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:14,353 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:12:14,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:14,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:14,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:14,611 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 15:12:14,623 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:14,645 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:12:14,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:14,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:12:14,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:14,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:12:14,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:12:14,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:12:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:12:14,711 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:12:14,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:14,910 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:12:14,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:12:14,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:12:14,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:14,914 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:12:14,914 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:12:14,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:12:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:12:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:12:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:12:14,922 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:12:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:14,924 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:12:14,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:12:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:12:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:12:14,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:14,927 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:14,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:12:14,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:14,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:14,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:14,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:15,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:15,115 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 15:12:15,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:15,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:12:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:15,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:12:15,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:12:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:12:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:12:15,225 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:12:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:15,534 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:12:15,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:12:15,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:12:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:15,539 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:12:15,539 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:12:15,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:12:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:12:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:12:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:12:15,550 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:12:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:15,552 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:12:15,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:12:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:12:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:12:15,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:15,555 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:15,556 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:12:15,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:15,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:15,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:15,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:15,918 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 15:12:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:15,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:15,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:16,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:12:16,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:16,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:12:16,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:12:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:12:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:12:16,057 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:12:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:16,352 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:12:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:12:16,354 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:12:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:16,356 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:12:16,356 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:12:16,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:12:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:12:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:12:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:12:16,367 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:12:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:16,367 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:12:16,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:12:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:12:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:12:16,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:16,371 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:16,372 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:12:16,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:16,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:16,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:16,610 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 15:12:16,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:16,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:12:16,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:16,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:12:16,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:16,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:12:16,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:12:16,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:12:16,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:12:16,895 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:12:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:17,361 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:12:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:12:17,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:12:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:17,364 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:12:17,364 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:12:17,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:12:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:12:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:12:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:12:17,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:12:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:17,375 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:12:17,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:12:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:12:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:12:17,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:17,378 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:17,378 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:17,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:12:17,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:17,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:17,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:17,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:17,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:17,667 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 15:12:17,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:17,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:17,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:17,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:12:17,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:12:17,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:12:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:12:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:12:17,835 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 15:12:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:18,233 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:12:18,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:12:18,235 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 15:12:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:18,237 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:12:18,237 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:12:18,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:12:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:12:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:12:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:12:18,246 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:12:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:18,246 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:12:18,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:12:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:12:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:12:18,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:18,249 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:18,249 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:18,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:18,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:12:18,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:18,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:18,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:18,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:18,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:18,530 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 15:12:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:18,578 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:12:18,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:18,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:12:18,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:18,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 15:12:18,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:12:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:12:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:12:18,642 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 15:12:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:18,980 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:12:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:12:18,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 15:12:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:18,984 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:12:18,984 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:12:18,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:12:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:12:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:12:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:12:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:12:18,994 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:12:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:18,994 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:12:18,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:12:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:12:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:12:18,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:18,998 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:18,999 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:18,999 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:12:19,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:19,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:19,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:19,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:19,363 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 15:12:19,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:19,458 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:12:19,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:19,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:12:19,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:19,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 15:12:19,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:12:19,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:12:19,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:12:19,557 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2019-01-12 15:12:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:20,027 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:12:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:12:20,029 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-01-12 15:12:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:20,031 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:12:20,031 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:12:20,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:12:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:12:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:12:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:12:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:12:20,041 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:12:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:20,042 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:12:20,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:12:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:12:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:12:20,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:20,045 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:20,046 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:12:20,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:20,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:20,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:20,399 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 15:12:20,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:20,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:12:20,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:20,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 15:12:20,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:12:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:12:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:12:20,514 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-01-12 15:12:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:20,833 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:12:20,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:12:20,835 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-01-12 15:12:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:20,837 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:12:20,837 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:12:20,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:12:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:12:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:12:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:12:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:12:20,846 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:12:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:20,847 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:12:20,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:12:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:12:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:12:20,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:20,850 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:20,850 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:12:20,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:20,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:21,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:21,591 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 15:12:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:21,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:21,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:21,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:12:21,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:21,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 15:12:21,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 15:12:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 15:12:21,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:12:21,727 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2019-01-12 15:12:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:22,054 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:12:22,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:12:22,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-01-12 15:12:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:22,058 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:12:22,058 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:12:22,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:12:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:12:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:12:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:12:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:12:22,069 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:12:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:22,069 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:12:22,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 15:12:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:12:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:12:22,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:22,071 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:22,071 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:12:22,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:22,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:22,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:22,410 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 15:12:22,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:22,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:12:22,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:22,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:12:22,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:22,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 15:12:22,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:12:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:12:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:12:22,579 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 20 states. [2019-01-12 15:12:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:23,056 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:12:23,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 15:12:23,058 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-01-12 15:12:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:23,059 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:12:23,060 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:12:23,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:12:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:12:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:12:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:12:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:12:23,068 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:12:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:23,070 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:12:23,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:12:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:12:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:12:23,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:23,072 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:23,073 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:12:23,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:23,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:23,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:23,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:23,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:23,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:23,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:23,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:12:23,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:23,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 15:12:23,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:12:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:12:23,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:12:23,544 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 21 states. [2019-01-12 15:12:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:24,047 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 15:12:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:12:24,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-01-12 15:12:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:24,050 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:12:24,050 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 15:12:24,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:12:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 15:12:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 15:12:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 15:12:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 15:12:24,057 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 15:12:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:24,057 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 15:12:24,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:12:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 15:12:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 15:12:24,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:24,061 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:24,061 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 15:12:24,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:24,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:24,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:24,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:12:24,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:24,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:24,417 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 15:12:24,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:24,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:12:24,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:24,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 15:12:24,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:12:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:12:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:12:24,477 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 15:12:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:24,786 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 15:12:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:12:24,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 15:12:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:24,788 INFO L225 Difference]: With dead ends: 69 [2019-01-12 15:12:24,789 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 15:12:24,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:12:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 15:12:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 15:12:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 15:12:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 15:12:24,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 15:12:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 15:12:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:12:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 15:12:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:12:24,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:24,799 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:24,799 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 15:12:24,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:24,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:24,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:24,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:12:25,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:25,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:25,196 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:25,240 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:12:25,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:25,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:12:25,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:25,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 15:12:25,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:12:25,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:12:25,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:12:25,306 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 15:12:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:25,796 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 15:12:25,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:12:25,803 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 15:12:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:25,804 INFO L225 Difference]: With dead ends: 72 [2019-01-12 15:12:25,804 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 15:12:25,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 15:12:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 15:12:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 15:12:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 15:12:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 15:12:25,818 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 15:12:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:25,818 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 15:12:25,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:12:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 15:12:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 15:12:25,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:25,822 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:25,822 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 15:12:25,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:25,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:25,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:12:26,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:26,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:26,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:26,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:12:26,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:26,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 15:12:26,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:12:26,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:12:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:12:26,285 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 15:12:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:26,899 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 15:12:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 15:12:26,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 15:12:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:26,904 INFO L225 Difference]: With dead ends: 75 [2019-01-12 15:12:26,904 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 15:12:26,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:12:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 15:12:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 15:12:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 15:12:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 15:12:26,910 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 15:12:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:26,912 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 15:12:26,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:12:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 15:12:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 15:12:26,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:26,915 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:26,915 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 15:12:26,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:26,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:26,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:26,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:26,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 15:12:27,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:27,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:27,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:12:27,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:12:27,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:27,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-01-12 15:12:27,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:27,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 15:12:27,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:12:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:12:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:12:27,563 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 25 states. [2019-01-12 15:12:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:27,965 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-01-12 15:12:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 15:12:27,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 129 [2019-01-12 15:12:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:27,969 INFO L225 Difference]: With dead ends: 78 [2019-01-12 15:12:27,969 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 15:12:27,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 15:12:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 15:12:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 15:12:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 15:12:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-01-12 15:12:27,976 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-01-12 15:12:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:27,977 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-01-12 15:12:27,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:12:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-01-12 15:12:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 15:12:27,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:27,981 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:27,982 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-01-12 15:12:27,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:27,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:27,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:27,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 15:12:29,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:29,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:29,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:12:29,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-12 15:12:29,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:29,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-01-12 15:12:29,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:29,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-12 15:12:29,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 15:12:29,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 15:12:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:12:29,152 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 26 states. [2019-01-12 15:12:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:29,605 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-01-12 15:12:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 15:12:29,608 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2019-01-12 15:12:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:29,610 INFO L225 Difference]: With dead ends: 81 [2019-01-12 15:12:29,611 INFO L226 Difference]: Without dead ends: 77 [2019-01-12 15:12:29,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 15:12:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-12 15:12:29,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-12 15:12:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 15:12:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-12 15:12:29,620 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-01-12 15:12:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:29,622 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-12 15:12:29,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 15:12:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-12 15:12:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 15:12:29,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:29,624 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:29,624 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-01-12 15:12:29,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:29,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:29,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-12 15:12:30,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:30,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:12:30,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:12:30,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:30,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-01-12 15:12:30,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:30,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-12 15:12:30,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 15:12:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 15:12:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-01-12 15:12:30,286 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 27 states. [2019-01-12 15:12:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:30,886 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-01-12 15:12:30,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 15:12:30,888 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 141 [2019-01-12 15:12:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:30,890 INFO L225 Difference]: With dead ends: 84 [2019-01-12 15:12:30,890 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 15:12:30,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 15:12:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 15:12:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 15:12:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 15:12:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-12 15:12:30,897 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-01-12 15:12:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:30,898 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-12 15:12:30,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 15:12:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-12 15:12:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-01-12 15:12:30,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:30,903 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:30,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-01-12 15:12:30,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:30,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-01-12 15:12:31,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:31,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:12:31,433 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-12 15:12:31,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:31,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-01-12 15:12:31,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:31,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-12 15:12:31,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 15:12:31,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 15:12:31,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:12:31,516 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 28 states. [2019-01-12 15:12:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:32,040 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-12 15:12:32,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 15:12:32,041 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 147 [2019-01-12 15:12:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:32,043 INFO L225 Difference]: With dead ends: 87 [2019-01-12 15:12:32,043 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 15:12:32,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 15:12:32,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 15:12:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 15:12:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 15:12:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-12 15:12:32,050 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-01-12 15:12:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:32,051 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-12 15:12:32,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 15:12:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-12 15:12:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-01-12 15:12:32,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:32,053 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:32,053 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-01-12 15:12:32,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:32,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:32,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:32,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-01-12 15:12:32,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:32,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:32,707 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:12:32,803 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-01-12 15:12:32,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:12:32,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-01-12 15:12:32,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:32,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-12 15:12:32,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 15:12:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 15:12:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-01-12 15:12:32,904 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 29 states. [2019-01-12 15:12:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:33,507 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-01-12 15:12:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 15:12:33,509 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 153 [2019-01-12 15:12:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:33,511 INFO L225 Difference]: With dead ends: 90 [2019-01-12 15:12:33,511 INFO L226 Difference]: Without dead ends: 86 [2019-01-12 15:12:33,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 15:12:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-12 15:12:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-12 15:12:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 15:12:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-01-12 15:12:33,521 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-01-12 15:12:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:33,522 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-01-12 15:12:33,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 15:12:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-01-12 15:12:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 15:12:33,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:33,528 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:33,528 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-01-12 15:12:33,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:33,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:33,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:12:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-01-12 15:12:35,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:12:35,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:12:35,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:35,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:12:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-01-12 15:12:36,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:12:36,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-01-12 15:12:36,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-12 15:12:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-12 15:12:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 15:12:36,061 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 55 states. [2019-01-12 15:12:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:37,785 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2019-01-12 15:12:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-12 15:12:37,786 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 159 [2019-01-12 15:12:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:37,788 INFO L225 Difference]: With dead ends: 93 [2019-01-12 15:12:37,788 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 15:12:37,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 158 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 15:12:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 15:12:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-12 15:12:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-12 15:12:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-12 15:12:37,797 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 159 [2019-01-12 15:12:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:37,797 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-12 15:12:37,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-12 15:12:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-12 15:12:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 15:12:37,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:12:37,802 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:12:37,802 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:12:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:12:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1468417367, now seen corresponding path program 26 times [2019-01-12 15:12:37,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:12:37,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:12:37,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:12:37,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:12:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:12:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2019-01-12 15:12:38,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:12:38,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-01-12 15:12:38,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 15:12:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 15:12:38,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2019-01-12 15:12:38,385 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 31 states. [2019-01-12 15:12:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:12:39,480 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2019-01-12 15:12:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 15:12:39,482 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 165 [2019-01-12 15:12:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:12:39,483 INFO L225 Difference]: With dead ends: 89 [2019-01-12 15:12:39,484 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:12:39,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 15:12:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:12:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:12:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:12:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:12:39,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-01-12 15:12:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:12:39,486 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:12:39,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 15:12:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:12:39,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:12:39,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:12:39,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:12:39,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:12:39,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:12:39,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2019-01-12 15:12:39,525 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-01-12 15:12:39,525 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2019-01-12 15:12:39,525 INFO L444 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: (and (<= ULTIMATE.start_main_~input~0 25) (<= 25 ULTIMATE.start_main_~input~0)) [2019-01-12 15:12:39,526 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-01-12 15:12:39,526 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 15) no Hoare annotation was computed. [2019-01-12 15:12:39,526 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2019-01-12 15:12:39,526 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2019-01-12 15:12:39,526 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2019-01-12 15:12:39,526 INFO L444 ceAbstractionStarter]: At program point L6(line 6) the Hoare annotation is: (and (<= |id_#in~x| id_~x) (<= id_~x |id_#in~x|)) [2019-01-12 15:12:39,526 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 15:12:39,527 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-01-12 15:12:39,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:12:39 BoogieIcfgContainer [2019-01-12 15:12:39,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:12:39,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:12:39,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:12:39,532 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:12:39,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:12:10" (3/4) ... [2019-01-12 15:12:39,536 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:12:39,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-01-12 15:12:39,553 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:12:39,553 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:12:39,615 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:12:39,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:12:39,616 INFO L168 Benchmark]: Toolchain (without parser) took 29345.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 255.9 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:39,620 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:39,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:39,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:39,624 INFO L168 Benchmark]: Boogie Preprocessor took 21.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:39,625 INFO L168 Benchmark]: RCFGBuilder took 318.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:39,626 INFO L168 Benchmark]: TraceAbstraction took 28559.34 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 316.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.3 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:39,627 INFO L168 Benchmark]: Witness Printer took 83.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:39,643 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.23 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.72 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.83 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 318.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28559.34 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 316.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -38.3 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. * Witness Printer took 83.65 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. SAFE Result, 28.4s OverallTime, 27 OverallIterations, 27 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 346 SDtfs, 783 SDslu, 4550 SDs, 0 SdLazy, 4030 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3339 GetRequests, 2528 SyntacticMatches, 2 SemanticMatches, 809 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=26, 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, 27 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 4524 NumberOfCodeBlocks, 4524 NumberOfCodeBlocksAsserted, 224 NumberOfCheckSat, 4472 ConstructedInterpolants, 0 QuantifiedInterpolants, 1352032 SizeOfPredicates, 349 NumberOfNonLiveVariables, 5125 ConjunctsInSsa, 803 ConjunctsInUnsatCore, 52 InterpolantComputations, 2 PerfectInterpolantSequences, 18954/35854 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...