./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_9_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 5107685577f81a5867811396b2c0a05eb5630c95 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:10:47,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:47,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:47,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:47,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:47,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:47,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:47,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:47,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:47,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:47,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:47,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:47,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:47,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:47,626 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:47,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:47,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:47,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:47,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:47,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:47,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:47,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:47,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:47,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:47,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:47,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:47,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:47,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:47,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:47,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:47,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:47,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:47,651 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:47,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:47,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:47,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:47,653 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:10:47,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:47,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:47,669 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:47,669 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:47,669 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:47,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:47,670 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:47,670 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:47,670 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:47,670 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:47,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:47,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:47,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:47,671 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:47,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:47,671 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:47,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:47,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:47,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:47,672 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:47,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:47,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:47,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:47,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:47,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:47,673 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:47,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:47,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:47,673 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-12-30 16:10:47,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:47,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:47,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:47,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:47,753 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:47,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:47,820 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2a8b9c3/38b0511b876e4301b87b81aef5fae05e/FLAG1d0e7de99 [2018-12-30 16:10:48,303 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:48,305 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:48,315 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2a8b9c3/38b0511b876e4301b87b81aef5fae05e/FLAG1d0e7de99 [2018-12-30 16:10:48,629 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2a8b9c3/38b0511b876e4301b87b81aef5fae05e [2018-12-30 16:10:48,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:48,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:48,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:48,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:48,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:48,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48, skipping insertion in model container [2018-12-30 16:10:48,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:48,679 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:48,857 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:48,862 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:48,889 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:48,902 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:48,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48 WrapperNode [2018-12-30 16:10:48,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:48,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:48,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:48,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:48,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:48,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:48,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:48,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:48,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (1/1) ... [2018-12-30 16:10:48,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:48,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:48,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:48,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:48,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (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 [2018-12-30 16:10:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:49,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:49,647 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:49,648 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:49,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:49 BoogieIcfgContainer [2018-12-30 16:10:49,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:49,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:49,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:49,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:49,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:48" (1/3) ... [2018-12-30 16:10:49,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe7ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:49, skipping insertion in model container [2018-12-30 16:10:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:48" (2/3) ... [2018-12-30 16:10:49,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe7ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:49, skipping insertion in model container [2018-12-30 16:10:49,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:49" (3/3) ... [2018-12-30 16:10:49,657 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:49,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:49,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:49,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:49,728 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:49,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:49,729 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:49,729 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:49,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:49,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:49,730 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:49,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:49,730 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-30 16:10:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:49,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:49,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:49,759 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2018-12-30 16:10:49,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:49,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:49,985 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-12-30 16:10:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,065 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2018-12-30 16:10:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,078 INFO L225 Difference]: With dead ends: 76 [2018-12-30 16:10:50,078 INFO L226 Difference]: Without dead ends: 62 [2018-12-30 16:10:50,081 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 [2018-12-30 16:10:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-30 16:10:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2018-12-30 16:10:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-30 16:10:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2018-12-30 16:10:50,120 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2018-12-30 16:10:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,121 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2018-12-30 16:10:50,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2018-12-30 16:10:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-30 16:10:50,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2018-12-30 16:10:50,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,211 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2018-12-30 16:10:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,247 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2018-12-30 16:10:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-30 16:10:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,250 INFO L225 Difference]: With dead ends: 103 [2018-12-30 16:10:50,250 INFO L226 Difference]: Without dead ends: 62 [2018-12-30 16:10:50,251 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 [2018-12-30 16:10:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-30 16:10:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-12-30 16:10:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-30 16:10:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2018-12-30 16:10:50,261 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2018-12-30 16:10:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,262 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2018-12-30 16:10:50,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2018-12-30 16:10:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:50,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,264 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2018-12-30 16:10:50,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,317 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2018-12-30 16:10:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,371 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2018-12-30 16:10:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,374 INFO L225 Difference]: With dead ends: 95 [2018-12-30 16:10:50,374 INFO L226 Difference]: Without dead ends: 65 [2018-12-30 16:10:50,375 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 [2018-12-30 16:10:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-30 16:10:50,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-30 16:10:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-30 16:10:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2018-12-30 16:10:50,383 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2018-12-30 16:10:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,384 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2018-12-30 16:10:50,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2018-12-30 16:10:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:50,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,386 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2018-12-30 16:10:50,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,455 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2018-12-30 16:10:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,523 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2018-12-30 16:10:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,526 INFO L225 Difference]: With dead ends: 120 [2018-12-30 16:10:50,526 INFO L226 Difference]: Without dead ends: 118 [2018-12-30 16:10:50,527 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 [2018-12-30 16:10:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-30 16:10:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2018-12-30 16:10:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-30 16:10:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2018-12-30 16:10:50,549 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2018-12-30 16:10:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,550 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2018-12-30 16:10:50,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2018-12-30 16:10:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:10:50,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,551 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2018-12-30 16:10:50,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,632 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2018-12-30 16:10:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,704 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2018-12-30 16:10:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:10:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,706 INFO L225 Difference]: With dead ends: 200 [2018-12-30 16:10:50,707 INFO L226 Difference]: Without dead ends: 120 [2018-12-30 16:10:50,709 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 [2018-12-30 16:10:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-30 16:10:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-12-30 16:10:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-30 16:10:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2018-12-30 16:10:50,721 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2018-12-30 16:10:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,722 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2018-12-30 16:10:50,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2018-12-30 16:10:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:50,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,724 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2018-12-30 16:10:50,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,801 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2018-12-30 16:10:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,842 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2018-12-30 16:10:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,844 INFO L225 Difference]: With dead ends: 179 [2018-12-30 16:10:50,844 INFO L226 Difference]: Without dead ends: 122 [2018-12-30 16:10:50,845 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 [2018-12-30 16:10:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-30 16:10:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-12-30 16:10:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-30 16:10:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2018-12-30 16:10:50,855 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2018-12-30 16:10:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,855 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2018-12-30 16:10:50,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2018-12-30 16:10:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:50,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,857 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2018-12-30 16:10:50,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:50,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:50,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:50,915 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2018-12-30 16:10:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:50,967 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2018-12-30 16:10:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:50,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:50,970 INFO L225 Difference]: With dead ends: 344 [2018-12-30 16:10:50,970 INFO L226 Difference]: Without dead ends: 230 [2018-12-30 16:10:50,972 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 [2018-12-30 16:10:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-30 16:10:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-12-30 16:10:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-30 16:10:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2018-12-30 16:10:50,993 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2018-12-30 16:10:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:50,993 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2018-12-30 16:10:50,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2018-12-30 16:10:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:50,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:50,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:50,996 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2018-12-30 16:10:50,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:50,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:50,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:50,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,057 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2018-12-30 16:10:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,082 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2018-12-30 16:10:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,085 INFO L225 Difference]: With dead ends: 288 [2018-12-30 16:10:51,086 INFO L226 Difference]: Without dead ends: 286 [2018-12-30 16:10:51,086 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 [2018-12-30 16:10:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-30 16:10:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2018-12-30 16:10:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-30 16:10:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2018-12-30 16:10:51,100 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2018-12-30 16:10:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,101 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2018-12-30 16:10:51,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2018-12-30 16:10:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:51,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,104 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2018-12-30 16:10:51,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,184 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2018-12-30 16:10:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,244 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2018-12-30 16:10:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,250 INFO L225 Difference]: With dead ends: 420 [2018-12-30 16:10:51,250 INFO L226 Difference]: Without dead ends: 418 [2018-12-30 16:10:51,250 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 [2018-12-30 16:10:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-12-30 16:10:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2018-12-30 16:10:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-30 16:10:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2018-12-30 16:10:51,272 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2018-12-30 16:10:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,275 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2018-12-30 16:10:51,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2018-12-30 16:10:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:51,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,283 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2018-12-30 16:10:51,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,348 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2018-12-30 16:10:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,426 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2018-12-30 16:10:51,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,431 INFO L225 Difference]: With dead ends: 756 [2018-12-30 16:10:51,431 INFO L226 Difference]: Without dead ends: 442 [2018-12-30 16:10:51,432 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 [2018-12-30 16:10:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-12-30 16:10:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2018-12-30 16:10:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-12-30 16:10:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2018-12-30 16:10:51,462 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2018-12-30 16:10:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,463 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2018-12-30 16:10:51,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2018-12-30 16:10:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:51,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,465 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2018-12-30 16:10:51,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,554 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2018-12-30 16:10:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,620 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2018-12-30 16:10:51,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,625 INFO L225 Difference]: With dead ends: 668 [2018-12-30 16:10:51,625 INFO L226 Difference]: Without dead ends: 454 [2018-12-30 16:10:51,626 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 [2018-12-30 16:10:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-30 16:10:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2018-12-30 16:10:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-12-30 16:10:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2018-12-30 16:10:51,644 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2018-12-30 16:10:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,644 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2018-12-30 16:10:51,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2018-12-30 16:10:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:51,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,646 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2018-12-30 16:10:51,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,739 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2018-12-30 16:10:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:51,838 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2018-12-30 16:10:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:51,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:51,843 INFO L225 Difference]: With dead ends: 808 [2018-12-30 16:10:51,843 INFO L226 Difference]: Without dead ends: 806 [2018-12-30 16:10:51,843 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 [2018-12-30 16:10:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-12-30 16:10:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2018-12-30 16:10:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-12-30 16:10:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2018-12-30 16:10:51,871 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2018-12-30 16:10:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,871 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2018-12-30 16:10:51,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2018-12-30 16:10:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:51,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,875 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2018-12-30 16:10:51,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,945 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2018-12-30 16:10:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,062 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2018-12-30 16:10:52,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,067 INFO L225 Difference]: With dead ends: 1496 [2018-12-30 16:10:52,068 INFO L226 Difference]: Without dead ends: 870 [2018-12-30 16:10:52,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 [2018-12-30 16:10:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-12-30 16:10:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2018-12-30 16:10:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-12-30 16:10:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2018-12-30 16:10:52,106 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2018-12-30 16:10:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,107 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2018-12-30 16:10:52,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2018-12-30 16:10:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:52,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,109 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] [2018-12-30 16:10:52,109 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2018-12-30 16:10:52,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,194 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2018-12-30 16:10:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,317 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2018-12-30 16:10:52,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,326 INFO L225 Difference]: With dead ends: 1304 [2018-12-30 16:10:52,326 INFO L226 Difference]: Without dead ends: 886 [2018-12-30 16:10:52,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 [2018-12-30 16:10:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-12-30 16:10:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2018-12-30 16:10:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-12-30 16:10:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2018-12-30 16:10:52,364 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2018-12-30 16:10:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,364 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2018-12-30 16:10:52,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2018-12-30 16:10:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:52,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,367 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] [2018-12-30 16:10:52,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2018-12-30 16:10:52,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,444 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2018-12-30 16:10:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,549 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2018-12-30 16:10:52,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,557 INFO L225 Difference]: With dead ends: 1544 [2018-12-30 16:10:52,557 INFO L226 Difference]: Without dead ends: 1542 [2018-12-30 16:10:52,558 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 [2018-12-30 16:10:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-30 16:10:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2018-12-30 16:10:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2018-12-30 16:10:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2018-12-30 16:10:52,607 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2018-12-30 16:10:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,607 INFO L480 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2018-12-30 16:10:52,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2018-12-30 16:10:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:52,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,610 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] [2018-12-30 16:10:52,610 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,610 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2018-12-30 16:10:52,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,684 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2018-12-30 16:10:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,813 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2018-12-30 16:10:52,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,823 INFO L225 Difference]: With dead ends: 2952 [2018-12-30 16:10:52,823 INFO L226 Difference]: Without dead ends: 1702 [2018-12-30 16:10:52,826 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 [2018-12-30 16:10:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-12-30 16:10:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2018-12-30 16:10:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2018-12-30 16:10:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2018-12-30 16:10:52,893 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2018-12-30 16:10:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:52,893 INFO L480 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2018-12-30 16:10:52,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2018-12-30 16:10:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:52,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:52,897 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] [2018-12-30 16:10:52,897 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:52,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2018-12-30 16:10:52,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:52,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:52,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:52,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:52,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:52,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:52,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:52,965 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2018-12-30 16:10:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:53,077 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2018-12-30 16:10:53,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:53,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:53,086 INFO L225 Difference]: With dead ends: 2552 [2018-12-30 16:10:53,086 INFO L226 Difference]: Without dead ends: 1734 [2018-12-30 16:10:53,087 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 [2018-12-30 16:10:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2018-12-30 16:10:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2018-12-30 16:10:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2018-12-30 16:10:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2018-12-30 16:10:53,154 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2018-12-30 16:10:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:53,154 INFO L480 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2018-12-30 16:10:53,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2018-12-30 16:10:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:53,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:53,158 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] [2018-12-30 16:10:53,158 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2018-12-30 16:10:53,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:53,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:53,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:53,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:53,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:53,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:53,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,226 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2018-12-30 16:10:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:53,360 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2018-12-30 16:10:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:53,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:53,373 INFO L225 Difference]: With dead ends: 2952 [2018-12-30 16:10:53,373 INFO L226 Difference]: Without dead ends: 2950 [2018-12-30 16:10:53,375 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 [2018-12-30 16:10:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-12-30 16:10:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2018-12-30 16:10:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2018-12-30 16:10:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2018-12-30 16:10:53,477 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2018-12-30 16:10:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:53,478 INFO L480 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2018-12-30 16:10:53,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2018-12-30 16:10:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:53,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:53,484 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] [2018-12-30 16:10:53,484 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2018-12-30 16:10:53,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:53,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:53,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:53,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:53,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:53,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:53,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:53,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,551 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2018-12-30 16:10:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:53,722 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2018-12-30 16:10:53,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:53,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:53,737 INFO L225 Difference]: With dead ends: 5832 [2018-12-30 16:10:53,737 INFO L226 Difference]: Without dead ends: 3334 [2018-12-30 16:10:53,741 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 [2018-12-30 16:10:53,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2018-12-30 16:10:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2018-12-30 16:10:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2018-12-30 16:10:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2018-12-30 16:10:53,853 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2018-12-30 16:10:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:53,853 INFO L480 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2018-12-30 16:10:53,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2018-12-30 16:10:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:53,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:53,859 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] [2018-12-30 16:10:53,859 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2018-12-30 16:10:53,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:53,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:53,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:53,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:53,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:53,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,913 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2018-12-30 16:10:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:54,022 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2018-12-30 16:10:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:54,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:54,038 INFO L225 Difference]: With dead ends: 5000 [2018-12-30 16:10:54,038 INFO L226 Difference]: Without dead ends: 3398 [2018-12-30 16:10:54,041 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 [2018-12-30 16:10:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-12-30 16:10:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2018-12-30 16:10:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-12-30 16:10:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2018-12-30 16:10:54,155 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2018-12-30 16:10:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:54,155 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2018-12-30 16:10:54,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2018-12-30 16:10:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:54,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:54,161 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] [2018-12-30 16:10:54,161 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:54,162 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2018-12-30 16:10:54,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:54,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:54,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:54,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:54,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:54,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:54,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:54,230 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2018-12-30 16:10:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:54,426 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2018-12-30 16:10:54,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:54,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:54,450 INFO L225 Difference]: With dead ends: 5640 [2018-12-30 16:10:54,450 INFO L226 Difference]: Without dead ends: 5638 [2018-12-30 16:10:54,452 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 [2018-12-30 16:10:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2018-12-30 16:10:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2018-12-30 16:10:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2018-12-30 16:10:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2018-12-30 16:10:54,622 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2018-12-30 16:10:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:54,622 INFO L480 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2018-12-30 16:10:54,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2018-12-30 16:10:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:54,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:54,633 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] [2018-12-30 16:10:54,633 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:54,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2018-12-30 16:10:54,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:54,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:54,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:54,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:54,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:54,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:54,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:54,711 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2018-12-30 16:10:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:54,953 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2018-12-30 16:10:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:54,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:54,987 INFO L225 Difference]: With dead ends: 11528 [2018-12-30 16:10:54,988 INFO L226 Difference]: Without dead ends: 6534 [2018-12-30 16:10:54,995 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 [2018-12-30 16:10:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2018-12-30 16:10:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2018-12-30 16:10:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2018-12-30 16:10:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2018-12-30 16:10:55,203 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2018-12-30 16:10:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:55,203 INFO L480 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2018-12-30 16:10:55,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2018-12-30 16:10:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:55,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:55,213 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] [2018-12-30 16:10:55,214 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:55,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:55,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2018-12-30 16:10:55,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:55,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:55,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:55,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:55,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:55,283 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2018-12-30 16:10:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:55,531 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2018-12-30 16:10:55,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:55,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:55,543 INFO L225 Difference]: With dead ends: 9800 [2018-12-30 16:10:55,543 INFO L226 Difference]: Without dead ends: 6662 [2018-12-30 16:10:55,547 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 [2018-12-30 16:10:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2018-12-30 16:10:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2018-12-30 16:10:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2018-12-30 16:10:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2018-12-30 16:10:55,732 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2018-12-30 16:10:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:55,732 INFO L480 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2018-12-30 16:10:55,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2018-12-30 16:10:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:55,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:55,741 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] [2018-12-30 16:10:55,742 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2018-12-30 16:10:55,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:55,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:55,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:55,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:55,810 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2018-12-30 16:10:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:56,088 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2018-12-30 16:10:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:56,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:56,105 INFO L225 Difference]: With dead ends: 10758 [2018-12-30 16:10:56,105 INFO L226 Difference]: Without dead ends: 10756 [2018-12-30 16:10:56,109 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 [2018-12-30 16:10:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2018-12-30 16:10:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2018-12-30 16:10:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2018-12-30 16:10:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2018-12-30 16:10:56,374 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2018-12-30 16:10:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:56,375 INFO L480 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2018-12-30 16:10:56,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2018-12-30 16:10:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:56,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:56,389 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] [2018-12-30 16:10:56,389 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:56,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2018-12-30 16:10:56,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:56,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:56,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:56,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:56,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:56,452 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2018-12-30 16:10:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:56,787 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2018-12-30 16:10:56,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:56,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:56,788 INFO L225 Difference]: With dead ends: 22788 [2018-12-30 16:10:56,788 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:10:56,809 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 [2018-12-30 16:10:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:10:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:10:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:10:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:10:56,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-30 16:10:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:56,810 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:10:56,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:10:56,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:10:56,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:10:56,894 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:56,895 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-12-30 16:10:56,896 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:56,896 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,896 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,896 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-30 16:10:56,896 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-12-30 16:10:56,896 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,896 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,897 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-12-30 16:10:56,897 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,898 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,898 INFO L451 ceAbstractionStarter]: At program point L148(lines 4 149) the Hoare annotation is: true [2018-12-30 16:10:56,898 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 16:10:56,898 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-30 16:10:56,898 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-12-30 16:10:56,898 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,901 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:56,902 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-12-30 16:10:56,902 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 16:10:56,902 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-12-30 16:10:56,902 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,902 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-12-30 16:10:56,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:56 BoogieIcfgContainer [2018-12-30 16:10:56,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:56,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:56,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:56,913 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:56,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:49" (3/4) ... [2018-12-30 16:10:56,919 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:56,939 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:10:56,939 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:57,051 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:57,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:57,055 INFO L168 Benchmark]: Toolchain (without parser) took 8417.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 946.0 MB in the beginning and 903.9 MB in the end (delta: 42.1 MB). Peak memory consumption was 382.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:57,057 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-30 16:10:57,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.75 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:57,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.84 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:57,058 INFO L168 Benchmark]: Boogie Preprocessor took 26.34 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:57,058 INFO L168 Benchmark]: RCFGBuilder took 677.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:57,059 INFO L168 Benchmark]: TraceAbstraction took 7262.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 913.5 MB in the end (delta: 198.0 MB). Peak memory consumption was 391.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:57,059 INFO L168 Benchmark]: Witness Printer took 138.14 ms. Allocated memory is still 1.4 GB. Free memory was 913.5 MB in the beginning and 903.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:57,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 266.75 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 40.84 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.34 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 677.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7262.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 913.5 MB in the end (delta: 198.0 MB). Peak memory consumption was 391.0 MB. Max. memory is 11.5 GB. * Witness Printer took 138.14 ms. Allocated memory is still 1.4 GB. Free memory was 913.5 MB in the beginning and 903.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 36]: Loop Invariant Derived loop invariant: 1 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, 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: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 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, 1.4s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...