./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.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/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.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 17da727b994aaa75d870178ca09f053b93a70f18 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:25:12,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:25:12,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:25:12,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:25:12,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:25:12,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:25:12,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:25:12,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:25:12,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:25:12,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:25:12,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:25:12,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:25:12,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:25:12,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:25:12,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:25:12,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:25:12,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:25:12,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:25:12,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:25:12,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:25:12,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:25:12,449 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:25:12,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:25:12,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:25:12,452 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:25:12,453 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:25:12,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:25:12,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:25:12,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:25:12,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:25:12,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:25:12,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:25:12,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:25:12,457 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:25:12,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:25:12,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:25:12,459 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:25:12,474 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:25:12,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:25:12,475 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:25:12,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:25:12,476 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:25:12,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:25:12,476 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:25:12,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:25:12,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:25:12,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:25:12,477 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:25:12,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:25:12,477 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:25:12,477 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:25:12,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:25:12,478 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:25:12,478 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:25:12,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:25:12,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:25:12,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:25:12,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:25:12,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:25:12,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:25:12,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:25:12,479 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:25:12,479 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:25:12,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:25:12,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:25:12,480 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 -> 17da727b994aaa75d870178ca09f053b93a70f18 [2019-01-12 11:25:12,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:25:12,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:25:12,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:25:12,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:25:12,546 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:25:12,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2019-01-12 11:25:12,606 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11758965/2ab271e30cd0418c8674b2d709309149/FLAG157e4c19b [2019-01-12 11:25:12,996 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:25:12,996 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2019-01-12 11:25:13,004 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11758965/2ab271e30cd0418c8674b2d709309149/FLAG157e4c19b [2019-01-12 11:25:13,376 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d11758965/2ab271e30cd0418c8674b2d709309149 [2019-01-12 11:25:13,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:25:13,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:25:13,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:25:13,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:25:13,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:25:13,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c23ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13, skipping insertion in model container [2019-01-12 11:25:13,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:25:13,422 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:25:13,621 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:25:13,630 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:25:13,670 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:25:13,693 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:25:13,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13 WrapperNode [2019-01-12 11:25:13,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:25:13,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:25:13,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:25:13,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:25:13,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:25:13,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:25:13,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:25:13,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:25:13,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... [2019-01-12 11:25:13,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:25:13,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:25:13,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:25:13,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:25:13,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:25:13,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:25:13,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:25:14,380 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:25:14,381 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:25:14,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:25:14 BoogieIcfgContainer [2019-01-12 11:25:14,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:25:14,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:25:14,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:25:14,386 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:25:14,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:25:13" (1/3) ... [2019-01-12 11:25:14,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37221c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:25:14, skipping insertion in model container [2019-01-12 11:25:14,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:25:13" (2/3) ... [2019-01-12 11:25:14,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37221c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:25:14, skipping insertion in model container [2019-01-12 11:25:14,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:25:14" (3/3) ... [2019-01-12 11:25:14,389 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+lhb-reducer.c [2019-01-12 11:25:14,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:25:14,405 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:25:14,420 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:25:14,449 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:25:14,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:25:14,450 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:25:14,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:25:14,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:25:14,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:25:14,451 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:25:14,451 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:25:14,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:25:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 11:25:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:14,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:14,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:14,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:14,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1745867070, now seen corresponding path program 1 times [2019-01-12 11:25:14,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:14,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:14,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:14,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:14,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:25:14,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:25:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:25:14,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:14,652 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-01-12 11:25:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:14,877 INFO L93 Difference]: Finished difference Result 52 states and 90 transitions. [2019-01-12 11:25:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:25:14,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 11:25:14,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:14,892 INFO L225 Difference]: With dead ends: 52 [2019-01-12 11:25:14,892 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 11:25:14,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 11:25:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 11:25:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 11:25:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-01-12 11:25:14,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 23 [2019-01-12 11:25:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:14,938 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-12 11:25:14,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:25:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-01-12 11:25:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:14,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:14,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:14,940 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -936932661, now seen corresponding path program 1 times [2019-01-12 11:25:14,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:14,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:14,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:15,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:15,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:25:15,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:25:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:25:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:25:15,032 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2019-01-12 11:25:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:15,305 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2019-01-12 11:25:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:25:15,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-12 11:25:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:15,306 INFO L225 Difference]: With dead ends: 44 [2019-01-12 11:25:15,306 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 11:25:15,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:25:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 11:25:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 11:25:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 11:25:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-12 11:25:15,313 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 23 [2019-01-12 11:25:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:15,313 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-12 11:25:15,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:25:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-01-12 11:25:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:15,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:15,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:15,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:15,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:15,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2008089875, now seen corresponding path program 1 times [2019-01-12 11:25:15,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:15,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:15,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:15,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:25:15,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:25:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:25:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:15,354 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2019-01-12 11:25:15,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:15,567 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2019-01-12 11:25:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:25:15,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 11:25:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:15,569 INFO L225 Difference]: With dead ends: 54 [2019-01-12 11:25:15,570 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 11:25:15,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 11:25:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 11:25:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 11:25:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2019-01-12 11:25:15,579 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 23 [2019-01-12 11:25:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:15,580 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-01-12 11:25:15,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:25:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2019-01-12 11:25:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:15,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:15,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:15,581 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash 635511084, now seen corresponding path program 1 times [2019-01-12 11:25:15,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:15,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:15,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:15,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:15,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:25:15,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:25:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:25:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:25:15,709 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 6 states. [2019-01-12 11:25:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:15,843 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-01-12 11:25:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:25:15,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 11:25:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:15,844 INFO L225 Difference]: With dead ends: 52 [2019-01-12 11:25:15,844 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 11:25:15,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:25:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 11:25:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 11:25:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 11:25:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-01-12 11:25:15,851 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 23 [2019-01-12 11:25:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:15,851 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-12 11:25:15,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:25:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-01-12 11:25:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:15,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:15,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:15,852 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 602818777, now seen corresponding path program 1 times [2019-01-12 11:25:15,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:15,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:16,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:16,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:25:16,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:25:16,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:25:16,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:25:16,285 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2019-01-12 11:25:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:16,470 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-01-12 11:25:16,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:25:16,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-01-12 11:25:16,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:16,472 INFO L225 Difference]: With dead ends: 44 [2019-01-12 11:25:16,472 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 11:25:16,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:25:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 11:25:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-12 11:25:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 11:25:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-12 11:25:16,478 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2019-01-12 11:25:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:16,478 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-01-12 11:25:16,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:25:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-01-12 11:25:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:16,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:16,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:16,480 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -218545361, now seen corresponding path program 1 times [2019-01-12 11:25:16,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:16,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:16,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:25:16,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:25:16,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:25:16,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:16,515 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2019-01-12 11:25:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:16,615 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-01-12 11:25:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:25:16,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 11:25:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:16,617 INFO L225 Difference]: With dead ends: 34 [2019-01-12 11:25:16,617 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 11:25:16,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:25:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 11:25:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-12 11:25:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 11:25:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-12 11:25:16,623 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2019-01-12 11:25:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:16,623 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-12 11:25:16,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:25:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-01-12 11:25:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:25:16,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:16,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:16,625 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:16,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash -217919750, now seen corresponding path program 1 times [2019-01-12 11:25:16,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:16,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:16,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:16,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 11:25:16,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 11:25:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 11:25:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:25:16,760 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 11 states. [2019-01-12 11:25:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:16,925 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-12 11:25:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 11:25:16,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-12 11:25:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:16,928 INFO L225 Difference]: With dead ends: 36 [2019-01-12 11:25:16,928 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 11:25:16,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:25:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 11:25:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 11:25:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 11:25:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-12 11:25:16,933 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2019-01-12 11:25:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:16,933 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-12 11:25:16,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 11:25:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-12 11:25:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 11:25:16,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:16,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:16,935 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash 423767145, now seen corresponding path program 1 times [2019-01-12 11:25:16,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:16,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:17,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:25:17,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 11:25:17,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 11:25:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 11:25:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:25:17,185 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 12 states. [2019-01-12 11:25:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:17,417 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-12 11:25:17,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 11:25:17,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-01-12 11:25:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:17,419 INFO L225 Difference]: With dead ends: 34 [2019-01-12 11:25:17,419 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 11:25:17,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:25:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 11:25:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 11:25:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 11:25:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 11:25:17,424 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2019-01-12 11:25:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:17,425 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 11:25:17,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 11:25:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 11:25:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 11:25:17,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:17,426 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:17,426 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash -875092666, now seen corresponding path program 1 times [2019-01-12 11:25:17,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:17,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:17,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:17,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:17,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:17,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:17,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:17,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:17,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 11:25:17,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 11:25:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 11:25:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:25:17,701 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 13 states. [2019-01-12 11:25:18,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:18,369 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-12 11:25:18,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 11:25:18,373 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-12 11:25:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:18,373 INFO L225 Difference]: With dead ends: 36 [2019-01-12 11:25:18,374 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 11:25:18,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:25:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 11:25:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-12 11:25:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 11:25:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-12 11:25:18,378 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-01-12 11:25:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:18,379 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-12 11:25:18,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 11:25:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-12 11:25:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 11:25:18,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:18,380 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:18,380 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:18,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash 756112099, now seen corresponding path program 2 times [2019-01-12 11:25:18,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:18,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:18,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:18,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:18,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:18,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:18,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:18,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:18,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:18,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:18,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 11:25:18,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 11:25:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 11:25:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:25:18,648 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 14 states. [2019-01-12 11:25:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:18,773 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-12 11:25:18,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 11:25:18,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-01-12 11:25:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:18,775 INFO L225 Difference]: With dead ends: 38 [2019-01-12 11:25:18,775 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 11:25:18,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:25:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 11:25:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-12 11:25:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 11:25:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-12 11:25:18,782 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-01-12 11:25:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:18,782 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-12 11:25:18,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 11:25:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-12 11:25:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 11:25:18,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:18,783 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:18,783 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash 680828224, now seen corresponding path program 3 times [2019-01-12 11:25:18,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:18,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:18,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:25:19,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:19,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:19,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:19,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 11:25:19,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:19,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 11:25:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-01-12 11:25:19,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 11:25:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 11:25:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:25:19,126 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-12 11:25:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:19,349 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-01-12 11:25:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 11:25:19,352 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-12 11:25:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:19,354 INFO L225 Difference]: With dead ends: 42 [2019-01-12 11:25:19,354 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 11:25:19,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:25:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 11:25:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-01-12 11:25:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 11:25:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-12 11:25:19,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 31 [2019-01-12 11:25:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:19,360 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-12 11:25:19,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 11:25:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-12 11:25:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 11:25:19,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:19,361 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:19,362 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2124419607, now seen corresponding path program 4 times [2019-01-12 11:25:19,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:19,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:25:19,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:19,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:19,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:19,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:19,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:19,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:25:19,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:19,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 11:25:19,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 11:25:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 11:25:19,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:25:19,703 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2019-01-12 11:25:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:19,934 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-01-12 11:25:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 11:25:19,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-01-12 11:25:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:19,937 INFO L225 Difference]: With dead ends: 44 [2019-01-12 11:25:19,937 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 11:25:19,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-12 11:25:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 11:25:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 11:25:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 11:25:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 11:25:19,942 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2019-01-12 11:25:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:19,943 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 11:25:19,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 11:25:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 11:25:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 11:25:19,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:19,944 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:19,944 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 516774580, now seen corresponding path program 5 times [2019-01-12 11:25:19,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:19,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:19,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:25:20,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:20,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:20,164 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:20,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-12 11:25:20,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:20,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 11:25:20,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:20,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6] total 21 [2019-01-12 11:25:20,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 11:25:20,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 11:25:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:25:20,302 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 21 states. [2019-01-12 11:25:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:20,650 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-01-12 11:25:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 11:25:20,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2019-01-12 11:25:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:20,652 INFO L225 Difference]: With dead ends: 51 [2019-01-12 11:25:20,652 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 11:25:20,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-01-12 11:25:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 11:25:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-01-12 11:25:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 11:25:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 11:25:20,658 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 37 [2019-01-12 11:25:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:20,659 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 11:25:20,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 11:25:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 11:25:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 11:25:20,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:20,660 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:20,660 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2055346949, now seen corresponding path program 6 times [2019-01-12 11:25:20,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:20,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:20,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:20,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:25:20,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:20,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:21,004 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-01-12 11:25:21,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:21,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:25:21,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:21,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 11:25:21,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 11:25:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 11:25:21,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:25:21,065 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 18 states. [2019-01-12 11:25:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:21,498 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-01-12 11:25:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 11:25:21,499 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-01-12 11:25:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:21,500 INFO L225 Difference]: With dead ends: 56 [2019-01-12 11:25:21,500 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 11:25:21,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-12 11:25:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 11:25:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-12 11:25:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 11:25:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-01-12 11:25:21,508 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 43 [2019-01-12 11:25:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:21,509 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-01-12 11:25:21,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 11:25:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-01-12 11:25:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 11:25:21,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:21,510 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:21,510 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash -891324766, now seen corresponding path program 7 times [2019-01-12 11:25:21,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:21,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:21,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:25:21,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:21,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:21,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:25:21,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:21,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 11:25:21,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 11:25:21,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 11:25:21,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:25:21,788 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 19 states. [2019-01-12 11:25:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:21,936 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-01-12 11:25:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 11:25:21,938 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2019-01-12 11:25:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:21,939 INFO L225 Difference]: With dead ends: 58 [2019-01-12 11:25:21,939 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 11:25:21,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-01-12 11:25:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 11:25:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-12 11:25:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-12 11:25:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-12 11:25:21,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2019-01-12 11:25:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:21,945 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-12 11:25:21,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 11:25:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-12 11:25:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 11:25:21,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:21,946 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:21,946 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:21,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2035572479, now seen corresponding path program 8 times [2019-01-12 11:25:21,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:21,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:25:22,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:22,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:22,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:22,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:22,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:22,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 11:25:22,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:22,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-01-12 11:25:22,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 11:25:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 11:25:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:25:22,478 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 26 states. [2019-01-12 11:25:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:23,087 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-12 11:25:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 11:25:23,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2019-01-12 11:25:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:23,089 INFO L225 Difference]: With dead ends: 65 [2019-01-12 11:25:23,089 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 11:25:23,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:25:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 11:25:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-01-12 11:25:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-12 11:25:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-01-12 11:25:23,096 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 47 [2019-01-12 11:25:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:23,096 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-01-12 11:25:23,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 11:25:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-01-12 11:25:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 11:25:23,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:23,097 INFO L402 BasicCegarLoop]: trace histogram [15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:23,098 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:23,098 INFO L82 PathProgramCache]: Analyzing trace with hash 512283024, now seen corresponding path program 9 times [2019-01-12 11:25:23,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-12 11:25:23,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:23,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:23,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:23,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-12 11:25:23,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:23,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 117 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 11:25:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2019-01-12 11:25:23,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 11:25:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 11:25:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-12 11:25:23,643 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 28 states. [2019-01-12 11:25:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:23,874 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-12 11:25:23,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 11:25:23,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-01-12 11:25:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:23,876 INFO L225 Difference]: With dead ends: 73 [2019-01-12 11:25:23,876 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 11:25:23,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-12 11:25:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 11:25:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-01-12 11:25:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-12 11:25:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-01-12 11:25:23,881 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2019-01-12 11:25:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:23,882 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-01-12 11:25:23,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 11:25:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-01-12 11:25:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 11:25:23,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:23,883 INFO L402 BasicCegarLoop]: trace histogram [17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:23,883 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:23,883 INFO L82 PathProgramCache]: Analyzing trace with hash 632258215, now seen corresponding path program 10 times [2019-01-12 11:25:23,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:23,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:23,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:23,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 143 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 11:25:24,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:24,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:24,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:24,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:24,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:24,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 143 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 11:25:24,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:24,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 11:25:24,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 11:25:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 11:25:24,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:25:24,307 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 22 states. [2019-01-12 11:25:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:24,578 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-01-12 11:25:24,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 11:25:24,579 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-01-12 11:25:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:24,579 INFO L225 Difference]: With dead ends: 76 [2019-01-12 11:25:24,580 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 11:25:24,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-12 11:25:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 11:25:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-12 11:25:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 11:25:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-12 11:25:24,584 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2019-01-12 11:25:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:24,585 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-12 11:25:24,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 11:25:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-12 11:25:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 11:25:24,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:24,586 INFO L402 BasicCegarLoop]: trace histogram [18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:24,586 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 698467204, now seen corresponding path program 11 times [2019-01-12 11:25:24,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:24,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 11:25:24,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:24,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:24,879 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:24,914 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-01-12 11:25:24,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:24,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 11:25:25,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:25,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11] total 32 [2019-01-12 11:25:25,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 11:25:25,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 11:25:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:25:25,192 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 32 states. [2019-01-12 11:25:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:25,364 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-12 11:25:25,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 11:25:25,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2019-01-12 11:25:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:25,366 INFO L225 Difference]: With dead ends: 83 [2019-01-12 11:25:25,366 INFO L226 Difference]: Without dead ends: 67 [2019-01-12 11:25:25,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:25:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-12 11:25:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-12 11:25:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 11:25:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-01-12 11:25:25,372 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 59 [2019-01-12 11:25:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:25,373 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-01-12 11:25:25,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 11:25:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-01-12 11:25:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 11:25:25,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:25,374 INFO L402 BasicCegarLoop]: trace histogram [21, 12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:25,374 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:25,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:25,374 INFO L82 PathProgramCache]: Analyzing trace with hash 486303765, now seen corresponding path program 12 times [2019-01-12 11:25:25,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:25,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:25,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:25,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 221 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:25,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:25,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:25,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:25,791 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-01-12 11:25:25,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:25,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 221 proven. 156 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:25,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:25,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 11:25:25,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 11:25:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 11:25:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:25:25,843 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 24 states. [2019-01-12 11:25:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:26,237 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-01-12 11:25:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 11:25:26,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-01-12 11:25:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:26,240 INFO L225 Difference]: With dead ends: 88 [2019-01-12 11:25:26,240 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 11:25:26,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-12 11:25:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 11:25:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 11:25:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 11:25:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 11:25:26,247 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2019-01-12 11:25:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:26,247 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 11:25:26,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 11:25:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 11:25:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-12 11:25:26,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:26,248 INFO L402 BasicCegarLoop]: trace histogram [22, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:26,248 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 998146034, now seen corresponding path program 13 times [2019-01-12 11:25:26,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:26,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 238 proven. 182 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:26,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:26,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:26,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:26,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 238 proven. 182 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:26,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:26,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 11:25:26,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 11:25:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 11:25:26,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-01-12 11:25:26,955 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 25 states. [2019-01-12 11:25:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:27,158 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-12 11:25:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 11:25:27,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2019-01-12 11:25:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:27,160 INFO L225 Difference]: With dead ends: 90 [2019-01-12 11:25:27,160 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 11:25:27,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-01-12 11:25:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 11:25:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-12 11:25:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 11:25:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-01-12 11:25:27,166 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 67 [2019-01-12 11:25:27,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:27,166 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-01-12 11:25:27,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 11:25:27,167 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-01-12 11:25:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 11:25:27,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:27,167 INFO L402 BasicCegarLoop]: trace histogram [23, 14, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:27,168 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1042672497, now seen corresponding path program 14 times [2019-01-12 11:25:27,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 255 proven. 210 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:28,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:28,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:28,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:28,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:28,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:28,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 255 proven. 210 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:28,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:28,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-12 11:25:28,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 11:25:28,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 11:25:28,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:25:28,300 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 26 states. [2019-01-12 11:25:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:28,497 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-01-12 11:25:28,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 11:25:28,498 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2019-01-12 11:25:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:28,499 INFO L225 Difference]: With dead ends: 92 [2019-01-12 11:25:28,499 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 11:25:28,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-12 11:25:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 11:25:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-12 11:25:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 11:25:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-12 11:25:28,505 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2019-01-12 11:25:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:28,505 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-12 11:25:28,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 11:25:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-12 11:25:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-12 11:25:28,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:28,506 INFO L402 BasicCegarLoop]: trace histogram [24, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:28,506 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:28,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash 530773484, now seen corresponding path program 15 times [2019-01-12 11:25:28,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:28,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:28,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:28,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 11:25:28,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:28,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:28,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:28,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-12 11:25:28,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:28,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 285 proven. 81 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-12 11:25:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 12] total 37 [2019-01-12 11:25:29,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 11:25:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 11:25:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:25:29,874 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-12 11:25:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:30,085 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-12 11:25:30,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 11:25:30,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-12 11:25:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:30,087 INFO L225 Difference]: With dead ends: 97 [2019-01-12 11:25:30,087 INFO L226 Difference]: Without dead ends: 77 [2019-01-12 11:25:30,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:25:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-12 11:25:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-01-12 11:25:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 11:25:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-12 11:25:30,091 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2019-01-12 11:25:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:30,092 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-12 11:25:30,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 11:25:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-12 11:25:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 11:25:30,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:30,093 INFO L402 BasicCegarLoop]: trace histogram [26, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:30,093 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:30,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1675169475, now seen corresponding path program 16 times [2019-01-12 11:25:30,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:30,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:30,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:30,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:30,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 323 proven. 272 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 11:25:30,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:30,549 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 11:25:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:30,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:30,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:30,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 323 proven. 272 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 11:25:30,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:30,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-12 11:25:30,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 11:25:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 11:25:30,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-12 11:25:30,614 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 28 states. [2019-01-12 11:25:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:30,780 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-01-12 11:25:30,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 11:25:30,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 75 [2019-01-12 11:25:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:30,782 INFO L225 Difference]: With dead ends: 100 [2019-01-12 11:25:30,783 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 11:25:30,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-12 11:25:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 11:25:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-12 11:25:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 11:25:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2019-01-12 11:25:30,787 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2019-01-12 11:25:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2019-01-12 11:25:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 11:25:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2019-01-12 11:25:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 11:25:30,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:30,788 INFO L402 BasicCegarLoop]: trace histogram [27, 17, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:30,789 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -581388704, now seen corresponding path program 17 times [2019-01-12 11:25:30,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:30,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 11:25:31,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:31,146 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 11:25:31,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:31,188 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-01-12 11:25:31,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:31,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 169 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-01-12 11:25:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:31,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 43 [2019-01-12 11:25:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-12 11:25:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-12 11:25:31,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:25:31,571 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 43 states. [2019-01-12 11:25:31,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:31,791 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-01-12 11:25:31,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 11:25:31,793 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 77 [2019-01-12 11:25:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:31,794 INFO L225 Difference]: With dead ends: 111 [2019-01-12 11:25:31,794 INFO L226 Difference]: Without dead ends: 89 [2019-01-12 11:25:31,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:25:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-12 11:25:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-01-12 11:25:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 11:25:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-12 11:25:31,799 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2019-01-12 11:25:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:31,800 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-12 11:25:31,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-12 11:25:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-12 11:25:31,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 11:25:31,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:31,801 INFO L402 BasicCegarLoop]: trace histogram [32, 18, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:31,801 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:31,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:31,801 INFO L82 PathProgramCache]: Analyzing trace with hash -467322203, now seen corresponding path program 18 times [2019-01-12 11:25:31,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:31,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:31,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 513 proven. 342 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-01-12 11:25:32,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:32,265 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 11:25:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:32,313 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2019-01-12 11:25:32,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:32,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 527 proven. 225 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-01-12 11:25:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 46 [2019-01-12 11:25:32,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-12 11:25:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-12 11:25:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:25:32,879 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 46 states. [2019-01-12 11:25:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:33,166 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-12 11:25:33,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-12 11:25:33,168 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 87 [2019-01-12 11:25:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:33,169 INFO L225 Difference]: With dead ends: 125 [2019-01-12 11:25:33,170 INFO L226 Difference]: Without dead ends: 95 [2019-01-12 11:25:33,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:25:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-12 11:25:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-01-12 11:25:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 11:25:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-01-12 11:25:33,175 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 87 [2019-01-12 11:25:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:33,176 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-01-12 11:25:33,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-12 11:25:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-01-12 11:25:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 11:25:33,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:33,177 INFO L402 BasicCegarLoop]: trace histogram [35, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:33,177 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1219770058, now seen corresponding path program 19 times [2019-01-12 11:25:33,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:33,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 620 proven. 380 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-12 11:25:33,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:33,980 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 11:25:33,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:34,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 620 proven. 380 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-12 11:25:34,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:34,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-01-12 11:25:34,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 11:25:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 11:25:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-12 11:25:34,059 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 31 states. [2019-01-12 11:25:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:34,222 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-01-12 11:25:34,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 11:25:34,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2019-01-12 11:25:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:34,225 INFO L225 Difference]: With dead ends: 130 [2019-01-12 11:25:34,225 INFO L226 Difference]: Without dead ends: 96 [2019-01-12 11:25:34,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-01-12 11:25:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-12 11:25:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-12 11:25:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-12 11:25:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-12 11:25:34,236 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2019-01-12 11:25:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:34,236 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-12 11:25:34,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 11:25:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-12 11:25:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 11:25:34,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:34,237 INFO L402 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:34,237 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1236425837, now seen corresponding path program 20 times [2019-01-12 11:25:34,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 651 proven. 420 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-12 11:25:35,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:35,014 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 11:25:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:35,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:35,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:35,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 651 proven. 420 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-12 11:25:35,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:35,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-12 11:25:35,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 11:25:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 11:25:35,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:25:35,095 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 32 states. [2019-01-12 11:25:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:35,261 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-12 11:25:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 11:25:35,262 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 95 [2019-01-12 11:25:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:35,263 INFO L225 Difference]: With dead ends: 132 [2019-01-12 11:25:35,263 INFO L226 Difference]: Without dead ends: 98 [2019-01-12 11:25:35,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-12 11:25:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-12 11:25:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-12 11:25:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-12 11:25:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-01-12 11:25:35,269 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 95 [2019-01-12 11:25:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:35,269 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-01-12 11:25:35,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 11:25:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-01-12 11:25:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 11:25:35,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:35,270 INFO L402 BasicCegarLoop]: trace histogram [37, 21, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:35,271 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash -62760272, now seen corresponding path program 21 times [2019-01-12 11:25:35,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:35,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 682 proven. 462 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-01-12 11:25:35,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:35,878 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 11:25:35,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:35,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-12 11:25:35,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:35,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 693 proven. 256 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-01-12 11:25:36,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:36,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2019-01-12 11:25:36,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 11:25:36,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 11:25:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 11:25:36,477 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 50 states. [2019-01-12 11:25:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:37,086 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2019-01-12 11:25:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-12 11:25:37,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-01-12 11:25:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:37,088 INFO L225 Difference]: With dead ends: 137 [2019-01-12 11:25:37,089 INFO L226 Difference]: Without dead ends: 103 [2019-01-12 11:25:37,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 11:25:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-12 11:25:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-12 11:25:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 11:25:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-01-12 11:25:37,096 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 97 [2019-01-12 11:25:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:37,097 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-01-12 11:25:37,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 11:25:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-01-12 11:25:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 11:25:37,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:37,098 INFO L402 BasicCegarLoop]: trace histogram [39, 22, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:37,098 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 889014343, now seen corresponding path program 22 times [2019-01-12 11:25:37,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:37,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:37,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 759 proven. 506 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-01-12 11:25:37,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:37,616 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 11:25:37,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:37,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:37,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:37,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 759 proven. 506 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-01-12 11:25:37,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:37,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-12 11:25:37,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-12 11:25:37,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-12 11:25:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 11:25:37,694 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 34 states. [2019-01-12 11:25:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:37,875 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2019-01-12 11:25:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-12 11:25:37,876 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 101 [2019-01-12 11:25:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:37,878 INFO L225 Difference]: With dead ends: 140 [2019-01-12 11:25:37,878 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 11:25:37,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 11:25:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 11:25:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 11:25:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 11:25:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-12 11:25:37,884 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 101 [2019-01-12 11:25:37,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:37,884 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-12 11:25:37,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-12 11:25:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-12 11:25:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 11:25:37,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:37,885 INFO L402 BasicCegarLoop]: trace histogram [40, 23, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:37,885 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash -966691420, now seen corresponding path program 23 times [2019-01-12 11:25:37,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:37,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:37,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 792 proven. 552 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-01-12 11:25:38,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:38,369 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 11:25:38,380 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:38,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-01-12 11:25:38,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:38,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 819 proven. 361 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-01-12 11:25:39,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:39,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22] total 55 [2019-01-12 11:25:39,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-12 11:25:39,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-12 11:25:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 11:25:39,183 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 55 states. [2019-01-12 11:25:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:40,460 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2019-01-12 11:25:40,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-12 11:25:40,461 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2019-01-12 11:25:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:40,462 INFO L225 Difference]: With dead ends: 149 [2019-01-12 11:25:40,462 INFO L226 Difference]: Without dead ends: 113 [2019-01-12 11:25:40,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 11:25:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-12 11:25:40,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-01-12 11:25:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-12 11:25:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-01-12 11:25:40,471 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 103 [2019-01-12 11:25:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:40,471 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-01-12 11:25:40,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-12 11:25:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-01-12 11:25:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 11:25:40,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:40,477 INFO L402 BasicCegarLoop]: trace histogram [44, 24, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:40,480 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:40,480 INFO L82 PathProgramCache]: Analyzing trace with hash 97170031, now seen corresponding path program 24 times [2019-01-12 11:25:40,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:40,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:40,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 975 proven. 600 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 11:25:44,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:44,191 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 11:25:44,202 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:44,260 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2019-01-12 11:25:44,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:44,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 989 proven. 441 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-01-12 11:25:45,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 24] total 58 [2019-01-12 11:25:45,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-12 11:25:45,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-12 11:25:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 11:25:45,370 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 58 states. [2019-01-12 11:25:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:45,637 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-12 11:25:45,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-12 11:25:45,638 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 111 [2019-01-12 11:25:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:45,640 INFO L225 Difference]: With dead ends: 161 [2019-01-12 11:25:45,640 INFO L226 Difference]: Without dead ends: 119 [2019-01-12 11:25:45,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 11:25:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-12 11:25:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-01-12 11:25:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-12 11:25:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-01-12 11:25:45,649 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2019-01-12 11:25:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:45,650 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-01-12 11:25:45,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-12 11:25:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-01-12 11:25:45,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 11:25:45,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:45,653 INFO L402 BasicCegarLoop]: trace histogram [47, 25, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:45,654 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:45,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1144748800, now seen corresponding path program 25 times [2019-01-12 11:25:45,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:45,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1118 proven. 650 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-01-12 11:25:46,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:46,413 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 11:25:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:46,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1118 proven. 650 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-01-12 11:25:46,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-01-12 11:25:46,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 11:25:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 11:25:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:25:46,503 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 37 states. [2019-01-12 11:25:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:46,738 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2019-01-12 11:25:46,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 11:25:46,739 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 117 [2019-01-12 11:25:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:46,741 INFO L225 Difference]: With dead ends: 166 [2019-01-12 11:25:46,741 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 11:25:46,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 11:25:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 11:25:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 11:25:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 11:25:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2019-01-12 11:25:46,747 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2019-01-12 11:25:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:46,747 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2019-01-12 11:25:46,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 11:25:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2019-01-12 11:25:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 11:25:46,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:46,748 INFO L402 BasicCegarLoop]: trace histogram [48, 26, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:46,749 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash 786716765, now seen corresponding path program 26 times [2019-01-12 11:25:46,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:46,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:46,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1161 proven. 702 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-01-12 11:25:47,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:47,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:47,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:47,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:47,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1161 proven. 702 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-01-12 11:25:47,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:47,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-12 11:25:47,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-12 11:25:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-12 11:25:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 11:25:47,517 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 38 states. [2019-01-12 11:25:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:47,775 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-01-12 11:25:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-12 11:25:47,776 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 119 [2019-01-12 11:25:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:47,778 INFO L225 Difference]: With dead ends: 168 [2019-01-12 11:25:47,778 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 11:25:47,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 11:25:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 11:25:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-01-12 11:25:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-12 11:25:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-01-12 11:25:47,786 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 119 [2019-01-12 11:25:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:47,786 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-01-12 11:25:47,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-12 11:25:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-01-12 11:25:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 11:25:47,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:47,790 INFO L402 BasicCegarLoop]: trace histogram [49, 27, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:47,790 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:47,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1499252858, now seen corresponding path program 27 times [2019-01-12 11:25:47,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:47,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:47,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1204 proven. 756 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-01-12 11:25:48,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:48,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:48,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:25:48,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-12 11:25:48,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:48,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1215 proven. 484 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-01-12 11:25:49,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:49,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 25] total 62 [2019-01-12 11:25:49,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-12 11:25:49,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-12 11:25:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-12 11:25:49,429 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 62 states. [2019-01-12 11:25:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:49,972 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2019-01-12 11:25:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-12 11:25:49,973 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-01-12 11:25:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:49,974 INFO L225 Difference]: With dead ends: 173 [2019-01-12 11:25:49,974 INFO L226 Difference]: Without dead ends: 127 [2019-01-12 11:25:49,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-12 11:25:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-12 11:25:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-01-12 11:25:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-12 11:25:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2019-01-12 11:25:49,981 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 121 [2019-01-12 11:25:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:49,981 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2019-01-12 11:25:49,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-12 11:25:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2019-01-12 11:25:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 11:25:49,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:49,982 INFO L402 BasicCegarLoop]: trace histogram [51, 28, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:49,983 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -818764655, now seen corresponding path program 28 times [2019-01-12 11:25:49,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:49,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:49,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1305 proven. 812 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-01-12 11:25:50,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:50,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:50,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:25:50,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:25:50,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:50,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1305 proven. 812 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-01-12 11:25:50,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:50,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-12 11:25:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-12 11:25:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-12 11:25:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 11:25:50,805 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 40 states. [2019-01-12 11:25:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:51,021 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2019-01-12 11:25:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 11:25:51,022 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 125 [2019-01-12 11:25:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:51,024 INFO L225 Difference]: With dead ends: 176 [2019-01-12 11:25:51,024 INFO L226 Difference]: Without dead ends: 128 [2019-01-12 11:25:51,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 11:25:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-12 11:25:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-01-12 11:25:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 11:25:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2019-01-12 11:25:51,030 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 125 [2019-01-12 11:25:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:51,030 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2019-01-12 11:25:51,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-12 11:25:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2019-01-12 11:25:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-12 11:25:51,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:51,031 INFO L402 BasicCegarLoop]: trace histogram [52, 29, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:51,031 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:51,031 INFO L82 PathProgramCache]: Analyzing trace with hash -139736338, now seen corresponding path program 29 times [2019-01-12 11:25:51,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:51,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:51,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:51,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:51,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1350 proven. 870 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-01-12 11:25:51,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:51,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:51,786 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:25:51,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-01-12 11:25:51,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:51,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1377 proven. 625 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2019-01-12 11:25:52,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:52,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 28] total 67 [2019-01-12 11:25:52,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-12 11:25:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-12 11:25:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-01-12 11:25:52,845 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 67 states. [2019-01-12 11:25:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:53,143 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-01-12 11:25:53,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-12 11:25:53,144 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 127 [2019-01-12 11:25:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:53,146 INFO L225 Difference]: With dead ends: 185 [2019-01-12 11:25:53,146 INFO L226 Difference]: Without dead ends: 137 [2019-01-12 11:25:53,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-01-12 11:25:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-12 11:25:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-12 11:25:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-12 11:25:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-01-12 11:25:53,152 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 127 [2019-01-12 11:25:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:53,153 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-01-12 11:25:53,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-12 11:25:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-01-12 11:25:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 11:25:53,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:53,154 INFO L402 BasicCegarLoop]: trace histogram [56, 30, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:53,154 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:53,154 INFO L82 PathProgramCache]: Analyzing trace with hash 651845945, now seen corresponding path program 30 times [2019-01-12 11:25:53,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:53,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:53,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:53,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1581 proven. 930 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-01-12 11:25:54,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:54,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:54,640 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:25:54,721 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2019-01-12 11:25:54,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:54,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1595 proven. 729 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2019-01-12 11:25:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:56,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 30] total 70 [2019-01-12 11:25:56,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-12 11:25:56,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-12 11:25:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-12 11:25:56,190 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 70 states. [2019-01-12 11:25:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:57,374 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2019-01-12 11:25:57,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-12 11:25:57,375 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 135 [2019-01-12 11:25:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:57,377 INFO L225 Difference]: With dead ends: 197 [2019-01-12 11:25:57,377 INFO L226 Difference]: Without dead ends: 143 [2019-01-12 11:25:57,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-12 11:25:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-12 11:25:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-01-12 11:25:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-12 11:25:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-01-12 11:25:57,385 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 135 [2019-01-12 11:25:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:57,385 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-01-12 11:25:57,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-12 11:25:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-01-12 11:25:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-12 11:25:57,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:57,388 INFO L402 BasicCegarLoop]: trace histogram [59, 31, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:57,388 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1792604106, now seen corresponding path program 31 times [2019-01-12 11:25:57,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:57,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:57,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1760 proven. 992 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-01-12 11:25:58,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:58,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:58,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:58,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1760 proven. 992 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-01-12 11:25:58,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:58,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-12 11:25:58,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-12 11:25:58,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-12 11:25:58,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:25:58,196 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 43 states. [2019-01-12 11:25:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:58,468 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2019-01-12 11:25:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 11:25:58,469 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 141 [2019-01-12 11:25:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:58,471 INFO L225 Difference]: With dead ends: 202 [2019-01-12 11:25:58,471 INFO L226 Difference]: Without dead ends: 144 [2019-01-12 11:25:58,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:25:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-12 11:25:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-01-12 11:25:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-12 11:25:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2019-01-12 11:25:58,477 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2019-01-12 11:25:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:58,478 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2019-01-12 11:25:58,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-12 11:25:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2019-01-12 11:25:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-12 11:25:58,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:58,479 INFO L402 BasicCegarLoop]: trace histogram [60, 32, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:58,479 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash 100385831, now seen corresponding path program 32 times [2019-01-12 11:25:58,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:58,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:58,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:58,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:25:58,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:25:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1815 proven. 1056 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-01-12 11:25:59,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:25:59,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:25:59,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:25:59,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:25:59,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:25:59,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:25:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1815 proven. 1056 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-01-12 11:25:59,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:25:59,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-12 11:25:59,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 11:25:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 11:25:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 11:25:59,405 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 44 states. [2019-01-12 11:25:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:25:59,772 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2019-01-12 11:25:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-12 11:25:59,774 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2019-01-12 11:25:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:25:59,776 INFO L225 Difference]: With dead ends: 204 [2019-01-12 11:25:59,776 INFO L226 Difference]: Without dead ends: 146 [2019-01-12 11:25:59,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 11:25:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-12 11:25:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-01-12 11:25:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 11:25:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-01-12 11:25:59,782 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 143 [2019-01-12 11:25:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:25:59,782 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-01-12 11:25:59,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 11:25:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-01-12 11:25:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 11:25:59,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:25:59,783 INFO L402 BasicCegarLoop]: trace histogram [61, 33, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:25:59,783 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:25:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:25:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1671228740, now seen corresponding path program 33 times [2019-01-12 11:25:59,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:25:59,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:25:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:59,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:25:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:25:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1870 proven. 1122 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-01-12 11:26:00,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:00,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:00,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:26:01,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-01-12 11:26:01,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:01,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1881 proven. 784 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-01-12 11:26:02,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:02,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 31] total 74 [2019-01-12 11:26:02,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-12 11:26:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-12 11:26:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 11:26:02,278 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 74 states. [2019-01-12 11:26:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:02,634 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2019-01-12 11:26:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-12 11:26:02,636 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-01-12 11:26:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:02,638 INFO L225 Difference]: With dead ends: 209 [2019-01-12 11:26:02,638 INFO L226 Difference]: Without dead ends: 151 [2019-01-12 11:26:02,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 11:26:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-12 11:26:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-01-12 11:26:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 11:26:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2019-01-12 11:26:02,643 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 145 [2019-01-12 11:26:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:02,643 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2019-01-12 11:26:02,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-12 11:26:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2019-01-12 11:26:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 11:26:02,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:02,644 INFO L402 BasicCegarLoop]: trace histogram [63, 34, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:02,645 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash -668928037, now seen corresponding path program 34 times [2019-01-12 11:26:02,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:02,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1995 proven. 1190 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-01-12 11:26:03,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:03,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:03,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:26:03,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:26:03,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:03,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1995 proven. 1190 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-01-12 11:26:03,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:03,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-12 11:26:03,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-12 11:26:03,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-12 11:26:03,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:26:03,548 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 46 states. [2019-01-12 11:26:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:03,768 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2019-01-12 11:26:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-12 11:26:03,770 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 149 [2019-01-12 11:26:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:03,772 INFO L225 Difference]: With dead ends: 212 [2019-01-12 11:26:03,772 INFO L226 Difference]: Without dead ends: 152 [2019-01-12 11:26:03,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 11:26:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-12 11:26:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-01-12 11:26:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 11:26:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2019-01-12 11:26:03,781 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 149 [2019-01-12 11:26:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:03,781 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2019-01-12 11:26:03,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-12 11:26:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2019-01-12 11:26:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-12 11:26:03,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:03,786 INFO L402 BasicCegarLoop]: trace histogram [64, 35, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:03,786 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1768679624, now seen corresponding path program 35 times [2019-01-12 11:26:03,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:03,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:03,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:03,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2052 proven. 1260 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-01-12 11:26:04,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:04,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:26:04,886 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-01-12 11:26:04,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:04,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2079 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-01-12 11:26:06,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:06,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 34] total 79 [2019-01-12 11:26:06,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-12 11:26:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-12 11:26:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 11:26:06,535 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 79 states. [2019-01-12 11:26:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:07,060 INFO L93 Difference]: Finished difference Result 221 states and 226 transitions. [2019-01-12 11:26:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-12 11:26:07,062 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2019-01-12 11:26:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:07,064 INFO L225 Difference]: With dead ends: 221 [2019-01-12 11:26:07,064 INFO L226 Difference]: Without dead ends: 161 [2019-01-12 11:26:07,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 11:26:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-12 11:26:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-01-12 11:26:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 11:26:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-01-12 11:26:07,070 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 151 [2019-01-12 11:26:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:07,070 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-01-12 11:26:07,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-12 11:26:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-01-12 11:26:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 11:26:07,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:07,072 INFO L402 BasicCegarLoop]: trace histogram [68, 36, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:07,072 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:07,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1193818365, now seen corresponding path program 36 times [2019-01-12 11:26:07,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:07,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:07,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:07,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:07,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2331 proven. 1332 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-01-12 11:26:08,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:08,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:26:08,479 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2019-01-12 11:26:08,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:08,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2345 proven. 1089 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2019-01-12 11:26:10,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:10,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 36] total 82 [2019-01-12 11:26:10,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-12 11:26:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-12 11:26:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-12 11:26:10,384 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 82 states. [2019-01-12 11:26:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:10,916 INFO L93 Difference]: Finished difference Result 233 states and 237 transitions. [2019-01-12 11:26:10,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-12 11:26:10,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 159 [2019-01-12 11:26:10,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:10,920 INFO L225 Difference]: With dead ends: 233 [2019-01-12 11:26:10,920 INFO L226 Difference]: Without dead ends: 167 [2019-01-12 11:26:10,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-12 11:26:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-12 11:26:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-01-12 11:26:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-12 11:26:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-01-12 11:26:10,927 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 159 [2019-01-12 11:26:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:10,927 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-01-12 11:26:10,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-12 11:26:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-01-12 11:26:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 11:26:10,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:10,928 INFO L402 BasicCegarLoop]: trace histogram [71, 37, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:10,929 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash -380853868, now seen corresponding path program 37 times [2019-01-12 11:26:10,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:10,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2546 proven. 1406 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-01-12 11:26:12,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:12,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:12,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:12,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2546 proven. 1406 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-01-12 11:26:12,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:12,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-01-12 11:26:12,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-12 11:26:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-12 11:26:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 11:26:12,344 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 49 states. [2019-01-12 11:26:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:13,398 INFO L93 Difference]: Finished difference Result 238 states and 240 transitions. [2019-01-12 11:26:13,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-12 11:26:13,400 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 165 [2019-01-12 11:26:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:13,402 INFO L225 Difference]: With dead ends: 238 [2019-01-12 11:26:13,402 INFO L226 Difference]: Without dead ends: 168 [2019-01-12 11:26:13,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 11:26:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-12 11:26:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-01-12 11:26:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-12 11:26:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2019-01-12 11:26:13,409 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2019-01-12 11:26:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:13,409 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2019-01-12 11:26:13,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-12 11:26:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2019-01-12 11:26:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 11:26:13,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:13,410 INFO L402 BasicCegarLoop]: trace histogram [72, 38, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:13,410 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1096247025, now seen corresponding path program 38 times [2019-01-12 11:26:13,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:13,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:13,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2613 proven. 1482 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-01-12 11:26:15,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:15,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:15,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:26:15,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:26:15,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:15,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2613 proven. 1482 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-01-12 11:26:15,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:15,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-12 11:26:15,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 11:26:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 11:26:15,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 11:26:15,379 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 50 states. [2019-01-12 11:26:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:15,740 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2019-01-12 11:26:15,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-12 11:26:15,741 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 167 [2019-01-12 11:26:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:15,742 INFO L225 Difference]: With dead ends: 240 [2019-01-12 11:26:15,742 INFO L226 Difference]: Without dead ends: 170 [2019-01-12 11:26:15,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 11:26:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-12 11:26:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-01-12 11:26:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-12 11:26:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-01-12 11:26:15,752 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 167 [2019-01-12 11:26:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:15,753 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-01-12 11:26:15,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 11:26:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-01-12 11:26:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 11:26:15,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:15,757 INFO L402 BasicCegarLoop]: trace histogram [73, 39, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:15,757 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:15,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1043969778, now seen corresponding path program 39 times [2019-01-12 11:26:15,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:15,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:15,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2680 proven. 1560 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-01-12 11:26:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:17,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:17,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:26:17,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-01-12 11:26:17,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:17,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2691 proven. 1156 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:18,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:18,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 37] total 86 [2019-01-12 11:26:18,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-12 11:26:18,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-12 11:26:18,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-12 11:26:18,902 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 86 states. [2019-01-12 11:26:19,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:19,335 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2019-01-12 11:26:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-12 11:26:19,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2019-01-12 11:26:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:19,338 INFO L225 Difference]: With dead ends: 245 [2019-01-12 11:26:19,339 INFO L226 Difference]: Without dead ends: 175 [2019-01-12 11:26:19,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-12 11:26:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-12 11:26:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-01-12 11:26:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-12 11:26:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2019-01-12 11:26:19,345 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 169 [2019-01-12 11:26:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:19,345 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2019-01-12 11:26:19,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-12 11:26:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2019-01-12 11:26:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-01-12 11:26:19,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:19,346 INFO L402 BasicCegarLoop]: trace histogram [75, 40, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:19,346 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1957413413, now seen corresponding path program 40 times [2019-01-12 11:26:19,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:19,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:19,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:19,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:19,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2829 proven. 1640 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-01-12 11:26:21,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:21,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:21,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:26:21,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:26:21,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:21,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2829 proven. 1640 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-01-12 11:26:21,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:21,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-12 11:26:21,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:26:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:26:21,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:26:21,587 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 52 states. [2019-01-12 11:26:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:21,835 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2019-01-12 11:26:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:26:21,837 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 173 [2019-01-12 11:26:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:21,839 INFO L225 Difference]: With dead ends: 248 [2019-01-12 11:26:21,839 INFO L226 Difference]: Without dead ends: 176 [2019-01-12 11:26:21,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:26:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-01-12 11:26:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-01-12 11:26:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-12 11:26:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2019-01-12 11:26:21,845 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 173 [2019-01-12 11:26:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:21,846 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2019-01-12 11:26:21,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:26:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2019-01-12 11:26:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-12 11:26:21,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:21,847 INFO L402 BasicCegarLoop]: trace histogram [76, 41, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:21,847 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1459758462, now seen corresponding path program 41 times [2019-01-12 11:26:21,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:21,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:21,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2925 proven. 1369 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:22,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:22,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:22,566 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 11:26:22,673 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2019-01-12 11:26:22,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:22,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2925 proven. 1369 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-12 11:26:22,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-12 11:26:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-12 11:26:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 11:26:22,721 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 40 states. [2019-01-12 11:26:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:22,889 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2019-01-12 11:26:22,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 11:26:22,891 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 175 [2019-01-12 11:26:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:22,893 INFO L225 Difference]: With dead ends: 186 [2019-01-12 11:26:22,893 INFO L226 Difference]: Without dead ends: 183 [2019-01-12 11:26:22,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 11:26:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-12 11:26:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2019-01-12 11:26:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-12 11:26:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2019-01-12 11:26:22,901 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 175 [2019-01-12 11:26:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:22,902 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2019-01-12 11:26:22,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-12 11:26:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2019-01-12 11:26:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-12 11:26:22,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:22,903 INFO L402 BasicCegarLoop]: trace histogram [79, 41, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:22,903 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2140145552, now seen corresponding path program 42 times [2019-01-12 11:26:22,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:22,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:22,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3159 proven. 1600 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:23,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:23,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:23,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 11:26:23,906 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-01-12 11:26:23,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:23,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 1521 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2019-01-12 11:26:23,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 43 [2019-01-12 11:26:23,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-12 11:26:23,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-12 11:26:23,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:26:23,984 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 43 states. [2019-01-12 11:26:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:24,172 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2019-01-12 11:26:24,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 11:26:24,174 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2019-01-12 11:26:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:24,176 INFO L225 Difference]: With dead ends: 192 [2019-01-12 11:26:24,176 INFO L226 Difference]: Without dead ends: 189 [2019-01-12 11:26:24,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 11:26:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-12 11:26:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-01-12 11:26:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-12 11:26:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2019-01-12 11:26:24,182 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 181 [2019-01-12 11:26:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:24,182 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2019-01-12 11:26:24,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-12 11:26:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2019-01-12 11:26:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-12 11:26:24,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:24,184 INFO L402 BasicCegarLoop]: trace histogram [82, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:24,185 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1121752098, now seen corresponding path program 43 times [2019-01-12 11:26:24,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:24,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:24,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3393 proven. 1849 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:25,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:25,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:25,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:25,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:27,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:27,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 94] total 96 [2019-01-12 11:26:27,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-12 11:26:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-12 11:26:27,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-12 11:26:27,342 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 96 states. [2019-01-12 11:26:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:27,824 INFO L93 Difference]: Finished difference Result 198 states and 201 transitions. [2019-01-12 11:26:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-12 11:26:27,825 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 187 [2019-01-12 11:26:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:27,826 INFO L225 Difference]: With dead ends: 198 [2019-01-12 11:26:27,827 INFO L226 Difference]: Without dead ends: 195 [2019-01-12 11:26:27,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4300 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-12 11:26:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-12 11:26:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-01-12 11:26:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 11:26:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-01-12 11:26:27,834 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 187 [2019-01-12 11:26:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:27,834 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-01-12 11:26:27,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-12 11:26:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-01-12 11:26:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-01-12 11:26:27,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:27,835 INFO L402 BasicCegarLoop]: trace histogram [85, 44, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:27,836 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1893591860, now seen corresponding path program 44 times [2019-01-12 11:26:27,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:26:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3627 proven. 2116 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:29,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:29,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:29,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:26:29,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 11:26:29,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:29,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:30,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:30,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 97] total 99 [2019-01-12 11:26:30,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-12 11:26:30,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-12 11:26:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-01-12 11:26:30,169 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 99 states. [2019-01-12 11:26:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:30,674 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2019-01-12 11:26:30,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-12 11:26:30,676 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 193 [2019-01-12 11:26:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:30,678 INFO L225 Difference]: With dead ends: 204 [2019-01-12 11:26:30,678 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 11:26:30,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4600 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-01-12 11:26:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 11:26:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-01-12 11:26:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-01-12 11:26:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2019-01-12 11:26:30,684 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 193 [2019-01-12 11:26:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:30,685 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2019-01-12 11:26:30,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-12 11:26:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2019-01-12 11:26:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-01-12 11:26:30,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:30,686 INFO L402 BasicCegarLoop]: trace histogram [88, 47, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:30,686 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1349659846, now seen corresponding path program 45 times [2019-01-12 11:26:30,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:30,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:30,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:30,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:30,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3861 proven. 2401 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2019-01-12 11:26:32,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:32,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 11:26:32,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 89 check-sat command(s) [2019-01-12 11:26:32,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:32,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:26:33,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:33,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 100] total 102 [2019-01-12 11:26:33,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-12 11:26:33,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-12 11:26:33,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 11:26:33,142 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 102 states. [2019-01-12 11:26:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:33,701 INFO L93 Difference]: Finished difference Result 209 states and 212 transitions. [2019-01-12 11:26:33,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-12 11:26:33,703 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 199 [2019-01-12 11:26:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:33,705 INFO L225 Difference]: With dead ends: 209 [2019-01-12 11:26:33,705 INFO L226 Difference]: Without dead ends: 206 [2019-01-12 11:26:33,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 11:26:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-12 11:26:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-01-12 11:26:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-12 11:26:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2019-01-12 11:26:33,713 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 199 [2019-01-12 11:26:33,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:33,713 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2019-01-12 11:26:33,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-12 11:26:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2019-01-12 11:26:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 11:26:33,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:33,715 INFO L402 BasicCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:33,715 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:33,715 INFO L82 PathProgramCache]: Analyzing trace with hash 782272296, now seen corresponding path program 46 times [2019-01-12 11:26:33,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:33,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:33,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:33,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:33,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-01-12 11:26:36,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:26:36,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:26:36,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 11:26:36,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 11:26:36,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:26:36,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:26:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-01-12 11:26:36,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:26:36,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-01-12 11:26:36,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-12 11:26:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-12 11:26:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 11:26:36,369 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 54 states. [2019-01-12 11:26:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:38,924 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2019-01-12 11:26:38,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-12 11:26:38,925 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 205 [2019-01-12 11:26:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:38,927 INFO L225 Difference]: With dead ends: 212 [2019-01-12 11:26:38,928 INFO L226 Difference]: Without dead ends: 209 [2019-01-12 11:26:38,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 11:26:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-12 11:26:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-01-12 11:26:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-01-12 11:26:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2019-01-12 11:26:38,937 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 205 [2019-01-12 11:26:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:38,937 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2019-01-12 11:26:38,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-12 11:26:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2019-01-12 11:26:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-12 11:26:38,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:26:38,938 INFO L402 BasicCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:26:38,939 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:26:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:26:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash 136861218, now seen corresponding path program 47 times [2019-01-12 11:26:38,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:26:38,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:26:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:38,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 11:26:38,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:26:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:26:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-01-12 11:26:40,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:26:40,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-01-12 11:26:40,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 11:26:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 11:26:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:26:40,697 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 52 states. [2019-01-12 11:26:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:26:40,935 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2019-01-12 11:26:40,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 11:26:40,937 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2019-01-12 11:26:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:26:40,938 INFO L225 Difference]: With dead ends: 208 [2019-01-12 11:26:40,938 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:26:40,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 11:26:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:26:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:26:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:26:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:26:40,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-01-12 11:26:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:26:40,940 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:26:40,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 11:26:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:26:40,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:26:40,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:26:41,288 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-12 11:26:41,472 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-12 11:26:43,321 WARN L181 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-01-12 11:26:43,399 INFO L444 ceAbstractionStarter]: At program point L118(lines 56 119) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 8) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 143) no Hoare annotation was computed. [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 80) no Hoare annotation was computed. [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 191) no Hoare annotation was computed. [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 208) no Hoare annotation was computed. [2019-01-12 11:26:43,400 INFO L444 ceAbstractionStarter]: At program point L202(lines 14 203) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 1) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,400 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 107) no Hoare annotation was computed. [2019-01-12 11:26:43,401 INFO L444 ceAbstractionStarter]: At program point L178(lines 26 179) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 3) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,401 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 155) no Hoare annotation was computed. [2019-01-12 11:26:43,401 INFO L444 ceAbstractionStarter]: At program point L154(lines 38 155) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 5) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,401 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 203) no Hoare annotation was computed. [2019-01-12 11:26:43,401 INFO L444 ceAbstractionStarter]: At program point L130(lines 50 131) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 7) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,401 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 98) no Hoare annotation was computed. [2019-01-12 11:26:43,401 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 119) no Hoare annotation was computed. [2019-01-12 11:26:43,403 INFO L444 ceAbstractionStarter]: At program point L106(lines 62 107) the Hoare annotation is: (or (and (<= 92 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 92) (<= 92 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 92)) (and (<= 56 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 56) (<= 56 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 56)) (and (<= ULTIMATE.start_main_~main__y~0 58) (<= 58 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 58) (<= 58 ULTIMATE.start_main_~main__y~0)) (and (<= 74 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 74) (<= 74 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 74)) (and (<= 51 ULTIMATE.start_main_~main__x~0) (<= 51 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 51) (<= ULTIMATE.start_main_~main__y~0 51)) (and (<= ULTIMATE.start_main_~main__y~0 75) (<= 75 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 75) (<= 75 ULTIMATE.start_main_~main__x~0)) (and (<= 88 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 88) (<= ULTIMATE.start_main_~main__y~0 88) (<= 88 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 69) (<= 69 ULTIMATE.start_main_~main__x~0) (<= 69 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 69)) (and (<= ULTIMATE.start_main_~main__x~0 95) (<= 95 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 95) (<= 95 ULTIMATE.start_main_~main__y~0)) (and (<= 90 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 90) (<= 90 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 90)) (and (<= 68 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 68) (<= 68 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 68)) (and (<= ULTIMATE.start_main_~main__y~0 97) (<= 97 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 97) (<= 97 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__y~0 85) (<= ULTIMATE.start_main_~main__x~0 85) (<= 85 ULTIMATE.start_main_~main__y~0) (<= 85 ULTIMATE.start_main_~main__x~0)) (and (<= 91 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 91) (<= ULTIMATE.start_main_~main__y~0 91) (<= 91 ULTIMATE.start_main_~main__y~0)) (and (<= 71 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 71) (<= ULTIMATE.start_main_~main__x~0 71) (<= 71 ULTIMATE.start_main_~main__y~0)) (and (<= 83 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 83) (<= 83 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 83)) (and (<= ULTIMATE.start_main_~main__y~0 93) (<= 93 ULTIMATE.start_main_~main__x~0) (<= 93 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 93)) (and (<= 89 ULTIMATE.start_main_~main__x~0) (<= 89 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 89) (<= ULTIMATE.start_main_~main__x~0 89)) (and (<= ULTIMATE.start_main_~main__y~0 84) (<= 84 ULTIMATE.start_main_~main__y~0) (<= 84 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 84)) (and (<= 80 ULTIMATE.start_main_~main__y~0) (<= 80 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 80) (<= ULTIMATE.start_main_~main__y~0 80)) (and (<= 100 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 100) (<= 100 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 70) (<= ULTIMATE.start_main_~main__y~0 70) (<= 70 ULTIMATE.start_main_~main__y~0) (<= 70 ULTIMATE.start_main_~main__x~0)) (and (<= 79 ULTIMATE.start_main_~main__x~0) (<= 79 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 79) (<= ULTIMATE.start_main_~main__y~0 79)) (and (<= ULTIMATE.start_main_~main__y~0 65) (<= 65 ULTIMATE.start_main_~main__x~0) (<= 65 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 65)) (and (<= 82 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 82) (<= 82 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 82)) (and (<= 94 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 94) (<= 94 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 94)) (and (<= ULTIMATE.start_main_~main__x~0 67) (<= 67 ULTIMATE.start_main_~main__y~0) (<= 67 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 67)) (and (<= 72 ULTIMATE.start_main_~main__y~0) (<= 72 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 72) (<= ULTIMATE.start_main_~main__y~0 72)) (and (<= 78 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 78) (<= 78 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 78)) (and (<= ULTIMATE.start_main_~main__y~0 86) (<= 86 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 86) (<= 86 ULTIMATE.start_main_~main__y~0)) (and (<= ULTIMATE.start_main_~main__x~0 96) (<= 96 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 96) (<= 96 ULTIMATE.start_main_~main__x~0)) (and (<= 60 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 60) (<= 60 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 60)) (and (<= 52 ULTIMATE.start_main_~main__y~0) (<= 52 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 52) (<= ULTIMATE.start_main_~main__x~0 52)) (and (<= 99 ULTIMATE.start_main_~main__x~0) (<= 99 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 99) (<= ULTIMATE.start_main_~main__y~0 99)) (and (<= ULTIMATE.start_main_~main__x~0 63) (<= ULTIMATE.start_main_~main__y~0 63) (<= 63 ULTIMATE.start_main_~main__x~0) (<= 63 ULTIMATE.start_main_~main__y~0)) (and (<= 53 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 53) (<= ULTIMATE.start_main_~main__x~0 53) (<= 53 ULTIMATE.start_main_~main__x~0)) (and (<= 62 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 62) (<= 62 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 62)) (and (<= 64 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 64) (<= 64 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 64)) (and (<= 81 ULTIMATE.start_main_~main__x~0) (<= 81 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 81) (<= ULTIMATE.start_main_~main__x~0 81)) (and (<= ULTIMATE.start_main_~main__x~0 55) (<= 55 ULTIMATE.start_main_~main__x~0) (<= 55 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 55)) (and (<= ULTIMATE.start_main_~main__y~0 66) (<= 66 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 66) (<= 66 ULTIMATE.start_main_~main__x~0)) (and (<= ULTIMATE.start_main_~main__x~0 50) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) (and (<= 59 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 59) (<= ULTIMATE.start_main_~main__x~0 59) (<= 59 ULTIMATE.start_main_~main__x~0)) (and (<= 54 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 54) (<= 54 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 54)) (and (<= ULTIMATE.start_main_~main__y~0 98) (<= 98 ULTIMATE.start_main_~main__x~0) (<= 98 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 98)) (and (<= ULTIMATE.start_main_~main__y~0 73) (<= 73 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 73) (<= 73 ULTIMATE.start_main_~main__y~0)) (and (<= 77 ULTIMATE.start_main_~main__y~0) (<= 77 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 77) (<= ULTIMATE.start_main_~main__y~0 77)) (and (<= 57 ULTIMATE.start_main_~main__x~0) (<= 57 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 57) (<= ULTIMATE.start_main_~main__y~0 57)) (and (<= ULTIMATE.start_main_~main__x~0 61) (<= 61 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__y~0 61) (<= 61 ULTIMATE.start_main_~main__y~0)) (and (<= 76 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 76) (<= 76 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 76)) (and (<= 87 ULTIMATE.start_main_~main__y~0) (<= 87 ULTIMATE.start_main_~main__x~0) (<= ULTIMATE.start_main_~main__x~0 87) (<= ULTIMATE.start_main_~main__y~0 87))) [2019-01-12 11:26:43,403 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 167) no Hoare annotation was computed. [2019-01-12 11:26:43,403 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:26:43,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:26:43,403 INFO L444 ceAbstractionStarter]: At program point L190(lines 20 191) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 2) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,403 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 11:26:43,404 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 131) no Hoare annotation was computed. [2019-01-12 11:26:43,404 INFO L451 ceAbstractionStarter]: At program point L207(lines 8 209) the Hoare annotation is: true [2019-01-12 11:26:43,407 INFO L444 ceAbstractionStarter]: At program point L166(lines 32 167) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__x~0 4) (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,408 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-01-12 11:26:43,408 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 179) no Hoare annotation was computed. [2019-01-12 11:26:43,408 INFO L444 ceAbstractionStarter]: At program point L142(lines 44 143) the Hoare annotation is: (and (<= 50 ULTIMATE.start_main_~main__y~0) (<= ULTIMATE.start_main_~main__x~0 6) (<= ULTIMATE.start_main_~main__y~0 50)) [2019-01-12 11:26:43,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:26:43 BoogieIcfgContainer [2019-01-12 11:26:43,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:26:43,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:26:43,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:26:43,463 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:26:43,463 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:25:14" (3/4) ... [2019-01-12 11:26:43,471 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:26:43,485 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:26:43,486 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:26:43,550 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:26:43,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:26:43,551 INFO L168 Benchmark]: Toolchain (without parser) took 90169.97 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 947.3 MB in the beginning and 935.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 525.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:43,554 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:26:43,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.44 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 11:26:43,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.85 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:43,555 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:26:43,555 INFO L168 Benchmark]: RCFGBuilder took 600.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:43,556 INFO L168 Benchmark]: TraceAbstraction took 89079.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 949.1 MB in the end (delta: 166.2 MB). Peak memory consumption was 533.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:43,556 INFO L168 Benchmark]: Witness Printer took 88.20 ms. Allocated memory is still 1.5 GB. Free memory was 949.1 MB in the beginning and 935.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:26:43,564 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.44 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 44.85 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.30 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 600.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89079.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 949.1 MB in the end (delta: 166.2 MB). Peak memory consumption was 533.8 MB. Max. memory is 11.5 GB. * Witness Printer took 88.20 ms. Allocated memory is still 1.5 GB. Free memory was 949.1 MB in the beginning and 935.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (main__x <= 1 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (main__x <= 5 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((92 <= main__y && main__y <= 92) && 92 <= main__x) && main__x <= 92) || (((56 <= main__y && main__x <= 56) && 56 <= main__x) && main__y <= 56)) || (((main__y <= 58 && 58 <= main__x) && main__x <= 58) && 58 <= main__y)) || (((74 <= main__y && main__y <= 74) && 74 <= main__x) && main__x <= 74)) || (((51 <= main__x && 51 <= main__y) && main__x <= 51) && main__y <= 51)) || (((main__y <= 75 && 75 <= main__y) && main__x <= 75) && 75 <= main__x)) || (((88 <= main__x && main__x <= 88) && main__y <= 88) && 88 <= main__y)) || (((main__y <= 69 && 69 <= main__x) && 69 <= main__y) && main__x <= 69)) || (((main__x <= 95 && 95 <= main__x) && main__y <= 95) && 95 <= main__y)) || (((90 <= main__y && main__x <= 90) && 90 <= main__x) && main__y <= 90)) || (((68 <= main__y && main__x <= 68) && 68 <= main__x) && main__y <= 68)) || (((main__y <= 97 && 97 <= main__x) && main__x <= 97) && 97 <= main__y)) || (((main__y <= 85 && main__x <= 85) && 85 <= main__y) && 85 <= main__x)) || (((91 <= main__x && main__x <= 91) && main__y <= 91) && 91 <= main__y)) || (((71 <= main__x && main__y <= 71) && main__x <= 71) && 71 <= main__y)) || (((83 <= main__x && main__y <= 83) && 83 <= main__y) && main__x <= 83)) || (((main__y <= 93 && 93 <= main__x) && 93 <= main__y) && main__x <= 93)) || (((89 <= main__x && 89 <= main__y) && main__y <= 89) && main__x <= 89)) || (((main__y <= 84 && 84 <= main__y) && 84 <= main__x) && main__x <= 84)) || (((80 <= main__y && 80 <= main__x) && main__x <= 80) && main__y <= 80)) || ((100 <= main__x && main__y <= 100) && 100 <= main__y)) || (((main__x <= 70 && main__y <= 70) && 70 <= main__y) && 70 <= main__x)) || (((79 <= main__x && 79 <= main__y) && main__x <= 79) && main__y <= 79)) || (((main__y <= 65 && 65 <= main__x) && 65 <= main__y) && main__x <= 65)) || (((82 <= main__y && main__y <= 82) && 82 <= main__x) && main__x <= 82)) || (((94 <= main__x && main__x <= 94) && 94 <= main__y) && main__y <= 94)) || (((main__x <= 67 && 67 <= main__y) && 67 <= main__x) && main__y <= 67)) || (((72 <= main__y && 72 <= main__x) && main__x <= 72) && main__y <= 72)) || (((78 <= main__x && main__x <= 78) && 78 <= main__y) && main__y <= 78)) || (((main__y <= 86 && 86 <= main__x) && main__x <= 86) && 86 <= main__y)) || (((main__x <= 96 && 96 <= main__y) && main__y <= 96) && 96 <= main__x)) || (((60 <= main__y && main__x <= 60) && 60 <= main__x) && main__y <= 60)) || (((52 <= main__y && 52 <= main__x) && main__y <= 52) && main__x <= 52)) || (((99 <= main__x && 99 <= main__y) && main__x <= 99) && main__y <= 99)) || (((main__x <= 63 && main__y <= 63) && 63 <= main__x) && 63 <= main__y)) || (((53 <= main__y && main__y <= 53) && main__x <= 53) && 53 <= main__x)) || (((62 <= main__x && main__x <= 62) && 62 <= main__y) && main__y <= 62)) || (((64 <= main__x && main__x <= 64) && 64 <= main__y) && main__y <= 64)) || (((81 <= main__x && 81 <= main__y) && main__y <= 81) && main__x <= 81)) || (((main__x <= 55 && 55 <= main__x) && 55 <= main__y) && main__y <= 55)) || (((main__y <= 66 && 66 <= main__y) && main__x <= 66) && 66 <= main__x)) || ((main__x <= 50 && 50 <= main__y) && main__y <= 50)) || (((59 <= main__y && main__y <= 59) && main__x <= 59) && 59 <= main__x)) || (((54 <= main__y && main__y <= 54) && 54 <= main__x) && main__x <= 54)) || (((main__y <= 98 && 98 <= main__x) && 98 <= main__y) && main__x <= 98)) || (((main__y <= 73 && 73 <= main__x) && main__x <= 73) && 73 <= main__y)) || (((77 <= main__y && 77 <= main__x) && main__x <= 77) && main__y <= 77)) || (((57 <= main__x && 57 <= main__y) && main__x <= 57) && main__y <= 57)) || (((main__x <= 61 && 61 <= main__x) && main__y <= 61) && 61 <= main__y)) || (((76 <= main__x && main__x <= 76) && 76 <= main__y) && main__y <= 76)) || (((87 <= main__y && 87 <= main__x) && main__x <= 87) && main__y <= 87) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__x <= 4 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (main__x <= 8 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 3) && main__y <= 50 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__x <= 7 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__x <= 2 && 50 <= main__y) && main__y <= 50 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (50 <= main__y && main__x <= 6) && main__y <= 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 88.9s OverallTime, 55 OverallIterations, 92 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 495 SDtfs, 1914 SDslu, 6115 SDs, 0 SdLazy, 13222 SolverSat, 2041 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6661 GetRequests, 4598 SyntacticMatches, 2 SemanticMatches, 2061 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13800 ImplicationChecksByTransitivity, 56.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=54, 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, 55 MinimizatonAttempts, 23 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 111 NumberOfFragments, 739 HoareAnnotationTreeSize, 10 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 59.2s InterpolantComputationTime, 10433 NumberOfCodeBlocks, 10371 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 10332 ConstructedInterpolants, 0 QuantifiedInterpolants, 3352268 SizeOfPredicates, 26 NumberOfNonLiveVariables, 12110 ConjunctsInSsa, 1527 ConjunctsInUnsatCore, 101 InterpolantComputations, 9 PerfectInterpolantSequences, 152159/241943 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...