./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_6_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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 21:25:12,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:25:12,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:25:12,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:25:12,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:25:12,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:25:12,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:25:12,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:25:12,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:25:12,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:25:12,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:25:12,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:25:12,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:25:12,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:25:12,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:25:12,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:25:12,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:25:12,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:25:12,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:25:12,637 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:25:12,638 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:25:12,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:25:12,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:25:12,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:25:12,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:25:12,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:25:12,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:25:12,646 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:25:12,647 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:25:12,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:25:12,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:25:12,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:25:12,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:25:12,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:25:12,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:25:12,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:25:12,653 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:25:12,670 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:25:12,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:25:12,671 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:25:12,671 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:25:12,672 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:25:12,672 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:25:12,672 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:25:12,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:25:12,672 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:25:12,673 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:25:12,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:25:12,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:25:12,676 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:25:12,676 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:25:12,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:25:12,677 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:25:12,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:25:12,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:25:12,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:25:12,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:25:12,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:25:12,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:25:12,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:25:12,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:25:12,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:25:12,679 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:25:12,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:25:12,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:25:12,681 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2019-01-11 21:25:12,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:25:12,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:25:12,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:25:12,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:25:12,773 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:25:12,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:12,835 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0056a8e88/11910143f554421eb3aab47100a869b3/FLAG217ea58ad [2019-01-11 21:25:13,292 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:25:13,293 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:13,307 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0056a8e88/11910143f554421eb3aab47100a869b3/FLAG217ea58ad [2019-01-11 21:25:13,618 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0056a8e88/11910143f554421eb3aab47100a869b3 [2019-01-11 21:25:13,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:25:13,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:25:13,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:25:13,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:25:13,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:25:13,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72da797f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13, skipping insertion in model container [2019-01-11 21:25:13,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:25:13,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:25:13,837 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:25:13,841 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:25:13,863 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:25:13,875 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:25:13,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13 WrapperNode [2019-01-11 21:25:13,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:25:13,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:25:13,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:25:13,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:25:13,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:25:13,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:25:13,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:25:13,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:25:13,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... [2019-01-11 21:25:13,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:25:13,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:25:13,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:25:13,930 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:25:13,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:25:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:25:14,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:25:14,443 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:25:14,443 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 21:25:14,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:14 BoogieIcfgContainer [2019-01-11 21:25:14,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:25:14,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:25:14,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:25:14,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:25:14,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:25:13" (1/3) ... [2019-01-11 21:25:14,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730ce455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:25:14, skipping insertion in model container [2019-01-11 21:25:14,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:25:13" (2/3) ... [2019-01-11 21:25:14,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730ce455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:25:14, skipping insertion in model container [2019-01-11 21:25:14,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:14" (3/3) ... [2019-01-11 21:25:14,452 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:25:14,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:25:14,470 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:25:14,485 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:25:14,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:25:14,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:25:14,517 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:25:14,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:25:14,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:25:14,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:25:14,517 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:25:14,517 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:25:14,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:25:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-11 21:25:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 21:25:14,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:14,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:14,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash 502900931, now seen corresponding path program 1 times [2019-01-11 21:25:14,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:14,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:14,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:14,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:14,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:14,727 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-01-11 21:25:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:14,786 INFO L93 Difference]: Finished difference Result 58 states and 96 transitions. [2019-01-11 21:25:14,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:14,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-11 21:25:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:14,801 INFO L225 Difference]: With dead ends: 58 [2019-01-11 21:25:14,802 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 21:25:14,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 21:25:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-01-11 21:25:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 21:25:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-01-11 21:25:14,848 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 12 [2019-01-11 21:25:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:14,849 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-01-11 21:25:14,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-01-11 21:25:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 21:25:14,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:14,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:14,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1182959301, now seen corresponding path program 1 times [2019-01-11 21:25:14,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:14,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:14,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:14,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:14,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:14,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:14,967 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-01-11 21:25:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,070 INFO L93 Difference]: Finished difference Result 73 states and 128 transitions. [2019-01-11 21:25:15,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-11 21:25:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,073 INFO L225 Difference]: With dead ends: 73 [2019-01-11 21:25:15,073 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 21:25:15,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 21:25:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-01-11 21:25:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 21:25:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-01-11 21:25:15,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 12 [2019-01-11 21:25:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,084 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-01-11 21:25:15,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-01-11 21:25:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:25:15,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,086 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1589725680, now seen corresponding path program 1 times [2019-01-11 21:25:15,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,171 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-01-11 21:25:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,220 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-01-11 21:25:15,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:25:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,221 INFO L225 Difference]: With dead ends: 68 [2019-01-11 21:25:15,222 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 21:25:15,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 21:25:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-11 21:25:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 21:25:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2019-01-11 21:25:15,237 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 13 [2019-01-11 21:25:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,238 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2019-01-11 21:25:15,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2019-01-11 21:25:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:25:15,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,239 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1982752690, now seen corresponding path program 1 times [2019-01-11 21:25:15,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,321 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2019-01-11 21:25:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,390 INFO L93 Difference]: Finished difference Result 84 states and 140 transitions. [2019-01-11 21:25:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:25:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,392 INFO L225 Difference]: With dead ends: 84 [2019-01-11 21:25:15,392 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 21:25:15,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 21:25:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-01-11 21:25:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 21:25:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 100 transitions. [2019-01-11 21:25:15,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 100 transitions. Word has length 13 [2019-01-11 21:25:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,401 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 100 transitions. [2019-01-11 21:25:15,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 100 transitions. [2019-01-11 21:25:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 21:25:15,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,403 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1302694320, now seen corresponding path program 1 times [2019-01-11 21:25:15,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,448 INFO L87 Difference]: Start difference. First operand 60 states and 100 transitions. Second operand 3 states. [2019-01-11 21:25:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,512 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2019-01-11 21:25:15,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-11 21:25:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,515 INFO L225 Difference]: With dead ends: 140 [2019-01-11 21:25:15,515 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 21:25:15,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 21:25:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-01-11 21:25:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-11 21:25:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2019-01-11 21:25:15,534 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 13 [2019-01-11 21:25:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,535 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2019-01-11 21:25:15,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2019-01-11 21:25:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:15,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1335576262, now seen corresponding path program 1 times [2019-01-11 21:25:15,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,600 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 3 states. [2019-01-11 21:25:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,659 INFO L93 Difference]: Finished difference Result 125 states and 201 transitions. [2019-01-11 21:25:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,661 INFO L225 Difference]: With dead ends: 125 [2019-01-11 21:25:15,661 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 21:25:15,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 21:25:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-01-11 21:25:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 21:25:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2019-01-11 21:25:15,676 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 14 [2019-01-11 21:25:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,677 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2019-01-11 21:25:15,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2019-01-11 21:25:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:15,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,679 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1728603272, now seen corresponding path program 1 times [2019-01-11 21:25:15,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,762 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand 3 states. [2019-01-11 21:25:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,871 INFO L93 Difference]: Finished difference Result 236 states and 376 transitions. [2019-01-11 21:25:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:15,873 INFO L225 Difference]: With dead ends: 236 [2019-01-11 21:25:15,873 INFO L226 Difference]: Without dead ends: 158 [2019-01-11 21:25:15,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-11 21:25:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-01-11 21:25:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-11 21:25:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 242 transitions. [2019-01-11 21:25:15,890 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 242 transitions. Word has length 14 [2019-01-11 21:25:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:15,890 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 242 transitions. [2019-01-11 21:25:15,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 242 transitions. [2019-01-11 21:25:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 21:25:15,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:15,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:15,900 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1886305654, now seen corresponding path program 1 times [2019-01-11 21:25:15,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:15,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:15,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:15,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:15,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:15,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:15,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:15,960 INFO L87 Difference]: Start difference. First operand 156 states and 242 transitions. Second operand 3 states. [2019-01-11 21:25:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:15,999 INFO L93 Difference]: Finished difference Result 192 states and 300 transitions. [2019-01-11 21:25:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-11 21:25:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,002 INFO L225 Difference]: With dead ends: 192 [2019-01-11 21:25:16,002 INFO L226 Difference]: Without dead ends: 190 [2019-01-11 21:25:16,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-11 21:25:16,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2019-01-11 21:25:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-11 21:25:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-01-11 21:25:16,028 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 14 [2019-01-11 21:25:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,029 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-01-11 21:25:16,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-01-11 21:25:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:16,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,031 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2046878555, now seen corresponding path program 1 times [2019-01-11 21:25:16,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,072 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 3 states. [2019-01-11 21:25:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,105 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2019-01-11 21:25:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,108 INFO L225 Difference]: With dead ends: 276 [2019-01-11 21:25:16,108 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 21:25:16,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 21:25:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 224. [2019-01-11 21:25:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-11 21:25:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 334 transitions. [2019-01-11 21:25:16,124 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 334 transitions. Word has length 15 [2019-01-11 21:25:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,124 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 334 transitions. [2019-01-11 21:25:16,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 334 transitions. [2019-01-11 21:25:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 21:25:16,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,128 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1366820185, now seen corresponding path program 1 times [2019-01-11 21:25:16,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,180 INFO L87 Difference]: Start difference. First operand 224 states and 334 transitions. Second operand 3 states. [2019-01-11 21:25:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,223 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2019-01-11 21:25:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-11 21:25:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,226 INFO L225 Difference]: With dead ends: 516 [2019-01-11 21:25:16,227 INFO L226 Difference]: Without dead ends: 298 [2019-01-11 21:25:16,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-11 21:25:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2019-01-11 21:25:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 21:25:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 426 transitions. [2019-01-11 21:25:16,244 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 426 transitions. Word has length 15 [2019-01-11 21:25:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,244 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 426 transitions. [2019-01-11 21:25:16,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2019-01-11 21:25:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:16,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,248 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,249 INFO L82 PathProgramCache]: Analyzing trace with hash 971489901, now seen corresponding path program 1 times [2019-01-11 21:25:16,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,282 INFO L87 Difference]: Start difference. First operand 296 states and 426 transitions. Second operand 3 states. [2019-01-11 21:25:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,315 INFO L93 Difference]: Finished difference Result 452 states and 648 transitions. [2019-01-11 21:25:16,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,321 INFO L225 Difference]: With dead ends: 452 [2019-01-11 21:25:16,321 INFO L226 Difference]: Without dead ends: 310 [2019-01-11 21:25:16,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-11 21:25:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-01-11 21:25:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-11 21:25:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 434 transitions. [2019-01-11 21:25:16,342 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 434 transitions. Word has length 16 [2019-01-11 21:25:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 434 transitions. [2019-01-11 21:25:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2019-01-11 21:25:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:16,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,346 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 578462891, now seen corresponding path program 1 times [2019-01-11 21:25:16,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,413 INFO L87 Difference]: Start difference. First operand 308 states and 434 transitions. Second operand 3 states. [2019-01-11 21:25:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,447 INFO L93 Difference]: Finished difference Result 520 states and 732 transitions. [2019-01-11 21:25:16,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,451 INFO L225 Difference]: With dead ends: 520 [2019-01-11 21:25:16,451 INFO L226 Difference]: Without dead ends: 518 [2019-01-11 21:25:16,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 [2019-01-11 21:25:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-01-11 21:25:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 452. [2019-01-11 21:25:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-01-11 21:25:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 618 transitions. [2019-01-11 21:25:16,471 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 618 transitions. Word has length 16 [2019-01-11 21:25:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,472 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 618 transitions. [2019-01-11 21:25:16,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 618 transitions. [2019-01-11 21:25:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 21:25:16,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,474 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1258521261, now seen corresponding path program 1 times [2019-01-11 21:25:16,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,553 INFO L87 Difference]: Start difference. First operand 452 states and 618 transitions. Second operand 3 states. [2019-01-11 21:25:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,669 INFO L93 Difference]: Finished difference Result 1016 states and 1372 transitions. [2019-01-11 21:25:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-11 21:25:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,672 INFO L225 Difference]: With dead ends: 1016 [2019-01-11 21:25:16,672 INFO L226 Difference]: Without dead ends: 582 [2019-01-11 21:25:16,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-01-11 21:25:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2019-01-11 21:25:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-01-11 21:25:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 754 transitions. [2019-01-11 21:25:16,699 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 754 transitions. Word has length 16 [2019-01-11 21:25:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,699 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 754 transitions. [2019-01-11 21:25:16,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 754 transitions. [2019-01-11 21:25:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:16,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,701 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,702 INFO L82 PathProgramCache]: Analyzing trace with hash 752696444, now seen corresponding path program 1 times [2019-01-11 21:25:16,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,725 INFO L87 Difference]: Start difference. First operand 580 states and 754 transitions. Second operand 3 states. [2019-01-11 21:25:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:16,796 INFO L93 Difference]: Finished difference Result 872 states and 1124 transitions. [2019-01-11 21:25:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:16,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:16,800 INFO L225 Difference]: With dead ends: 872 [2019-01-11 21:25:16,800 INFO L226 Difference]: Without dead ends: 598 [2019-01-11 21:25:16,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-01-11 21:25:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-01-11 21:25:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-01-11 21:25:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 754 transitions. [2019-01-11 21:25:16,827 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 754 transitions. Word has length 17 [2019-01-11 21:25:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:16,827 INFO L480 AbstractCegarLoop]: Abstraction has 596 states and 754 transitions. [2019-01-11 21:25:16,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 754 transitions. [2019-01-11 21:25:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:16,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:16,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:16,829 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:16,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash 359669434, now seen corresponding path program 1 times [2019-01-11 21:25:16,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:16,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:16,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:16,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:16,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:16,896 INFO L87 Difference]: Start difference. First operand 596 states and 754 transitions. Second operand 3 states. [2019-01-11 21:25:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:17,012 INFO L93 Difference]: Finished difference Result 966 states and 1203 transitions. [2019-01-11 21:25:17,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:17,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:17,019 INFO L225 Difference]: With dead ends: 966 [2019-01-11 21:25:17,019 INFO L226 Difference]: Without dead ends: 964 [2019-01-11 21:25:17,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-01-11 21:25:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 900. [2019-01-11 21:25:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-01-11 21:25:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1106 transitions. [2019-01-11 21:25:17,070 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1106 transitions. Word has length 17 [2019-01-11 21:25:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,070 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1106 transitions. [2019-01-11 21:25:17,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1106 transitions. [2019-01-11 21:25:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:25:17,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:25:17,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:25:17,073 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:25:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:25:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1039727804, now seen corresponding path program 1 times [2019-01-11 21:25:17,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:25:17,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:25:17,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:25:17,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:25:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:25:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 21:25:17,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:25:17,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:25:17,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:25:17,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:25:17,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,142 INFO L87 Difference]: Start difference. First operand 900 states and 1106 transitions. Second operand 3 states. [2019-01-11 21:25:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:25:17,297 INFO L93 Difference]: Finished difference Result 1988 states and 2386 transitions. [2019-01-11 21:25:17,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:25:17,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:25:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:25:17,300 INFO L225 Difference]: With dead ends: 1988 [2019-01-11 21:25:17,300 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:25:17,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:25:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:25:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:25:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:25:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:25:17,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-11 21:25:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:25:17,310 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:25:17,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:25:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:25:17,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:25:17,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:25:17,402 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-11 21:25:17,403 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:25:17,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:25:17,403 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-11 21:25:17,403 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2019-01-11 21:25:17,403 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-01-11 21:25:17,404 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,406 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2019-01-11 21:25:17,406 INFO L451 ceAbstractionStarter]: At program point L106(lines 4 107) the Hoare annotation is: true [2019-01-11 21:25:17,407 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-11 21:25:17,407 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-01-11 21:25:17,407 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2019-01-11 21:25:17,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-01-11 21:25:17,407 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,407 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,407 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:25:17,408 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,408 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-11 21:25:17,408 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,408 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2019-01-11 21:25:17,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:25:17 BoogieIcfgContainer [2019-01-11 21:25:17,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:25:17,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:25:17,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:25:17,416 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:25:17,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:25:14" (3/4) ... [2019-01-11 21:25:17,421 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:25:17,433 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-11 21:25:17,433 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:25:17,505 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:25:17,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:25:17,507 INFO L168 Benchmark]: Toolchain (without parser) took 3884.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.3 MB in the beginning and 932.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 152.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:17,510 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. [2019-01-11 21:25:17,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.52 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:17,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:25:17,513 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:17,519 INFO L168 Benchmark]: RCFGBuilder took 514.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:17,522 INFO L168 Benchmark]: TraceAbstraction took 2969.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.4 MB in the end (delta: 173.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:17,522 INFO L168 Benchmark]: Witness Printer took 89.96 ms. Allocated memory is still 1.2 GB. Free memory was 939.4 MB in the beginning and 932.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:25:17,527 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 251.52 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.31 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.52 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2969.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.4 MB in the end (delta: 173.4 MB). Peak memory consumption was 173.4 MB. Max. memory is 11.5 GB. * Witness Printer took 89.96 ms. Allocated memory is still 1.2 GB. Free memory was 939.4 MB in the beginning and 932.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 812 SDtfs, 391 SDslu, 511 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 6130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...