./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.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 59598ef74ac7afb6c962e2cc2ba26af488759b7c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:08:24,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:08:24,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:08:24,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:08:24,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:08:24,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:08:24,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:08:24,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:08:24,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:08:24,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:08:24,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:08:24,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:08:24,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:08:24,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:08:24,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:08:24,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:08:24,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:08:24,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:08:24,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:08:24,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:08:24,767 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:08:24,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:08:24,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:08:24,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:08:24,771 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:08:24,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:08:24,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:08:24,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:08:24,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:08:24,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:08:24,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:08:24,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:08:24,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:08:24,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:08:24,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:08:24,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:08:24,779 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:08:24,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:08:24,799 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:08:24,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:08:24,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:08:24,800 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:08:24,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:08:24,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:08:24,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:08:24,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:08:24,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:08:24,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:08:24,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:08:24,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:08:24,802 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:08:24,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:08:24,802 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:08:24,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:08:24,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:08:24,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:08:24,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:08:24,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:08:24,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:08:24,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:08:24,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:08:24,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:08:24,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:08:24,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:08:24,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:08:24,807 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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2018-12-31 10:08:24,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:08:24,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:08:24,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:08:24,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:08:24,871 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:08:24,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-12-31 10:08:24,936 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf99adad6/d663cb37794b4fa0bee01affba533542/FLAG4c0fda035 [2018-12-31 10:08:25,432 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:08:25,432 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.01_false-unreach-call_false-termination.cil.c [2018-12-31 10:08:25,446 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf99adad6/d663cb37794b4fa0bee01affba533542/FLAG4c0fda035 [2018-12-31 10:08:25,760 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf99adad6/d663cb37794b4fa0bee01affba533542 [2018-12-31 10:08:25,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:08:25,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:08:25,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:08:25,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:08:25,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:08:25,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:08:25" (1/1) ... [2018-12-31 10:08:25,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc38887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:25, skipping insertion in model container [2018-12-31 10:08:25,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:08:25" (1/1) ... [2018-12-31 10:08:25,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:08:25,828 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:08:26,141 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:08:26,158 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:08:26,228 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:08:26,260 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:08:26,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26 WrapperNode [2018-12-31 10:08:26,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:08:26,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:08:26,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:08:26,265 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:08:26,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:08:26,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:08:26,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:08:26,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:08:26,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... [2018-12-31 10:08:26,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:08:26,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:08:26,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:08:26,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:08:26,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:08:26,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:08:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:08:27,625 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:08:27,625 INFO L280 CfgBuilder]: Removed 82 assue(true) statements. [2018-12-31 10:08:27,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:08:27 BoogieIcfgContainer [2018-12-31 10:08:27,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:08:27,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:08:27,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:08:27,630 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:08:27,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:08:25" (1/3) ... [2018-12-31 10:08:27,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a19934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:08:27, skipping insertion in model container [2018-12-31 10:08:27,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:26" (2/3) ... [2018-12-31 10:08:27,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a19934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:08:27, skipping insertion in model container [2018-12-31 10:08:27,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:08:27" (3/3) ... [2018-12-31 10:08:27,634 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_false-unreach-call_false-termination.cil.c [2018-12-31 10:08:27,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:08:27,651 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 10:08:27,669 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 10:08:27,704 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:08:27,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:08:27,705 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:08:27,705 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:08:27,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:08:27,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:08:27,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:08:27,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:08:27,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:08:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-12-31 10:08:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:08:27,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:27,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:27,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2018-12-31 10:08:27,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:27,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:27,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:27,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:27,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:27,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:27,962 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2018-12-31 10:08:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:28,041 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2018-12-31 10:08:28,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:28,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:08:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:28,060 INFO L225 Difference]: With dead ends: 291 [2018-12-31 10:08:28,060 INFO L226 Difference]: Without dead ends: 144 [2018-12-31 10:08:28,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-31 10:08:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-31 10:08:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-31 10:08:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2018-12-31 10:08:28,122 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2018-12-31 10:08:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:28,123 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2018-12-31 10:08:28,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2018-12-31 10:08:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:08:28,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:28,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:28,125 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:28,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2018-12-31 10:08:28,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:28,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:28,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:28,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:28,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,191 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2018-12-31 10:08:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:28,314 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2018-12-31 10:08:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:28,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:08:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:28,318 INFO L225 Difference]: With dead ends: 384 [2018-12-31 10:08:28,318 INFO L226 Difference]: Without dead ends: 246 [2018-12-31 10:08:28,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-31 10:08:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2018-12-31 10:08:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-31 10:08:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2018-12-31 10:08:28,373 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2018-12-31 10:08:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:28,373 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2018-12-31 10:08:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2018-12-31 10:08:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:08:28,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:28,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:28,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2018-12-31 10:08:28,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:28,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:28,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:28,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:28,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:28,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,470 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2018-12-31 10:08:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:28,562 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2018-12-31 10:08:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:28,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:08:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:28,565 INFO L225 Difference]: With dead ends: 477 [2018-12-31 10:08:28,566 INFO L226 Difference]: Without dead ends: 242 [2018-12-31 10:08:28,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-31 10:08:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-12-31 10:08:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-31 10:08:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2018-12-31 10:08:28,594 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2018-12-31 10:08:28,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:28,594 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2018-12-31 10:08:28,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2018-12-31 10:08:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:08:28,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:28,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:28,596 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2018-12-31 10:08:28,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:28,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:28,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:28,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,697 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2018-12-31 10:08:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:28,822 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2018-12-31 10:08:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:28,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:08:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:28,826 INFO L225 Difference]: With dead ends: 476 [2018-12-31 10:08:28,827 INFO L226 Difference]: Without dead ends: 242 [2018-12-31 10:08:28,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-31 10:08:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-12-31 10:08:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-31 10:08:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2018-12-31 10:08:28,851 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2018-12-31 10:08:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:28,851 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2018-12-31 10:08:28,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2018-12-31 10:08:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:08:28,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:28,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:28,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2018-12-31 10:08:28,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:28,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:28,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:28,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:28,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:28,909 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2018-12-31 10:08:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:29,071 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2018-12-31 10:08:29,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:29,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:08:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:29,077 INFO L225 Difference]: With dead ends: 475 [2018-12-31 10:08:29,077 INFO L226 Difference]: Without dead ends: 242 [2018-12-31 10:08:29,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-31 10:08:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-12-31 10:08:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-12-31 10:08:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2018-12-31 10:08:29,096 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2018-12-31 10:08:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:29,096 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2018-12-31 10:08:29,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2018-12-31 10:08:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:08:29,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:29,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:29,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2018-12-31 10:08:29,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:29,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:29,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:29,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:29,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:29,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:29,196 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2018-12-31 10:08:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:29,355 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2018-12-31 10:08:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:29,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:08:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:29,360 INFO L225 Difference]: With dead ends: 662 [2018-12-31 10:08:29,360 INFO L226 Difference]: Without dead ends: 431 [2018-12-31 10:08:29,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-31 10:08:29,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2018-12-31 10:08:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-12-31 10:08:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2018-12-31 10:08:29,390 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2018-12-31 10:08:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:29,391 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2018-12-31 10:08:29,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2018-12-31 10:08:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:08:29,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:29,394 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:29,394 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2018-12-31 10:08:29,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:29,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:29,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:29,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:29,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:08:29,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:08:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:08:29,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:08:29,672 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2018-12-31 10:08:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:30,439 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2018-12-31 10:08:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:08:30,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-31 10:08:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:30,447 INFO L225 Difference]: With dead ends: 985 [2018-12-31 10:08:30,448 INFO L226 Difference]: Without dead ends: 593 [2018-12-31 10:08:30,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:08:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-12-31 10:08:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2018-12-31 10:08:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-31 10:08:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2018-12-31 10:08:30,496 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2018-12-31 10:08:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:30,496 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2018-12-31 10:08:30,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:08:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2018-12-31 10:08:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:08:30,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:30,501 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:30,501 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:30,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:30,501 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2018-12-31 10:08:30,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:30,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:30,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:30,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:30,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:30,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:30,638 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2018-12-31 10:08:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:30,964 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2018-12-31 10:08:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:30,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-31 10:08:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:30,973 INFO L225 Difference]: With dead ends: 1143 [2018-12-31 10:08:30,973 INFO L226 Difference]: Without dead ends: 747 [2018-12-31 10:08:30,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-31 10:08:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2018-12-31 10:08:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-31 10:08:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2018-12-31 10:08:31,034 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2018-12-31 10:08:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:31,034 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2018-12-31 10:08:31,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2018-12-31 10:08:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:08:31,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:31,038 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:31,038 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:31,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:31,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2018-12-31 10:08:31,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:31,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:31,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:31,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:31,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:08:31,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:08:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:08:31,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:08:31,211 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2018-12-31 10:08:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:32,297 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2018-12-31 10:08:32,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:08:32,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-31 10:08:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:32,304 INFO L225 Difference]: With dead ends: 1617 [2018-12-31 10:08:32,305 INFO L226 Difference]: Without dead ends: 923 [2018-12-31 10:08:32,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:08:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-31 10:08:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2018-12-31 10:08:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-12-31 10:08:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2018-12-31 10:08:32,379 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2018-12-31 10:08:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:32,379 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2018-12-31 10:08:32,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:08:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2018-12-31 10:08:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:08:32,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:32,382 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:32,383 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:32,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:32,383 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2018-12-31 10:08:32,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:32,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:32,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:32,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:32,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:32,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:32,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:32,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:32,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:32,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:32,498 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2018-12-31 10:08:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:32,832 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2018-12-31 10:08:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:32,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-12-31 10:08:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:32,840 INFO L225 Difference]: With dead ends: 2017 [2018-12-31 10:08:32,840 INFO L226 Difference]: Without dead ends: 1321 [2018-12-31 10:08:32,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-12-31 10:08:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2018-12-31 10:08:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-12-31 10:08:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2018-12-31 10:08:32,933 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2018-12-31 10:08:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:32,934 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2018-12-31 10:08:32,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2018-12-31 10:08:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:08:32,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:32,937 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:32,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2018-12-31 10:08:32,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:32,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:32,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:32,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:33,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:33,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:33,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:33,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:33,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:33,019 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2018-12-31 10:08:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:33,383 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2018-12-31 10:08:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:33,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 10:08:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:33,394 INFO L225 Difference]: With dead ends: 3670 [2018-12-31 10:08:33,394 INFO L226 Difference]: Without dead ends: 1847 [2018-12-31 10:08:33,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2018-12-31 10:08:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2018-12-31 10:08:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2018-12-31 10:08:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2018-12-31 10:08:33,515 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2018-12-31 10:08:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:33,516 INFO L480 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2018-12-31 10:08:33,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2018-12-31 10:08:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 10:08:33,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:33,520 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:33,520 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:33,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2018-12-31 10:08:33,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:33,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-31 10:08:33,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:33,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:33,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:33,605 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2018-12-31 10:08:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:33,903 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2018-12-31 10:08:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:33,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-31 10:08:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:33,911 INFO L225 Difference]: With dead ends: 3621 [2018-12-31 10:08:33,911 INFO L226 Difference]: Without dead ends: 1799 [2018-12-31 10:08:33,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-31 10:08:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-31 10:08:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-31 10:08:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2018-12-31 10:08:34,019 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2018-12-31 10:08:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:34,019 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2018-12-31 10:08:34,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2018-12-31 10:08:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 10:08:34,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:34,022 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:34,022 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2018-12-31 10:08:34,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:34,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:34,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:34,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 10:08:34,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:34,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:34,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:34,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:34,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:34,092 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2018-12-31 10:08:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:34,390 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2018-12-31 10:08:34,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:34,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-31 10:08:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:34,395 INFO L225 Difference]: With dead ends: 3078 [2018-12-31 10:08:34,395 INFO L226 Difference]: Without dead ends: 724 [2018-12-31 10:08:34,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-12-31 10:08:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2018-12-31 10:08:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2018-12-31 10:08:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2018-12-31 10:08:34,488 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2018-12-31 10:08:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:34,489 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2018-12-31 10:08:34,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2018-12-31 10:08:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 10:08:34,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:34,492 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:34,493 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2018-12-31 10:08:34,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:34,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:34,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:34,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:34,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:34,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:34,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:34,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:34,607 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2018-12-31 10:08:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:34,842 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2018-12-31 10:08:34,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:34,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-31 10:08:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:34,845 INFO L225 Difference]: With dead ends: 1048 [2018-12-31 10:08:34,846 INFO L226 Difference]: Without dead ends: 594 [2018-12-31 10:08:34,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-12-31 10:08:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-12-31 10:08:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-12-31 10:08:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2018-12-31 10:08:34,881 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2018-12-31 10:08:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:34,881 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2018-12-31 10:08:34,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2018-12-31 10:08:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:08:34,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:34,883 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:34,883 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2018-12-31 10:08:34,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:34,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:08:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 10:08:35,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:08:35,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:08:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:08:35,108 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2018-12-31 10:08:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:35,177 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2018-12-31 10:08:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 10:08:35,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 10:08:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:35,184 INFO L225 Difference]: With dead ends: 598 [2018-12-31 10:08:35,184 INFO L226 Difference]: Without dead ends: 596 [2018-12-31 10:08:35,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:08:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-12-31 10:08:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2018-12-31 10:08:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-31 10:08:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2018-12-31 10:08:35,227 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2018-12-31 10:08:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:35,227 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2018-12-31 10:08:35,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:08:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2018-12-31 10:08:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-31 10:08:35,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:35,230 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:35,230 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2018-12-31 10:08:35,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:35,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:35,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:35,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-31 10:08:35,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:35,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:35,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:35,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:35,319 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2018-12-31 10:08:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:35,540 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2018-12-31 10:08:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:35,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-31 10:08:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:35,547 INFO L225 Difference]: With dead ends: 1230 [2018-12-31 10:08:35,547 INFO L226 Difference]: Without dead ends: 900 [2018-12-31 10:08:35,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-12-31 10:08:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2018-12-31 10:08:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-12-31 10:08:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2018-12-31 10:08:35,594 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2018-12-31 10:08:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:35,594 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2018-12-31 10:08:35,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2018-12-31 10:08:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-31 10:08:35,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:35,598 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:35,598 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2018-12-31 10:08:35,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:35,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:35,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:08:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:08:35,695 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 10:08:35,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:08:35 BoogieIcfgContainer [2018-12-31 10:08:35,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:08:35,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:08:35,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:08:35,842 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:08:35,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:08:27" (3/4) ... [2018-12-31 10:08:35,847 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 10:08:35,990 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:08:35,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:08:35,992 INFO L168 Benchmark]: Toolchain (without parser) took 10227.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:35,994 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:08:35,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:35,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 141.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -204.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:35,995 INFO L168 Benchmark]: Boogie Preprocessor took 42.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:35,995 INFO L168 Benchmark]: RCFGBuilder took 1177.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:35,997 INFO L168 Benchmark]: TraceAbstraction took 8213.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.4 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:35,997 INFO L168 Benchmark]: Witness Printer took 149.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:08:36,001 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.44 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 496.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 141.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -204.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1177.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8213.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.4 MB). Peak memory consumption was 164.6 MB. Max. memory is 11.5 GB. * Witness Printer took 149.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L64] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. UNSAFE Result, 8.1s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...