./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-14 14:59:42,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:59:42,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:59:42,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:59:42,463 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:59:42,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:59:42,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:59:42,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:59:42,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:59:42,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:59:42,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:59:42,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:59:42,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:59:42,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:59:42,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:59:42,477 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:59:42,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:59:42,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:59:42,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:59:42,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:59:42,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:59:42,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:59:42,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:59:42,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:59:42,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:59:42,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:59:42,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:59:42,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:59:42,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:59:42,500 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:59:42,500 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:59:42,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:59:42,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:59:42,503 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:59:42,504 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:59:42,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:59:42,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:59:42,537 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:59:42,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:59:42,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:59:42,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:59:42,540 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:59:42,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:59:42,540 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:59:42,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:59:42,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:59:42,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:59:42,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:59:42,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:59:42,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:59:42,543 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:59:42,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:59:42,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:59:42,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:59:42,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:59:42,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:59:42,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:59:42,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:42,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:59:42,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:59:42,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:59:42,548 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:59:42,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:59:42,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:59:42,548 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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-01-14 14:59:42,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:59:42,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:59:42,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:59:42,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:59:42,616 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:59:42,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:42,683 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef2b8e42/45f326e5ff124801bc0b500533c10ee6/FLAGcfccd243b [2019-01-14 14:59:43,147 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:59:43,148 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:43,157 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef2b8e42/45f326e5ff124801bc0b500533c10ee6/FLAGcfccd243b [2019-01-14 14:59:43,522 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ef2b8e42/45f326e5ff124801bc0b500533c10ee6 [2019-01-14 14:59:43,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:59:43,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:59:43,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:43,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:59:43,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:59:43,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d04184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43, skipping insertion in model container [2019-01-14 14:59:43,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:59:43,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:59:43,774 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:43,778 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:59:43,812 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:43,827 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:59:43,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43 WrapperNode [2019-01-14 14:59:43,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:43,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:43,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:59:43,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:59:43,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:43,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:59:43,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:59:43,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:59:43,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (1/1) ... [2019-01-14 14:59:43,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:59:43,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:59:43,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:59:43,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:59:43,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (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-14 14:59:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:59:44,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:59:44,602 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:59:44,602 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 14:59:44,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:44 BoogieIcfgContainer [2019-01-14 14:59:44,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:59:44,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:59:44,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:59:44,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:59:44,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:59:43" (1/3) ... [2019-01-14 14:59:44,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0f3174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:44, skipping insertion in model container [2019-01-14 14:59:44,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:43" (2/3) ... [2019-01-14 14:59:44,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c0f3174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:44, skipping insertion in model container [2019-01-14 14:59:44,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:44" (3/3) ... [2019-01-14 14:59:44,611 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:44,620 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:59:44,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:59:44,639 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:59:44,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:59:44,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:59:44,670 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:59:44,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:59:44,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:59:44,670 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:59:44,671 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:59:44,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:59:44,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:59:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-01-14 14:59:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:44,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:44,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:44,695 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2019-01-14 14:59:44,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:44,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:44,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:44,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:44,897 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-14 14:59:44,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:44,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:44,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:44,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:44,916 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-01-14 14:59:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:44,982 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2019-01-14 14:59:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:44,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:44,996 INFO L225 Difference]: With dead ends: 100 [2019-01-14 14:59:44,996 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 14:59:45,000 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-14 14:59:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 14:59:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-01-14 14:59:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 14:59:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-01-14 14:59:45,045 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2019-01-14 14:59:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,045 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-01-14 14:59:45,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-01-14 14:59:45,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:45,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:45,047 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2019-01-14 14:59:45,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,154 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-14 14:59:45,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,157 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2019-01-14 14:59:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,274 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2019-01-14 14:59:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,277 INFO L225 Difference]: With dead ends: 143 [2019-01-14 14:59:45,277 INFO L226 Difference]: Without dead ends: 86 [2019-01-14 14:59:45,278 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-14 14:59:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-14 14:59:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-01-14 14:59:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 14:59:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2019-01-14 14:59:45,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2019-01-14 14:59:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,289 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2019-01-14 14:59:45,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2019-01-14 14:59:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:45,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,294 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] [2019-01-14 14:59:45,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,295 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2019-01-14 14:59:45,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,443 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-14 14:59:45,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,445 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2019-01-14 14:59:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,530 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2019-01-14 14:59:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,534 INFO L225 Difference]: With dead ends: 131 [2019-01-14 14:59:45,535 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 14:59:45,535 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-14 14:59:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 14:59:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-14 14:59:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-14 14:59:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2019-01-14 14:59:45,553 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2019-01-14 14:59:45,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,553 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2019-01-14 14:59:45,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2019-01-14 14:59:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:45,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,556 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] [2019-01-14 14:59:45,557 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2019-01-14 14:59:45,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,640 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-14 14:59:45,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,643 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2019-01-14 14:59:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,686 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2019-01-14 14:59:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,689 INFO L225 Difference]: With dead ends: 168 [2019-01-14 14:59:45,689 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 14:59:45,690 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-14 14:59:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 14:59:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2019-01-14 14:59:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 14:59:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2019-01-14 14:59:45,706 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2019-01-14 14:59:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,707 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2019-01-14 14:59:45,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2019-01-14 14:59:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:45,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,709 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] [2019-01-14 14:59:45,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2019-01-14 14:59:45,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,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-14 14:59:45,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,758 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2019-01-14 14:59:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,793 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2019-01-14 14:59:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,795 INFO L225 Difference]: With dead ends: 280 [2019-01-14 14:59:45,795 INFO L226 Difference]: Without dead ends: 168 [2019-01-14 14:59:45,797 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-14 14:59:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-14 14:59:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-01-14 14:59:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-14 14:59:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2019-01-14 14:59:45,809 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2019-01-14 14:59:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,809 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2019-01-14 14:59:45,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2019-01-14 14:59:45,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:45,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,811 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] [2019-01-14 14:59:45,811 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,812 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2019-01-14 14:59:45,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,890 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-14 14:59:45,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,892 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2019-01-14 14:59:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,925 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2019-01-14 14:59:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,927 INFO L225 Difference]: With dead ends: 251 [2019-01-14 14:59:45,927 INFO L226 Difference]: Without dead ends: 170 [2019-01-14 14:59:45,928 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-14 14:59:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-14 14:59:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-01-14 14:59:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-14 14:59:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2019-01-14 14:59:45,939 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2019-01-14 14:59:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,940 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2019-01-14 14:59:45,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2019-01-14 14:59:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:45,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,942 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] [2019-01-14 14:59:45,942 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2019-01-14 14:59:45,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,019 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-14 14:59:46,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:46,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:46,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,021 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2019-01-14 14:59:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,124 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2019-01-14 14:59:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,127 INFO L225 Difference]: With dead ends: 488 [2019-01-14 14:59:46,127 INFO L226 Difference]: Without dead ends: 326 [2019-01-14 14:59:46,128 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-14 14:59:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-01-14 14:59:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2019-01-14 14:59:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-01-14 14:59:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2019-01-14 14:59:46,145 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2019-01-14 14:59:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,146 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2019-01-14 14:59:46,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2019-01-14 14:59:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:46,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:46,148 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] [2019-01-14 14:59:46,149 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2019-01-14 14:59:46,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:46,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,206 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-14 14:59:46,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:46,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:46,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,209 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2019-01-14 14:59:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,262 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2019-01-14 14:59:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,266 INFO L225 Difference]: With dead ends: 416 [2019-01-14 14:59:46,266 INFO L226 Difference]: Without dead ends: 414 [2019-01-14 14:59:46,267 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-14 14:59:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-14 14:59:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2019-01-14 14:59:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-01-14 14:59:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2019-01-14 14:59:46,280 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2019-01-14 14:59:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,281 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2019-01-14 14:59:46,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2019-01-14 14:59:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:46,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:46,283 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] [2019-01-14 14:59:46,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2019-01-14 14:59:46,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,370 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-14 14:59:46,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:46,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:46,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,372 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2019-01-14 14:59:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,473 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2019-01-14 14:59:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,479 INFO L225 Difference]: With dead ends: 612 [2019-01-14 14:59:46,479 INFO L226 Difference]: Without dead ends: 610 [2019-01-14 14:59:46,479 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-14 14:59:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-01-14 14:59:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2019-01-14 14:59:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-14 14:59:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2019-01-14 14:59:46,499 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2019-01-14 14:59:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,499 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2019-01-14 14:59:46,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2019-01-14 14:59:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:46,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:46,502 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] [2019-01-14 14:59:46,502 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2019-01-14 14:59:46,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:46,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,580 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-14 14:59:46,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:46,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,587 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2019-01-14 14:59:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,690 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2019-01-14 14:59:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,695 INFO L225 Difference]: With dead ends: 1076 [2019-01-14 14:59:46,695 INFO L226 Difference]: Without dead ends: 634 [2019-01-14 14:59:46,696 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-14 14:59:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-01-14 14:59:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-01-14 14:59:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-01-14 14:59:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2019-01-14 14:59:46,726 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2019-01-14 14:59:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,727 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2019-01-14 14:59:46,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2019-01-14 14:59:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:46,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:46,735 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-14 14:59:46,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2019-01-14 14:59:46,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:46,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,823 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-14 14:59:46,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:46,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:46,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:46,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:46,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,826 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2019-01-14 14:59:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,924 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2019-01-14 14:59:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,929 INFO L225 Difference]: With dead ends: 956 [2019-01-14 14:59:46,929 INFO L226 Difference]: Without dead ends: 646 [2019-01-14 14:59:46,930 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-14 14:59:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-01-14 14:59:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2019-01-14 14:59:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-01-14 14:59:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2019-01-14 14:59:46,969 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2019-01-14 14:59:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,969 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2019-01-14 14:59:46,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2019-01-14 14:59:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:46,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:46,971 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-14 14:59:46,972 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2019-01-14 14:59:46,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:46,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:47,065 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-14 14:59:47,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:47,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:47,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:47,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,068 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2019-01-14 14:59:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,177 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2019-01-14 14:59:47,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,188 INFO L225 Difference]: With dead ends: 1192 [2019-01-14 14:59:47,188 INFO L226 Difference]: Without dead ends: 1190 [2019-01-14 14:59:47,189 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-14 14:59:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-01-14 14:59:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2019-01-14 14:59:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-01-14 14:59:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2019-01-14 14:59:47,237 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2019-01-14 14:59:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:47,238 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2019-01-14 14:59:47,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2019-01-14 14:59:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:47,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:47,242 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-14 14:59:47,242 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:47,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2019-01-14 14:59:47,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:47,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:47,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:47,331 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-14 14:59:47,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:47,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:47,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:47,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,334 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2019-01-14 14:59:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,452 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2019-01-14 14:59:47,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,462 INFO L225 Difference]: With dead ends: 2136 [2019-01-14 14:59:47,462 INFO L226 Difference]: Without dead ends: 1254 [2019-01-14 14:59:47,464 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-14 14:59:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-01-14 14:59:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2019-01-14 14:59:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-01-14 14:59:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2019-01-14 14:59:47,512 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2019-01-14 14:59:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:47,512 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2019-01-14 14:59:47,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2019-01-14 14:59:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:47,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:47,515 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] [2019-01-14 14:59:47,515 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2019-01-14 14:59:47,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:47,596 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-14 14:59:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:47,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:47,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,597 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2019-01-14 14:59:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,691 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2019-01-14 14:59:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,702 INFO L225 Difference]: With dead ends: 1880 [2019-01-14 14:59:47,702 INFO L226 Difference]: Without dead ends: 1270 [2019-01-14 14:59:47,704 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-14 14:59:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-01-14 14:59:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2019-01-14 14:59:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-01-14 14:59:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2019-01-14 14:59:47,750 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2019-01-14 14:59:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:47,754 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2019-01-14 14:59:47,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2019-01-14 14:59:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:47,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:47,757 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] [2019-01-14 14:59:47,757 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2019-01-14 14:59:47,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:47,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:47,830 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-14 14:59:47,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:47,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:47,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:47,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,831 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2019-01-14 14:59:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,927 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2019-01-14 14:59:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,940 INFO L225 Difference]: With dead ends: 2312 [2019-01-14 14:59:47,941 INFO L226 Difference]: Without dead ends: 2310 [2019-01-14 14:59:47,942 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-14 14:59:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-01-14 14:59:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2019-01-14 14:59:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-01-14 14:59:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2019-01-14 14:59:48,003 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2019-01-14 14:59:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,003 INFO L480 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2019-01-14 14:59:48,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2019-01-14 14:59:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:48,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,006 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] [2019-01-14 14:59:48,007 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2019-01-14 14:59:48,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:48,084 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-14 14:59:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:48,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:48,085 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2019-01-14 14:59:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:48,222 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2019-01-14 14:59:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:48,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:48,235 INFO L225 Difference]: With dead ends: 4232 [2019-01-14 14:59:48,235 INFO L226 Difference]: Without dead ends: 2470 [2019-01-14 14:59:48,238 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-14 14:59:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-01-14 14:59:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2019-01-14 14:59:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-01-14 14:59:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2019-01-14 14:59:48,323 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2019-01-14 14:59:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,324 INFO L480 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2019-01-14 14:59:48,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2019-01-14 14:59:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:48,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,327 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-14 14:59:48,328 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2019-01-14 14:59:48,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:48,402 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-14 14:59:48,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:48,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:48,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:48,404 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2019-01-14 14:59:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:48,547 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2019-01-14 14:59:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:48,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:48,559 INFO L225 Difference]: With dead ends: 3704 [2019-01-14 14:59:48,560 INFO L226 Difference]: Without dead ends: 2502 [2019-01-14 14:59:48,562 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-14 14:59:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-01-14 14:59:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2019-01-14 14:59:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-01-14 14:59:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2019-01-14 14:59:48,633 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2019-01-14 14:59:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,633 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2019-01-14 14:59:48,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2019-01-14 14:59:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:48,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,636 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-14 14:59:48,636 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2019-01-14 14:59:48,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:48,708 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-14 14:59:48,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:48,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:48,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:48,710 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2019-01-14 14:59:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:48,846 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2019-01-14 14:59:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:48,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:48,866 INFO L225 Difference]: With dead ends: 4488 [2019-01-14 14:59:48,866 INFO L226 Difference]: Without dead ends: 4486 [2019-01-14 14:59:48,868 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-14 14:59:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-01-14 14:59:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2019-01-14 14:59:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-01-14 14:59:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2019-01-14 14:59:48,966 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2019-01-14 14:59:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,966 INFO L480 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2019-01-14 14:59:48,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2019-01-14 14:59:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:48,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,972 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-14 14:59:48,972 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2019-01-14 14:59:48,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:49,024 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-14 14:59:49,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:49,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:49,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:49,026 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2019-01-14 14:59:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:49,216 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2019-01-14 14:59:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:49,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:49,257 INFO L225 Difference]: With dead ends: 8392 [2019-01-14 14:59:49,257 INFO L226 Difference]: Without dead ends: 4870 [2019-01-14 14:59:49,272 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-14 14:59:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-01-14 14:59:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2019-01-14 14:59:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-01-14 14:59:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2019-01-14 14:59:49,414 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2019-01-14 14:59:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:49,414 INFO L480 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2019-01-14 14:59:49,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2019-01-14 14:59:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:49,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:49,422 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, 1] [2019-01-14 14:59:49,422 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:49,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2019-01-14 14:59:49,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:49,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:49,488 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-14 14:59:49,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:49,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:49,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:49,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:49,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:49,491 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2019-01-14 14:59:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:49,639 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2019-01-14 14:59:49,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:49,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:49,650 INFO L225 Difference]: With dead ends: 7304 [2019-01-14 14:59:49,651 INFO L226 Difference]: Without dead ends: 4934 [2019-01-14 14:59:49,655 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-14 14:59:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-01-14 14:59:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-01-14 14:59:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-01-14 14:59:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2019-01-14 14:59:49,773 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2019-01-14 14:59:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:49,773 INFO L480 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2019-01-14 14:59:49,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2019-01-14 14:59:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:49,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:49,780 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, 1] [2019-01-14 14:59:49,781 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2019-01-14 14:59:49,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:49,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:49,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:49,850 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-14 14:59:49,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:49,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:49,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:49,852 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2019-01-14 14:59:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:50,029 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2019-01-14 14:59:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:50,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:50,047 INFO L225 Difference]: With dead ends: 8712 [2019-01-14 14:59:50,048 INFO L226 Difference]: Without dead ends: 8710 [2019-01-14 14:59:50,052 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-14 14:59:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-01-14 14:59:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2019-01-14 14:59:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2019-01-14 14:59:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2019-01-14 14:59:50,240 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2019-01-14 14:59:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:50,241 INFO L480 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2019-01-14 14:59:50,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2019-01-14 14:59:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:50,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:50,253 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, 1] [2019-01-14 14:59:50,254 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:50,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2019-01-14 14:59:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:50,329 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-14 14:59:50,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:50,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:50,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:50,331 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2019-01-14 14:59:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:50,612 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2019-01-14 14:59:50,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:50,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:50,630 INFO L225 Difference]: With dead ends: 16648 [2019-01-14 14:59:50,631 INFO L226 Difference]: Without dead ends: 9606 [2019-01-14 14:59:50,640 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-14 14:59:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-01-14 14:59:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2019-01-14 14:59:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-01-14 14:59:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2019-01-14 14:59:50,868 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2019-01-14 14:59:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:50,868 INFO L480 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2019-01-14 14:59:50,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2019-01-14 14:59:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:50,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:50,880 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, 1, 1] [2019-01-14 14:59:50,880 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2019-01-14 14:59:50,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:50,948 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-14 14:59:50,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:50,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:50,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:50,950 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2019-01-14 14:59:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:51,156 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2019-01-14 14:59:51,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:51,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:51,175 INFO L225 Difference]: With dead ends: 14408 [2019-01-14 14:59:51,175 INFO L226 Difference]: Without dead ends: 9734 [2019-01-14 14:59:51,183 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-14 14:59:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-01-14 14:59:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2019-01-14 14:59:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-01-14 14:59:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2019-01-14 14:59:51,479 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2019-01-14 14:59:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:51,479 INFO L480 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2019-01-14 14:59:51,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2019-01-14 14:59:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:51,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:51,492 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, 1, 1] [2019-01-14 14:59:51,492 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2019-01-14 14:59:51,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:51,574 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-14 14:59:51,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:51,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:51,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:51,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:51,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:51,575 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2019-01-14 14:59:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:51,953 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2019-01-14 14:59:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:51,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:51,987 INFO L225 Difference]: With dead ends: 16904 [2019-01-14 14:59:51,987 INFO L226 Difference]: Without dead ends: 16902 [2019-01-14 14:59:51,994 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-14 14:59:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-01-14 14:59:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2019-01-14 14:59:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-01-14 14:59:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2019-01-14 14:59:52,413 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2019-01-14 14:59:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,413 INFO L480 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2019-01-14 14:59:52,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2019-01-14 14:59:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:52,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,429 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, 1, 1] [2019-01-14 14:59:52,429 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2019-01-14 14:59:52,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,499 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-14 14:59:52,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,500 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2019-01-14 14:59:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:52,813 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2019-01-14 14:59:52,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:52,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:52,845 INFO L225 Difference]: With dead ends: 33032 [2019-01-14 14:59:52,845 INFO L226 Difference]: Without dead ends: 18950 [2019-01-14 14:59:52,862 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-14 14:59:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2019-01-14 14:59:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2019-01-14 14:59:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-01-14 14:59:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2019-01-14 14:59:53,335 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2019-01-14 14:59:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:53,335 INFO L480 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2019-01-14 14:59:53,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2019-01-14 14:59:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:53,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:53,350 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, 1, 1, 1] [2019-01-14 14:59:53,350 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2019-01-14 14:59:53,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:53,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:53,414 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-14 14:59:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:53,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:53,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:53,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:53,415 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2019-01-14 14:59:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:53,836 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2019-01-14 14:59:53,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:53,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:53,863 INFO L225 Difference]: With dead ends: 28424 [2019-01-14 14:59:53,863 INFO L226 Difference]: Without dead ends: 19206 [2019-01-14 14:59:53,873 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-14 14:59:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-01-14 14:59:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2019-01-14 14:59:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-01-14 14:59:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2019-01-14 14:59:54,383 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2019-01-14 14:59:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:54,383 INFO L480 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2019-01-14 14:59:54,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2019-01-14 14:59:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:54,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:54,401 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, 1, 1, 1] [2019-01-14 14:59:54,402 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2019-01-14 14:59:54,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:54,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:54,475 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-14 14:59:54,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:54,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:54,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:54,477 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2019-01-14 14:59:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:54,900 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2019-01-14 14:59:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:54,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:54,932 INFO L225 Difference]: With dead ends: 32776 [2019-01-14 14:59:54,932 INFO L226 Difference]: Without dead ends: 32774 [2019-01-14 14:59:54,941 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-14 14:59:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2019-01-14 14:59:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2019-01-14 14:59:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2019-01-14 14:59:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2019-01-14 14:59:55,690 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2019-01-14 14:59:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:55,690 INFO L480 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2019-01-14 14:59:55,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2019-01-14 14:59:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:55,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:55,706 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, 1, 1, 1] [2019-01-14 14:59:55,706 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2019-01-14 14:59:55,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:55,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:55,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:55,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:55,779 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-14 14:59:55,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:55,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:55,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,780 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2019-01-14 14:59:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:56,471 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2019-01-14 14:59:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:56,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:56,504 INFO L225 Difference]: With dead ends: 65544 [2019-01-14 14:59:56,504 INFO L226 Difference]: Without dead ends: 37382 [2019-01-14 14:59:56,533 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-14 14:59:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2019-01-14 14:59:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2019-01-14 14:59:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2019-01-14 14:59:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2019-01-14 14:59:57,218 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2019-01-14 14:59:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:57,218 INFO L480 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2019-01-14 14:59:57,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2019-01-14 14:59:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:59:57,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:57,232 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, 1, 1, 1, 1] [2019-01-14 14:59:57,232 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:57,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2019-01-14 14:59:57,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:57,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:57,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:57,293 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-14 14:59:57,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:57,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:57,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:57,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:57,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:57,294 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2019-01-14 14:59:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:57,871 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2019-01-14 14:59:57,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:57,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 14:59:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:57,900 INFO L225 Difference]: With dead ends: 56072 [2019-01-14 14:59:57,900 INFO L226 Difference]: Without dead ends: 37894 [2019-01-14 14:59:57,911 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-14 14:59:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2019-01-14 14:59:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2019-01-14 14:59:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2019-01-14 14:59:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2019-01-14 14:59:58,528 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2019-01-14 14:59:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:58,528 INFO L480 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2019-01-14 14:59:58,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2019-01-14 14:59:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:59:58,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:58,549 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, 1, 1, 1, 1] [2019-01-14 14:59:58,549 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2019-01-14 14:59:58,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:58,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:58,625 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-14 14:59:58,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:58,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:58,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:58,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:58,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:58,626 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2019-01-14 14:59:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:59,478 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2019-01-14 14:59:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:59,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 14:59:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:59,543 INFO L225 Difference]: With dead ends: 110600 [2019-01-14 14:59:59,544 INFO L226 Difference]: Without dead ends: 73734 [2019-01-14 14:59:59,573 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-14 15:00:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2019-01-14 15:00:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2019-01-14 15:00:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-01-14 15:00:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2019-01-14 15:00:01,130 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2019-01-14 15:00:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:01,130 INFO L480 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2019-01-14 15:00:01,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2019-01-14 15:00:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:00:01,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:01,167 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, 1, 1, 1, 1] [2019-01-14 15:00:01,167 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2019-01-14 15:00:01,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:01,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:01,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:01,234 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-14 15:00:01,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:01,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:01,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:01,235 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2019-01-14 15:00:02,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:02,675 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2019-01-14 15:00:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:02,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 15:00:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:02,732 INFO L225 Difference]: With dead ends: 79880 [2019-01-14 15:00:02,732 INFO L226 Difference]: Without dead ends: 79878 [2019-01-14 15:00:02,743 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-14 15:00:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-01-14 15:00:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2019-01-14 15:00:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-01-14 15:00:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2019-01-14 15:00:03,863 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2019-01-14 15:00:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:03,863 INFO L480 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2019-01-14 15:00:03,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2019-01-14 15:00:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:00:03,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:03,896 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, 1, 1, 1, 1, 1] [2019-01-14 15:00:03,896 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2019-01-14 15:00:03,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:03,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:03,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:03,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:03,943 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-14 15:00:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:03,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:03,945 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2019-01-14 15:00:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:05,801 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2019-01-14 15:00:05,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:05,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 15:00:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:05,892 INFO L225 Difference]: With dead ends: 121864 [2019-01-14 15:00:05,892 INFO L226 Difference]: Without dead ends: 121862 [2019-01-14 15:00:05,906 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-14 15:00:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2019-01-14 15:00:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2019-01-14 15:00:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2019-01-14 15:00:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2019-01-14 15:00:07,905 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2019-01-14 15:00:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:07,905 INFO L480 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2019-01-14 15:00:07,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:07,905 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2019-01-14 15:00:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:00:07,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:07,969 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, 1, 1, 1, 1, 1] [2019-01-14 15:00:07,969 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2019-01-14 15:00:07,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:07,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:07,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:08,033 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-14 15:00:08,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:08,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:08,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:08,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:08,035 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2019-01-14 15:00:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:09,729 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2019-01-14 15:00:09,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:09,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 15:00:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:09,845 INFO L225 Difference]: With dead ends: 257032 [2019-01-14 15:00:09,845 INFO L226 Difference]: Without dead ends: 144390 [2019-01-14 15:00:09,908 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-14 15:00:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2019-01-14 15:00:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2019-01-14 15:00:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2019-01-14 15:00:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2019-01-14 15:00:15,963 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2019-01-14 15:00:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:15,964 INFO L480 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2019-01-14 15:00:15,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2019-01-14 15:00:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 15:00:16,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:16,031 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, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:16,032 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:16,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2019-01-14 15:00:16,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:16,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:16,058 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-14 15:00:16,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:16,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:16,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:16,060 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2019-01-14 15:00:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:17,644 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2019-01-14 15:00:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:17,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 15:00:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:17,786 INFO L225 Difference]: With dead ends: 218120 [2019-01-14 15:00:17,786 INFO L226 Difference]: Without dead ends: 147462 [2019-01-14 15:00:17,830 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-14 15:00:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2019-01-14 15:00:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2019-01-14 15:00:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2019-01-14 15:00:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2019-01-14 15:00:20,902 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2019-01-14 15:00:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:20,902 INFO L480 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2019-01-14 15:00:20,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2019-01-14 15:00:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 15:00:20,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:20,982 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, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:20,982 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2019-01-14 15:00:20,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:20,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:20,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:20,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:21,041 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-14 15:00:21,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:21,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:21,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:21,043 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2019-01-14 15:00:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,906 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2019-01-14 15:00:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 15:00:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,183 INFO L225 Difference]: With dead ends: 237574 [2019-01-14 15:00:24,183 INFO L226 Difference]: Without dead ends: 237572 [2019-01-14 15:00:25,082 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-14 15:00:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2019-01-14 15:00:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2019-01-14 15:00:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2019-01-14 15:00:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2019-01-14 15:00:28,122 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2019-01-14 15:00:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:28,122 INFO L480 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2019-01-14 15:00:28,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2019-01-14 15:00:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 15:00:28,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:28,273 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, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:28,273 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2019-01-14 15:00:28,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:28,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:28,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:28,302 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-14 15:00:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:28,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:28,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:28,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:28,303 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2019-01-14 15:00:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:32,616 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2019-01-14 15:00:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:32,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-01-14 15:00:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:32,617 INFO L225 Difference]: With dead ends: 512004 [2019-01-14 15:00:32,617 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:00:32,726 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-14 15:00:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:00:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:00:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:00:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:00:32,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-14 15:00:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:32,727 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:00:32,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:00:32,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:00:32,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:00:32,817 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-14 15:00:32,817 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,817 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L451 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-14 15:00:32,818 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,819 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,820 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,827 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,828 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-14 15:00:32,829 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,829 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-01-14 15:00:32,829 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-14 15:00:32,829 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,829 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,829 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-01-14 15:00:32,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:32 BoogieIcfgContainer [2019-01-14 15:00:32,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:32,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:32,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:32,846 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:32,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:44" (3/4) ... [2019-01-14 15:00:32,852 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:32,875 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:00:32,875 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:32,999 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:32,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:33,003 INFO L168 Benchmark]: Toolchain (without parser) took 49474.63 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 948.7 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,006 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:33,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.30 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.66 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,007 INFO L168 Benchmark]: Boogie Preprocessor took 95.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,007 INFO L168 Benchmark]: RCFGBuilder took 630.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,007 INFO L168 Benchmark]: TraceAbstraction took 48237.74 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,010 INFO L168 Benchmark]: Witness Printer took 156.44 ms. Allocated memory is still 5.2 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:33,014 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.30 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.66 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 630.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48237.74 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 156.44 ms. Allocated memory is still 5.2 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. SAFE Result, 48.1s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 22.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, 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: 21.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...