./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_12_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_12_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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:36,599 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:59:36,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:59:36,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:59:36,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:59:36,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:59:36,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:59:36,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:59:36,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:59:36,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:59:36,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:59:36,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:59:36,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:59:36,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:59:36,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:59:36,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:59:36,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:59:36,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:59:36,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:59:36,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:59:36,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:59:36,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:59:36,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:59:36,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:59:36,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:59:36,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:59:36,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:59:36,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:59:36,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:59:36,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:59:36,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:59:36,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:59:36,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:59:36,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:59:36,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:59:36,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:59:36,654 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:36,670 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:59:36,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:59:36,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:59:36,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:59:36,674 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:59:36,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:59:36,674 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:59:36,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:59:36,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:59:36,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:59:36,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:59:36,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:59:36,676 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:59:36,676 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:59:36,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:59:36,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:59:36,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:59:36,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:59:36,677 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:59:36,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:59:36,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:59:36,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:59:36,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:59:36,679 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:59:36,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:59:36,680 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:59:36,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:59:36,680 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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2019-01-14 14:59:36,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:59:36,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:59:36,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:59:36,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:59:36,737 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:59:36,737 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:36,796 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1685ce2f3/418b600dfa224ba7bab6eb6c117641e1/FLAGd6aeab7fd [2019-01-14 14:59:37,212 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:59:37,213 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:37,221 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1685ce2f3/418b600dfa224ba7bab6eb6c117641e1/FLAGd6aeab7fd [2019-01-14 14:59:37,605 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1685ce2f3/418b600dfa224ba7bab6eb6c117641e1 [2019-01-14 14:59:37,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:59:37,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:59:37,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:37,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:59:37,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:59:37,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:37" (1/1) ... [2019-01-14 14:59:37,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bc7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:37, skipping insertion in model container [2019-01-14 14:59:37,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:59:37" (1/1) ... [2019-01-14 14:59:37,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:59:37,673 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:59:37,933 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:37,939 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:59:37,981 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:59:38,002 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:59:38,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:38 WrapperNode [2019-01-14 14:59:38,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:59:38,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:38,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:59:38,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:59:38,014 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:38" (1/1) ... [2019-01-14 14:59:38,021 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:38" (1/1) ... [2019-01-14 14:59:38,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:59:38,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:59:38,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:59:38,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:59:38,137 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:38" (1/1) ... [2019-01-14 14:59:38,137 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:38" (1/1) ... [2019-01-14 14:59:38,140 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:38" (1/1) ... [2019-01-14 14:59:38,141 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:38" (1/1) ... [2019-01-14 14:59:38,150 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:38" (1/1) ... [2019-01-14 14:59:38,165 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:38" (1/1) ... [2019-01-14 14:59:38,173 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:38" (1/1) ... [2019-01-14 14:59:38,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:59:38,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:59:38,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:59:38,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:59:38,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:38" (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:38,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:59:38,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:59:38,952 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:59:38,953 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 14:59:38,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:38 BoogieIcfgContainer [2019-01-14 14:59:38,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:59:38,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:59:38,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:59:38,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:59:38,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:59:37" (1/3) ... [2019-01-14 14:59:38,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b88bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:38, skipping insertion in model container [2019-01-14 14:59:38,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:59:38" (2/3) ... [2019-01-14 14:59:38,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b88bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:59:38, skipping insertion in model container [2019-01-14 14:59:38,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:59:38" (3/3) ... [2019-01-14 14:59:38,962 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 14:59:38,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:59:38,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:59:38,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:59:39,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:59:39,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:59:39,029 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:59:39,029 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:59:39,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:59:39,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:59:39,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:59:39,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:59:39,030 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:59:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-14 14:59:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 14:59:39,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:39,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-01-14 14:59:39,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,262 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:39,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,286 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-01-14 14:59:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:39,341 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-01-14 14:59:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:39,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 14:59:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:39,355 INFO L225 Difference]: With dead ends: 94 [2019-01-14 14:59:39,355 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 14:59:39,358 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:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 14:59:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-01-14 14:59:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 14:59:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-01-14 14:59:39,402 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-01-14 14:59:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:39,403 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-01-14 14:59:39,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-01-14 14:59:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 14:59:39,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:59:39,405 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-01-14 14:59:39,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,469 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:39,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,472 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-01-14 14:59:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:39,537 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-01-14 14:59:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:39,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 14:59:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:39,544 INFO L225 Difference]: With dead ends: 133 [2019-01-14 14:59:39,546 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 14:59:39,548 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:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 14:59:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-14 14:59:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 14:59:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-01-14 14:59:39,570 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-01-14 14:59:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:39,571 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-01-14 14:59:39,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-01-14 14:59:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:39,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,572 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:39,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,574 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-01-14 14:59:39,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,681 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:39,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,686 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-01-14 14:59:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:39,720 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-01-14 14:59:39,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:39,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:39,722 INFO L225 Difference]: With dead ends: 122 [2019-01-14 14:59:39,723 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 14:59:39,723 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:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 14:59:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-01-14 14:59:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-14 14:59:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-01-14 14:59:39,733 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-01-14 14:59:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:39,734 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-01-14 14:59:39,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-01-14 14:59:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:39,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,736 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:39,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-01-14 14:59:39,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,845 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:39,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,847 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-01-14 14:59:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:39,888 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-01-14 14:59:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:39,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:39,890 INFO L225 Difference]: With dead ends: 156 [2019-01-14 14:59:39,890 INFO L226 Difference]: Without dead ends: 154 [2019-01-14 14:59:39,891 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:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-14 14:59:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-01-14 14:59:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 14:59:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-01-14 14:59:39,903 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-01-14 14:59:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:39,904 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-01-14 14:59:39,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-01-14 14:59:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 14:59:39,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:39,906 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:39,907 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-01-14 14:59:39,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:39,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:39,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:39,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:39,968 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:39,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:39,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:39,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:39,971 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-01-14 14:59:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,073 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-01-14 14:59:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 14:59:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,076 INFO L225 Difference]: With dead ends: 260 [2019-01-14 14:59:40,077 INFO L226 Difference]: Without dead ends: 156 [2019-01-14 14:59:40,078 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:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-14 14:59:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-01-14 14:59:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 14:59:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-01-14 14:59:40,091 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-01-14 14:59:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,091 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-01-14 14:59:40,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-01-14 14:59:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:40,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,094 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:40,094 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-01-14 14:59:40,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,155 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:40,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:40,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:40,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:40,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:40,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,156 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-01-14 14:59:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,181 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-01-14 14:59:40,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,183 INFO L225 Difference]: With dead ends: 233 [2019-01-14 14:59:40,183 INFO L226 Difference]: Without dead ends: 158 [2019-01-14 14:59:40,184 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:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-14 14:59:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-01-14 14:59:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-14 14:59:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-01-14 14:59:40,200 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-01-14 14:59:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,200 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-01-14 14:59:40,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-01-14 14:59:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:40,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,202 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:40,203 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-01-14 14:59:40,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,319 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:40,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:40,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:40,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:40,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:40,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,323 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-01-14 14:59:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,390 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-01-14 14:59:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,394 INFO L225 Difference]: With dead ends: 452 [2019-01-14 14:59:40,394 INFO L226 Difference]: Without dead ends: 302 [2019-01-14 14:59:40,395 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:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-14 14:59:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-01-14 14:59:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-14 14:59:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-01-14 14:59:40,424 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-01-14 14:59:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,424 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-01-14 14:59:40,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-01-14 14:59:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 14:59:40,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,426 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:40,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-01-14 14:59:40,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,504 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:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:40,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:40,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:40,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:40,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,506 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-01-14 14:59:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,582 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-01-14 14:59:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 14:59:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,585 INFO L225 Difference]: With dead ends: 384 [2019-01-14 14:59:40,585 INFO L226 Difference]: Without dead ends: 382 [2019-01-14 14:59:40,586 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:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-14 14:59:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-01-14 14:59:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-14 14:59:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-01-14 14:59:40,599 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-01-14 14:59:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,599 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-01-14 14:59:40,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-01-14 14:59:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:40,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,601 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:40,601 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-01-14 14:59:40,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,673 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:40,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:40,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:40,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,675 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-01-14 14:59:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,763 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-01-14 14:59:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,769 INFO L225 Difference]: With dead ends: 564 [2019-01-14 14:59:40,770 INFO L226 Difference]: Without dead ends: 562 [2019-01-14 14:59:40,770 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:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-01-14 14:59:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-01-14 14:59:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-14 14:59:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-01-14 14:59:40,788 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-01-14 14:59:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,789 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-01-14 14:59:40,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:40,789 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-01-14 14:59:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 14:59:40,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:40,792 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:40,794 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-01-14 14:59:40,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:40,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:40,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:40,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:40,869 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:40,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:40,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:40,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:40,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:40,871 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-01-14 14:59:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:40,967 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-01-14 14:59:40,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:40,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 14:59:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:40,973 INFO L225 Difference]: With dead ends: 996 [2019-01-14 14:59:40,974 INFO L226 Difference]: Without dead ends: 586 [2019-01-14 14:59:40,975 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:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-01-14 14:59:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-01-14 14:59:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-01-14 14:59:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-01-14 14:59:40,999 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-01-14 14:59:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:40,999 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-01-14 14:59:40,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-01-14 14:59:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:41,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:41,003 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:41,003 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-01-14 14:59:41,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:41,075 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:41,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:41,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:41,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:41,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:41,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:41,078 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-01-14 14:59:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:41,175 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-01-14 14:59:41,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:41,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:41,180 INFO L225 Difference]: With dead ends: 884 [2019-01-14 14:59:41,180 INFO L226 Difference]: Without dead ends: 598 [2019-01-14 14:59:41,181 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:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-01-14 14:59:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-01-14 14:59:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-01-14 14:59:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-01-14 14:59:41,214 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-01-14 14:59:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:41,215 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-01-14 14:59:41,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-01-14 14:59:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:41,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:41,219 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:41,220 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:41,220 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-01-14 14:59:41,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:41,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:41,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:41,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:41,295 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:41,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:41,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:41,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:41,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:41,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:41,297 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-01-14 14:59:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:41,411 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-01-14 14:59:41,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:41,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:41,420 INFO L225 Difference]: With dead ends: 1096 [2019-01-14 14:59:41,420 INFO L226 Difference]: Without dead ends: 1094 [2019-01-14 14:59:41,421 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:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-01-14 14:59:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-01-14 14:59:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-01-14 14:59:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-01-14 14:59:41,468 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-01-14 14:59:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:41,468 INFO L480 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-01-14 14:59:41,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-01-14 14:59:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 14:59:41,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:41,472 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:41,473 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-01-14 14:59:41,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:41,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:41,549 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:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:41,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:41,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:41,552 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-01-14 14:59:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:41,680 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-01-14 14:59:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:41,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 14:59:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:41,689 INFO L225 Difference]: With dead ends: 1976 [2019-01-14 14:59:41,690 INFO L226 Difference]: Without dead ends: 1158 [2019-01-14 14:59:41,691 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:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-01-14 14:59:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-01-14 14:59:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-01-14 14:59:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-01-14 14:59:41,735 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-01-14 14:59:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:41,735 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-01-14 14:59:41,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-01-14 14:59:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:41,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:41,740 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:41,740 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-01-14 14:59:41,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:41,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:41,816 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:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:41,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:41,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:41,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:41,818 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-01-14 14:59:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:41,925 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-01-14 14:59:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:41,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:41,934 INFO L225 Difference]: With dead ends: 1736 [2019-01-14 14:59:41,934 INFO L226 Difference]: Without dead ends: 1174 [2019-01-14 14:59:41,936 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:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-01-14 14:59:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-01-14 14:59:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-01-14 14:59:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-01-14 14:59:41,981 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-01-14 14:59:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:41,981 INFO L480 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-01-14 14:59:41,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-01-14 14:59:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:41,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:41,984 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:41,985 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:41,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:41,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-01-14 14:59:41,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:41,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:41,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,030 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:42,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:42,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:42,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:42,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,033 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-01-14 14:59:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:42,143 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-01-14 14:59:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:42,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:42,156 INFO L225 Difference]: With dead ends: 2120 [2019-01-14 14:59:42,157 INFO L226 Difference]: Without dead ends: 2118 [2019-01-14 14:59:42,158 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:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-01-14 14:59:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-01-14 14:59:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-01-14 14:59:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-01-14 14:59:42,221 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-01-14 14:59:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:42,221 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-01-14 14:59:42,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-01-14 14:59:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 14:59:42,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:42,225 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:42,226 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-01-14 14:59:42,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:42,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:42,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,295 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:42,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:42,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:42,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,296 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-01-14 14:59:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:42,423 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-01-14 14:59:42,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:42,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 14:59:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:42,434 INFO L225 Difference]: With dead ends: 3912 [2019-01-14 14:59:42,434 INFO L226 Difference]: Without dead ends: 2278 [2019-01-14 14:59:42,437 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:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-01-14 14:59:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-01-14 14:59:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-01-14 14:59:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-01-14 14:59:42,513 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-01-14 14:59:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:42,513 INFO L480 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-01-14 14:59:42,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-01-14 14:59:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:42,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:42,517 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:42,517 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-01-14 14:59:42,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:42,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,588 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:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:42,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,590 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-01-14 14:59:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:42,706 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-01-14 14:59:42,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:42,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:42,719 INFO L225 Difference]: With dead ends: 3416 [2019-01-14 14:59:42,719 INFO L226 Difference]: Without dead ends: 2310 [2019-01-14 14:59:42,721 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:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-01-14 14:59:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-01-14 14:59:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-01-14 14:59:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-01-14 14:59:42,824 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-01-14 14:59:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:42,824 INFO L480 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-01-14 14:59:42,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-01-14 14:59:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:42,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:42,828 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:42,829 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:42,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-01-14 14:59:42,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:42,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:42,902 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:42,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:42,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:42,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:42,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:42,903 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-01-14 14:59:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:43,046 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-01-14 14:59:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:43,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:43,067 INFO L225 Difference]: With dead ends: 4104 [2019-01-14 14:59:43,067 INFO L226 Difference]: Without dead ends: 4102 [2019-01-14 14:59:43,069 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:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-01-14 14:59:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-01-14 14:59:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-01-14 14:59:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-01-14 14:59:43,184 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-01-14 14:59:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:43,185 INFO L480 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-01-14 14:59:43,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-01-14 14:59:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 14:59:43,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:43,194 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:43,194 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-01-14 14:59:43,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:43,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:43,270 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:43,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:43,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:43,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:43,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:43,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:43,271 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-01-14 14:59:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:43,443 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-01-14 14:59:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:43,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-14 14:59:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:43,464 INFO L225 Difference]: With dead ends: 7752 [2019-01-14 14:59:43,464 INFO L226 Difference]: Without dead ends: 4486 [2019-01-14 14:59:43,469 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:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-01-14 14:59:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-01-14 14:59:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-01-14 14:59:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-01-14 14:59:43,605 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-01-14 14:59:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:43,605 INFO L480 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-01-14 14:59:43,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-01-14 14:59:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:43,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:43,614 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:43,614 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-01-14 14:59:43,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:43,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:43,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:43,690 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:43,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:43,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:43,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:43,693 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-01-14 14:59:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:43,848 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-01-14 14:59:43,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:43,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:43,883 INFO L225 Difference]: With dead ends: 6728 [2019-01-14 14:59:43,886 INFO L226 Difference]: Without dead ends: 4550 [2019-01-14 14:59:43,893 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:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-01-14 14:59:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-01-14 14:59:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-01-14 14:59:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-01-14 14:59:44,020 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-01-14 14:59:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:44,020 INFO L480 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-01-14 14:59:44,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-01-14 14:59:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:44,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:44,028 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:44,028 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-01-14 14:59:44,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:44,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:44,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:44,102 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,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:44,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:44,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:44,103 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-01-14 14:59:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:44,299 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-01-14 14:59:44,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:44,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:44,322 INFO L225 Difference]: With dead ends: 7944 [2019-01-14 14:59:44,323 INFO L226 Difference]: Without dead ends: 7942 [2019-01-14 14:59:44,327 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:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-01-14 14:59:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-01-14 14:59:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-01-14 14:59:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-01-14 14:59:44,508 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-01-14 14:59:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:44,509 INFO L480 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-01-14 14:59:44,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-01-14 14:59:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 14:59:44,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:44,519 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:44,519 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-01-14 14:59:44,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:44,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:44,592 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,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:44,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:44,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:44,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:44,594 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-01-14 14:59:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:44,852 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-01-14 14:59:44,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:44,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 14:59:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:44,872 INFO L225 Difference]: With dead ends: 15368 [2019-01-14 14:59:44,872 INFO L226 Difference]: Without dead ends: 8838 [2019-01-14 14:59:44,883 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:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-01-14 14:59:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-01-14 14:59:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-01-14 14:59:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-01-14 14:59:45,155 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-01-14 14:59:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,156 INFO L480 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-01-14 14:59:45,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-01-14 14:59:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:45,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,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] [2019-01-14 14:59:45,168 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-01-14 14:59:45,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,246 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,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,247 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-01-14 14:59:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:45,448 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-01-14 14:59:45,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:45,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:45,471 INFO L225 Difference]: With dead ends: 13256 [2019-01-14 14:59:45,471 INFO L226 Difference]: Without dead ends: 8966 [2019-01-14 14:59:45,482 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,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-01-14 14:59:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-01-14 14:59:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-01-14 14:59:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-01-14 14:59:45,762 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-01-14 14:59:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:45,762 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-01-14 14:59:45,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-01-14 14:59:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:45,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:45,775 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:45,775 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:45,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-01-14 14:59:45,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:45,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:45,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:45,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:45,846 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,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:45,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:45,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:45,849 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-01-14 14:59:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:46,135 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-01-14 14:59:46,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:46,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:46,164 INFO L225 Difference]: With dead ends: 15368 [2019-01-14 14:59:46,164 INFO L226 Difference]: Without dead ends: 15366 [2019-01-14 14:59:46,170 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,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-01-14 14:59:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-01-14 14:59:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-01-14 14:59:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-01-14 14:59:46,567 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-01-14 14:59:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:46,567 INFO L480 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-01-14 14:59:46,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-01-14 14:59:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 14:59:46,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:46,599 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:46,600 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-01-14 14:59:46,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:46,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:46,676 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,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:46,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:46,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:46,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:46,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:46,677 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-01-14 14:59:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,083 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-01-14 14:59:47,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-14 14:59:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,117 INFO L225 Difference]: With dead ends: 30472 [2019-01-14 14:59:47,118 INFO L226 Difference]: Without dead ends: 17414 [2019-01-14 14:59:47,132 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,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-01-14 14:59:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-01-14 14:59:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-01-14 14:59:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-01-14 14:59:47,445 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-01-14 14:59:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:47,446 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-01-14 14:59:47,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-01-14 14:59:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:47,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:47,466 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:47,466 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-01-14 14:59:47,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:47,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:47,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:47,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:47,537 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,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:47,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:47,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:47,538 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-01-14 14:59:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:47,848 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-01-14 14:59:47,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:47,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:47,880 INFO L225 Difference]: With dead ends: 26120 [2019-01-14 14:59:47,880 INFO L226 Difference]: Without dead ends: 17670 [2019-01-14 14:59:47,892 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,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-01-14 14:59:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-01-14 14:59:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-01-14 14:59:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-01-14 14:59:48,404 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-01-14 14:59:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:48,404 INFO L480 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-01-14 14:59:48,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-01-14 14:59:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:48,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:48,417 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:48,418 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-01-14 14:59:48,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:48,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:48,479 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,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:48,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:48,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:48,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:48,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:48,481 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-01-14 14:59:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:49,122 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-01-14 14:59:49,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:49,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:49,158 INFO L225 Difference]: With dead ends: 29704 [2019-01-14 14:59:49,158 INFO L226 Difference]: Without dead ends: 29702 [2019-01-14 14:59:49,167 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,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-01-14 14:59:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-01-14 14:59:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-01-14 14:59:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-01-14 14:59:49,740 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-01-14 14:59:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:49,741 INFO L480 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-01-14 14:59:49,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-01-14 14:59:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 14:59:49,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:49,760 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:49,760 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-01-14 14:59:49,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:49,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:49,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:49,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:49,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:49,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:49,825 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-01-14 14:59:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:50,561 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-01-14 14:59:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:50,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-14 14:59:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:50,601 INFO L225 Difference]: With dead ends: 60424 [2019-01-14 14:59:50,601 INFO L226 Difference]: Without dead ends: 34310 [2019-01-14 14:59:50,628 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,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-01-14 14:59:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-01-14 14:59:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-01-14 14:59:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-01-14 14:59:51,233 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-01-14 14:59:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:51,234 INFO L480 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-01-14 14:59:51,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-01-14 14:59:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:51,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:51,248 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:51,249 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-01-14 14:59:51,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:51,321 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,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:51,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:51,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:51,322 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-01-14 14:59:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:51,963 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-01-14 14:59:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:51,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:51,994 INFO L225 Difference]: With dead ends: 51464 [2019-01-14 14:59:51,994 INFO L226 Difference]: Without dead ends: 34822 [2019-01-14 14:59:52,007 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,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-01-14 14:59:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-01-14 14:59:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-01-14 14:59:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-01-14 14:59:52,668 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-01-14 14:59:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:52,668 INFO L480 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-01-14 14:59:52,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-01-14 14:59:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:52,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:52,682 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:52,683 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-01-14 14:59:52,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:52,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:52,748 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,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:52,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:52,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:52,751 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-01-14 14:59:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:53,794 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-01-14 14:59:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:53,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:53,854 INFO L225 Difference]: With dead ends: 101384 [2019-01-14 14:59:53,854 INFO L226 Difference]: Without dead ends: 67590 [2019-01-14 14:59:53,880 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,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-01-14 14:59:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-01-14 14:59:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-01-14 14:59:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-01-14 14:59:55,378 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-01-14 14:59:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:55,378 INFO L480 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-01-14 14:59:55,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-01-14 14:59:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 14:59:55,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:55,410 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,411 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-01-14 14:59:55,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:55,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:55,480 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,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:55,481 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-01-14 14:59:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:59:57,231 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-01-14 14:59:57,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:59:57,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 14:59:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:59:57,284 INFO L225 Difference]: With dead ends: 71688 [2019-01-14 14:59:57,284 INFO L226 Difference]: Without dead ends: 71686 [2019-01-14 14:59:57,295 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,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-01-14 14:59:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-01-14 14:59:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-01-14 14:59:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-01-14 14:59:58,406 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-01-14 14:59:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:59:58,406 INFO L480 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-01-14 14:59:58,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:59:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-01-14 14:59:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 14:59:58,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:59:58,433 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,434 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:59:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:59:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-01-14 14:59:58,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:59:58,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:59:58,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:59:58,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:59:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:59:58,493 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,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:59:58,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:59:58,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:59:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:59:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:59:58,495 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-01-14 15:00:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:00,447 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-01-14 15:00:00,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:00,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 15:00:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:00,529 INFO L225 Difference]: With dead ends: 109574 [2019-01-14 15:00:00,529 INFO L226 Difference]: Without dead ends: 109572 [2019-01-14 15:00:00,545 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,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-01-14 15:00:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-01-14 15:00:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-01-14 15:00:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-01-14 15:00:02,597 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-01-14 15:00:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:02,597 INFO L480 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-01-14 15:00:02,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-01-14 15:00:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 15:00:02,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:02,656 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:02,657 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:02,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-01-14 15:00:02,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:02,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:02,716 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:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:02,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:02,718 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-01-14 15:00:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:04,427 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-01-14 15:00:04,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:04,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 15:00:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:04,428 INFO L225 Difference]: With dead ends: 236548 [2019-01-14 15:00:04,428 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:00:04,493 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:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:00:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:00:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:00:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:00:04,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-01-14 15:00:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:04,494 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:00:04,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:00:04,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:00:04,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:00:04,588 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,588 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,588 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,588 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-14 15:00:04,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:04,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,589 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-14 15:00:04,590 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-14 15:00:04,591 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,591 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,597 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-01-14 15:00:04,597 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-14 15:00:04,597 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:04,597 INFO L451 ceAbstractionStarter]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-01-14 15:00:04,597 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-14 15:00:04,597 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-01-14 15:00:04,597 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-01-14 15:00:04,598 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-01-14 15:00:04,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:04 BoogieIcfgContainer [2019-01-14 15:00:04,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:04,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:04,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:04,615 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:04,616 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:38" (3/4) ... [2019-01-14 15:00:04,622 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:04,640 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:00:04,641 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:04,764 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:04,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:04,766 INFO L168 Benchmark]: Toolchain (without parser) took 27154.00 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -122.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-14 15:00:04,768 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:04,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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:04,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.34 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 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:04,769 INFO L168 Benchmark]: Boogie Preprocessor took 113.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:04,771 INFO L168 Benchmark]: RCFGBuilder took 778.63 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:04,771 INFO L168 Benchmark]: TraceAbstraction took 25659.20 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-14 15:00:04,772 INFO L168 Benchmark]: Witness Printer took 149.47 ms. Allocated memory is still 3.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 15:00:04,776 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.34 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 778.63 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25659.20 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 149.47 ms. Allocated memory is still 3.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. SAFE Result, 25.5s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, 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: 9.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 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.0s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...