./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ec1444beade6c173560e18fc764e1e87b48a40 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.23-635dfa2 [2018-12-03 05:57:46,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:57:46,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:57:46,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:57:46,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:57:46,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:57:46,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:57:46,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:57:46,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:57:46,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:57:46,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:57:46,746 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:57:46,747 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:57:46,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:57:46,749 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:57:46,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:57:46,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:57:46,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:57:46,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:57:46,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:57:46,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:57:46,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:57:46,756 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:57:46,756 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:57:46,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:57:46,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:57:46,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:57:46,759 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:57:46,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:57:46,760 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:57:46,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:57:46,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:57:46,761 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:57:46,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:57:46,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:57:46,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:57:46,762 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:57:46,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:57:46,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:57:46,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:57:46,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:57:46,770 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:57:46,770 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:57:46,770 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:57:46,770 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:57:46,770 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:57:46,770 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:57:46,771 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:57:46,771 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:57:46,771 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:57:46,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:57:46,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:57:46,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:57:46,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:57:46,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:57:46,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:57:46,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:57:46,773 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:57:46,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:57:46,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:57:46,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:57:46,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:57:46,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:57:46,774 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:57:46,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:57:46,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:57:46,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:57:46,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan 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 -> Taipan 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 -> 61ec1444beade6c173560e18fc764e1e87b48a40 [2018-12-03 05:57:46,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:57:46,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:57:46,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:57:46,808 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:57:46,808 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:57:46,809 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2018-12-03 05:57:46,843 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/data/a46d4552d/58096c088b454b2c97340bfec831c524/FLAG7b708ba6f [2018-12-03 05:57:47,276 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:57:47,277 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/sv-benchmarks/c/pthread-wmm/mix012_pso.oepc_false-unreach-call.i [2018-12-03 05:57:47,284 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/data/a46d4552d/58096c088b454b2c97340bfec831c524/FLAG7b708ba6f [2018-12-03 05:57:47,292 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/data/a46d4552d/58096c088b454b2c97340bfec831c524 [2018-12-03 05:57:47,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:57:47,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:57:47,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:57:47,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:57:47,297 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:57:47,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47, skipping insertion in model container [2018-12-03 05:57:47,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:57:47,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:57:47,499 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:57:47,507 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:57:47,584 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:57:47,615 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:57:47,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47 WrapperNode [2018-12-03 05:57:47,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:57:47,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:57:47,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:57:47,616 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:57:47,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:57:47,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:57:47,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:57:47,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:57:47,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... [2018-12-03 05:57:47,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:57:47,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:57:47,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:57:47,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:57:47,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/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-03 05:57:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:57:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 05:57:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 05:57:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:57:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 05:57:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 05:57:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 05:57:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 05:57:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 05:57:47,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:57:47,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:57:47,703 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 05:57:48,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:57:48,035 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 05:57:48,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:57:48 BoogieIcfgContainer [2018-12-03 05:57:48,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:57:48,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:57:48,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:57:48,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:57:48,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:57:47" (1/3) ... [2018-12-03 05:57:48,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4bd27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:57:48, skipping insertion in model container [2018-12-03 05:57:48,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:57:47" (2/3) ... [2018-12-03 05:57:48,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4bd27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:57:48, skipping insertion in model container [2018-12-03 05:57:48,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:57:48" (3/3) ... [2018-12-03 05:57:48,042 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc_false-unreach-call.i [2018-12-03 05:57:48,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,070 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,070 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,070 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 05:57:48,092 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 05:57:48,092 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:57:48,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 05:57:48,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 05:57:48,123 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:57:48,123 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:57:48,123 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:57:48,123 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:57:48,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:57:48,124 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:57:48,124 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:57:48,124 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:57:48,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 05:57:49,743 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-03 05:57:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-03 05:57:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 05:57:49,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:57:49,750 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] [2018-12-03 05:57:49,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:57:49,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:57:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-03 05:57:49,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:57:49,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:49,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:57:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:49,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:57:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:57:49,885 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-03 05:57:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:57:49,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:57:49,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:57:49,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:57:49,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:57:49,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:57:49,900 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-03 05:57:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:57:50,379 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-03 05:57:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:57:50,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-03 05:57:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:57:50,530 INFO L225 Difference]: With dead ends: 60791 [2018-12-03 05:57:50,531 INFO L226 Difference]: Without dead ends: 44271 [2018-12-03 05:57:50,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:57:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-03 05:57:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-03 05:57:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-03 05:57:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-03 05:57:51,337 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-03 05:57:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:57:51,337 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-03 05:57:51,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:57:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-03 05:57:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 05:57:51,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:57:51,341 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:57:51,342 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:57:51,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:57:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-03 05:57:51,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:57:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:57:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:51,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:57:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:57:51,394 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-03 05:57:51,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:57:51,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:57:51,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:57:51,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:57:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:57:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:57:51,396 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-03 05:57:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:57:51,938 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-03 05:57:51,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:57:51,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 05:57:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:57:52,192 INFO L225 Difference]: With dead ends: 64005 [2018-12-03 05:57:52,192 INFO L226 Difference]: Without dead ends: 63453 [2018-12-03 05:57:52,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:57:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-03 05:57:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-03 05:57:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-03 05:57:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-03 05:57:52,932 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-03 05:57:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:57:52,933 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-03 05:57:52,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:57:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-03 05:57:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 05:57:52,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:57:52,936 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:57:52,936 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:57:52,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:57:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-03 05:57:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:57:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:57:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:52,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:57:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:57:53,089 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-03 05:57:53,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:57:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:57:53,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:57:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:57:53,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:57:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:57:53,090 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-03 05:57:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:57:53,503 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-03 05:57:53,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:57:53,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-03 05:57:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:57:53,642 INFO L225 Difference]: With dead ends: 81367 [2018-12-03 05:57:53,643 INFO L226 Difference]: Without dead ends: 80855 [2018-12-03 05:57:53,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:57:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-03 05:57:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-03 05:57:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-03 05:57:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-03 05:57:54,575 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-03 05:57:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:57:54,575 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-03 05:57:54,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:57:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-03 05:57:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 05:57:54,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:57:54,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:57:54,580 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:57:54,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:57:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-03 05:57:54,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:57:54,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:54,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:57:54,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:54,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:57:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:57:54,612 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-03 05:57:54,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:57:54,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:57:54,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:57:54,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:57:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:57:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:57:54,613 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-03 05:57:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:57:54,827 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-03 05:57:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:57:54,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-03 05:57:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:57:54,937 INFO L225 Difference]: With dead ends: 65251 [2018-12-03 05:57:54,937 INFO L226 Difference]: Without dead ends: 65251 [2018-12-03 05:57:54,937 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-03 05:57:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-03 05:57:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-03 05:57:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-03 05:57:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-03 05:57:55,867 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-03 05:57:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:57:55,868 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-03 05:57:55,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:57:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-03 05:57:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 05:57:55,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:57:55,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:57:55,876 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:57:55,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:57:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-03 05:57:55,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:57:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:57:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:55,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:57:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:57:55,959 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-03 05:57:55,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:57:55,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:57:55,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:57:55,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:57:55,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:57:55,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:57:55,960 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-03 05:57:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:57:56,498 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-03 05:57:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:57:56,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 05:57:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:57:56,616 INFO L225 Difference]: With dead ends: 67511 [2018-12-03 05:57:56,616 INFO L226 Difference]: Without dead ends: 67511 [2018-12-03 05:57:56,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:57:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-03 05:57:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-03 05:57:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-03 05:57:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-03 05:57:57,655 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-03 05:57:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:57:57,655 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-03 05:57:57,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:57:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-03 05:57:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 05:57:57,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:57:57,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:57:57,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:57:57,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:57:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-03 05:57:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:57:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:57,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:57:57,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:57:57,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:57:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:57:57,732 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-03 05:57:57,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:57:57,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:57:57,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:57:57,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:57:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:57:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:57:57,733 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-03 05:57:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:57:58,765 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-03 05:57:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 05:57:58,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-03 05:57:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:57:58,915 INFO L225 Difference]: With dead ends: 88528 [2018-12-03 05:57:58,916 INFO L226 Difference]: Without dead ends: 88528 [2018-12-03 05:57:58,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:57:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-03 05:58:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-03 05:58:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-03 05:58:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-03 05:58:00,230 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-03 05:58:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:00,230 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-03 05:58:00,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:58:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-03 05:58:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 05:58:00,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:00,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:00,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:00,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:00,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-03 05:58:00,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:00,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:00,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:00,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:00,265 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-03 05:58:00,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:00,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:58:00,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:00,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:58:00,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:58:00,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:58:00,266 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-03 05:58:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:00,445 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-03 05:58:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:58:00,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-03 05:58:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:00,538 INFO L225 Difference]: With dead ends: 57182 [2018-12-03 05:58:00,538 INFO L226 Difference]: Without dead ends: 57182 [2018-12-03 05:58:00,539 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-03 05:58:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-03 05:58:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-03 05:58:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-03 05:58:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-03 05:58:01,350 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-03 05:58:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:01,350 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-03 05:58:01,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:58:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-03 05:58:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 05:58:01,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:01,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:01,356 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:01,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-03 05:58:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:01,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:01,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:01,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:01,405 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-03 05:58:01,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:01,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:01,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:01,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:01,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:01,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:01,407 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-03 05:58:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:02,040 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-03 05:58:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 05:58:02,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 05:58:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:02,188 INFO L225 Difference]: With dead ends: 97908 [2018-12-03 05:58:02,188 INFO L226 Difference]: Without dead ends: 97332 [2018-12-03 05:58:02,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:58:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-03 05:58:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-03 05:58:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-03 05:58:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-03 05:58:03,212 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-03 05:58:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:03,212 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-03 05:58:03,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-03 05:58:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 05:58:03,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:03,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:03,220 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:03,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-03 05:58:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:03,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:03,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:03,249 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-03 05:58:03,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:03,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:58:03,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:03,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:58:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:58:03,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:58:03,250 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2018-12-03 05:58:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:03,305 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2018-12-03 05:58:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:58:03,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 05:58:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:03,319 INFO L225 Difference]: With dead ends: 12705 [2018-12-03 05:58:03,319 INFO L226 Difference]: Without dead ends: 10887 [2018-12-03 05:58:03,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-03 05:58:03,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-03 05:58:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-03 05:58:03,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2018-12-03 05:58:03,426 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2018-12-03 05:58:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:03,427 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2018-12-03 05:58:03,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:58:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2018-12-03 05:58:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 05:58:03,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:03,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:03,429 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:03,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-03 05:58:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:03,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:03,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:03,463 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-03 05:58:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:58:03,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:03,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:58:03,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:58:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:58:03,464 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2018-12-03 05:58:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:03,531 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2018-12-03 05:58:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:58:03,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-03 05:58:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:03,543 INFO L225 Difference]: With dead ends: 12386 [2018-12-03 05:58:03,543 INFO L226 Difference]: Without dead ends: 12386 [2018-12-03 05:58:03,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:03,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-03 05:58:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-03 05:58:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-03 05:58:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2018-12-03 05:58:03,655 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2018-12-03 05:58:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:03,656 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2018-12-03 05:58:03,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:58:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2018-12-03 05:58:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 05:58:03,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:03,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:58:03,658 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:03,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-03 05:58:03,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:03,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:03,692 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-03 05:58:03,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:03,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:03,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:03,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:03,693 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2018-12-03 05:58:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:03,937 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2018-12-03 05:58:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:58:03,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-03 05:58:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:03,958 INFO L225 Difference]: With dead ends: 20935 [2018-12-03 05:58:03,958 INFO L226 Difference]: Without dead ends: 20864 [2018-12-03 05:58:03,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:58:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-03 05:58:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-03 05:58:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-03 05:58:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2018-12-03 05:58:04,131 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2018-12-03 05:58:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:04,131 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2018-12-03 05:58:04,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2018-12-03 05:58:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:04,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:04,136 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, 1, 1, 1, 1, 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-03 05:58:04,136 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:04,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-03 05:58:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:04,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:04,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:04,155 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-03 05:58:04,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:58:04,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:04,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:58:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:58:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:58:04,156 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2018-12-03 05:58:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:04,279 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2018-12-03 05:58:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:58:04,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 05:58:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:04,293 INFO L225 Difference]: With dead ends: 13930 [2018-12-03 05:58:04,293 INFO L226 Difference]: Without dead ends: 13930 [2018-12-03 05:58:04,293 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-03 05:58:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-03 05:58:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-03 05:58:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-03 05:58:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2018-12-03 05:58:04,429 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2018-12-03 05:58:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:04,429 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2018-12-03 05:58:04,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:58:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2018-12-03 05:58:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:04,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:04,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:04,433 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:04,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-03 05:58:04,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:04,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:04,475 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-03 05:58:04,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:58:04,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:04,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:58:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:58:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:58:04,476 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2018-12-03 05:58:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:04,650 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2018-12-03 05:58:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:58:04,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 05:58:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:04,667 INFO L225 Difference]: With dead ends: 17463 [2018-12-03 05:58:04,668 INFO L226 Difference]: Without dead ends: 17463 [2018-12-03 05:58:04,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:58:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-03 05:58:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-03 05:58:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-03 05:58:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2018-12-03 05:58:04,819 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2018-12-03 05:58:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:04,819 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2018-12-03 05:58:04,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:58:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2018-12-03 05:58:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:04,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:04,823 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, 1, 1, 1, 1, 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-03 05:58:04,824 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:04,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-03 05:58:04,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:04,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:04,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:04,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:04,888 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-03 05:58:04,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:04,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:04,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:04,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:04,889 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2018-12-03 05:58:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:05,371 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2018-12-03 05:58:05,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:58:05,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 05:58:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:05,388 INFO L225 Difference]: With dead ends: 18862 [2018-12-03 05:58:05,388 INFO L226 Difference]: Without dead ends: 18862 [2018-12-03 05:58:05,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-03 05:58:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-03 05:58:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-03 05:58:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2018-12-03 05:58:05,568 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2018-12-03 05:58:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:05,568 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2018-12-03 05:58:05,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2018-12-03 05:58:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:05,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:05,574 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, 1, 1, 1, 1, 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-03 05:58:05,574 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:05,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-03 05:58:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:05,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:05,645 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-03 05:58:05,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:05,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:05,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:05,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:05,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:05,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:05,646 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2018-12-03 05:58:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:05,886 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2018-12-03 05:58:05,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:58:05,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 05:58:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:05,905 INFO L225 Difference]: With dead ends: 20389 [2018-12-03 05:58:05,905 INFO L226 Difference]: Without dead ends: 20389 [2018-12-03 05:58:05,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:58:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-03 05:58:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-03 05:58:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-03 05:58:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2018-12-03 05:58:06,089 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2018-12-03 05:58:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:06,089 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2018-12-03 05:58:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2018-12-03 05:58:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:06,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:06,096 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, 1, 1, 1, 1, 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-03 05:58:06,096 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:06,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-03 05:58:06,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:06,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:06,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:06,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:06,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:06,136 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-03 05:58:06,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:06,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:06,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:06,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:06,138 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2018-12-03 05:58:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:06,364 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2018-12-03 05:58:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:58:06,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 05:58:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:06,387 INFO L225 Difference]: With dead ends: 23413 [2018-12-03 05:58:06,387 INFO L226 Difference]: Without dead ends: 23413 [2018-12-03 05:58:06,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-03 05:58:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-03 05:58:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-03 05:58:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2018-12-03 05:58:06,607 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2018-12-03 05:58:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:06,607 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2018-12-03 05:58:06,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2018-12-03 05:58:06,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:06,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:06,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:06,614 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-03 05:58:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:06,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:06,661 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-03 05:58:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:58:06,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:06,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:58:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:58:06,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:58:06,662 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2018-12-03 05:58:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:06,966 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2018-12-03 05:58:06,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:58:06,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 05:58:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:06,994 INFO L225 Difference]: With dead ends: 26758 [2018-12-03 05:58:06,994 INFO L226 Difference]: Without dead ends: 26462 [2018-12-03 05:58:06,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2018-12-03 05:58:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2018-12-03 05:58:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2018-12-03 05:58:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2018-12-03 05:58:07,261 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2018-12-03 05:58:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:07,262 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2018-12-03 05:58:07,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:58:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2018-12-03 05:58:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:07,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:07,269 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, 1, 1, 1, 1, 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-03 05:58:07,269 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:07,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-03 05:58:07,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:07,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:07,348 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-03 05:58:07,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:07,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:58:07,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:07,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:58:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:58:07,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:07,349 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 7 states. [2018-12-03 05:58:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:07,687 INFO L93 Difference]: Finished difference Result 29924 states and 85982 transitions. [2018-12-03 05:58:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 05:58:07,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-12-03 05:58:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:07,716 INFO L225 Difference]: With dead ends: 29924 [2018-12-03 05:58:07,716 INFO L226 Difference]: Without dead ends: 29924 [2018-12-03 05:58:07,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-03 05:58:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29924 states. [2018-12-03 05:58:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29924 to 24925. [2018-12-03 05:58:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24925 states. [2018-12-03 05:58:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24925 states to 24925 states and 71597 transitions. [2018-12-03 05:58:07,982 INFO L78 Accepts]: Start accepts. Automaton has 24925 states and 71597 transitions. Word has length 67 [2018-12-03 05:58:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:07,982 INFO L480 AbstractCegarLoop]: Abstraction has 24925 states and 71597 transitions. [2018-12-03 05:58:07,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:58:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 24925 states and 71597 transitions. [2018-12-03 05:58:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:07,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:07,989 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, 1, 1, 1, 1, 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-03 05:58:07,989 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:07,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2142837968, now seen corresponding path program 1 times [2018-12-03 05:58:07,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:07,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:07,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:08,015 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-03 05:58:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:08,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:08,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:08,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:08,016 INFO L87 Difference]: Start difference. First operand 24925 states and 71597 transitions. Second operand 5 states. [2018-12-03 05:58:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:08,052 INFO L93 Difference]: Finished difference Result 7461 states and 17979 transitions. [2018-12-03 05:58:08,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:58:08,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 05:58:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:08,056 INFO L225 Difference]: With dead ends: 7461 [2018-12-03 05:58:08,056 INFO L226 Difference]: Without dead ends: 6136 [2018-12-03 05:58:08,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-12-03 05:58:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 5530. [2018-12-03 05:58:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2018-12-03 05:58:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 12868 transitions. [2018-12-03 05:58:08,094 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 12868 transitions. Word has length 67 [2018-12-03 05:58:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:08,095 INFO L480 AbstractCegarLoop]: Abstraction has 5530 states and 12868 transitions. [2018-12-03 05:58:08,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 12868 transitions. [2018-12-03 05:58:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:58:08,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:08,097 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, 1, 1, 1, 1, 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-03 05:58:08,098 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:08,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-03 05:58:08,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:08,116 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-03 05:58:08,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:08,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 05:58:08,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:08,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 05:58:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 05:58:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 05:58:08,117 INFO L87 Difference]: Start difference. First operand 5530 states and 12868 transitions. Second operand 3 states. [2018-12-03 05:58:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:08,141 INFO L93 Difference]: Finished difference Result 7166 states and 16474 transitions. [2018-12-03 05:58:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 05:58:08,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 05:58:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:08,145 INFO L225 Difference]: With dead ends: 7166 [2018-12-03 05:58:08,146 INFO L226 Difference]: Without dead ends: 7166 [2018-12-03 05:58:08,146 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-03 05:58:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2018-12-03 05:58:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 5469. [2018-12-03 05:58:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2018-12-03 05:58:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 12408 transitions. [2018-12-03 05:58:08,188 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 12408 transitions. Word has length 67 [2018-12-03 05:58:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:08,189 INFO L480 AbstractCegarLoop]: Abstraction has 5469 states and 12408 transitions. [2018-12-03 05:58:08,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 05:58:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 12408 transitions. [2018-12-03 05:58:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 05:58:08,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:08,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:08,192 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-03 05:58:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:58:08,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:08,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:08,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:08,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:08,226 INFO L87 Difference]: Start difference. First operand 5469 states and 12408 transitions. Second operand 5 states. [2018-12-03 05:58:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:08,327 INFO L93 Difference]: Finished difference Result 6623 states and 15013 transitions. [2018-12-03 05:58:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:58:08,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-03 05:58:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:08,331 INFO L225 Difference]: With dead ends: 6623 [2018-12-03 05:58:08,331 INFO L226 Difference]: Without dead ends: 6623 [2018-12-03 05:58:08,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:58:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6623 states. [2018-12-03 05:58:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6623 to 5913. [2018-12-03 05:58:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5913 states. [2018-12-03 05:58:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5913 states to 5913 states and 13412 transitions. [2018-12-03 05:58:08,371 INFO L78 Accepts]: Start accepts. Automaton has 5913 states and 13412 transitions. Word has length 73 [2018-12-03 05:58:08,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:08,371 INFO L480 AbstractCegarLoop]: Abstraction has 5913 states and 13412 transitions. [2018-12-03 05:58:08,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5913 states and 13412 transitions. [2018-12-03 05:58:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 05:58:08,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:08,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:08,375 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:08,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-03 05:58:08,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:08,419 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-03 05:58:08,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:08,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:58:08,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:08,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:58:08,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:58:08,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:08,419 INFO L87 Difference]: Start difference. First operand 5913 states and 13412 transitions. Second operand 7 states. [2018-12-03 05:58:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:08,627 INFO L93 Difference]: Finished difference Result 6840 states and 15340 transitions. [2018-12-03 05:58:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 05:58:08,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-03 05:58:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:08,633 INFO L225 Difference]: With dead ends: 6840 [2018-12-03 05:58:08,633 INFO L226 Difference]: Without dead ends: 6738 [2018-12-03 05:58:08,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-03 05:58:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2018-12-03 05:58:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6010. [2018-12-03 05:58:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6010 states. [2018-12-03 05:58:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 13505 transitions. [2018-12-03 05:58:08,703 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 13505 transitions. Word has length 73 [2018-12-03 05:58:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:08,703 INFO L480 AbstractCegarLoop]: Abstraction has 6010 states and 13505 transitions. [2018-12-03 05:58:08,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:58:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 13505 transitions. [2018-12-03 05:58:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 05:58:08,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:08,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:08,709 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:08,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 309466785, now seen corresponding path program 1 times [2018-12-03 05:58:08,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:08,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:08,757 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-03 05:58:08,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:08,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:08,757 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:08,758 INFO L87 Difference]: Start difference. First operand 6010 states and 13505 transitions. Second operand 5 states. [2018-12-03 05:58:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:08,952 INFO L93 Difference]: Finished difference Result 5566 states and 12374 transitions. [2018-12-03 05:58:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:58:08,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 05:58:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:08,956 INFO L225 Difference]: With dead ends: 5566 [2018-12-03 05:58:08,956 INFO L226 Difference]: Without dead ends: 5566 [2018-12-03 05:58:08,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5566 states. [2018-12-03 05:58:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5566 to 5169. [2018-12-03 05:58:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2018-12-03 05:58:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 11472 transitions. [2018-12-03 05:58:08,989 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 11472 transitions. Word has length 94 [2018-12-03 05:58:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:08,990 INFO L480 AbstractCegarLoop]: Abstraction has 5169 states and 11472 transitions. [2018-12-03 05:58:08,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 11472 transitions. [2018-12-03 05:58:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 05:58:08,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:08,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:08,993 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:08,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash -326365977, now seen corresponding path program 1 times [2018-12-03 05:58:08,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:08,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:08,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:09,022 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-03 05:58:09,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:09,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:58:09,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:09,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:58:09,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:58:09,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:58:09,023 INFO L87 Difference]: Start difference. First operand 5169 states and 11472 transitions. Second operand 4 states. [2018-12-03 05:58:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:09,103 INFO L93 Difference]: Finished difference Result 6340 states and 14007 transitions. [2018-12-03 05:58:09,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:58:09,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 05:58:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:09,107 INFO L225 Difference]: With dead ends: 6340 [2018-12-03 05:58:09,107 INFO L226 Difference]: Without dead ends: 6340 [2018-12-03 05:58:09,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2018-12-03 05:58:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 5570. [2018-12-03 05:58:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2018-12-03 05:58:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 12361 transitions. [2018-12-03 05:58:09,150 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 12361 transitions. Word has length 94 [2018-12-03 05:58:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:09,150 INFO L480 AbstractCegarLoop]: Abstraction has 5570 states and 12361 transitions. [2018-12-03 05:58:09,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:58:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 12361 transitions. [2018-12-03 05:58:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:09,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:09,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:09,154 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:09,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash 325908361, now seen corresponding path program 1 times [2018-12-03 05:58:09,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:09,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:09,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:09,197 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-03 05:58:09,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:09,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:58:09,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:09,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:58:09,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:58:09,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:58:09,198 INFO L87 Difference]: Start difference. First operand 5570 states and 12361 transitions. Second operand 5 states. [2018-12-03 05:58:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:09,260 INFO L93 Difference]: Finished difference Result 6430 states and 14261 transitions. [2018-12-03 05:58:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:58:09,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 05:58:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:09,264 INFO L225 Difference]: With dead ends: 6430 [2018-12-03 05:58:09,264 INFO L226 Difference]: Without dead ends: 6430 [2018-12-03 05:58:09,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2018-12-03 05:58:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 5060. [2018-12-03 05:58:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2018-12-03 05:58:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 11225 transitions. [2018-12-03 05:58:09,302 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 11225 transitions. Word has length 96 [2018-12-03 05:58:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:09,302 INFO L480 AbstractCegarLoop]: Abstraction has 5060 states and 11225 transitions. [2018-12-03 05:58:09,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:58:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 11225 transitions. [2018-12-03 05:58:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:09,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:09,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:09,306 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:09,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1958712360, now seen corresponding path program 1 times [2018-12-03 05:58:09,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:09,383 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-03 05:58:09,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:09,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:58:09,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:09,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:58:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:58:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:09,384 INFO L87 Difference]: Start difference. First operand 5060 states and 11225 transitions. Second operand 7 states. [2018-12-03 05:58:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:09,563 INFO L93 Difference]: Finished difference Result 6723 states and 14775 transitions. [2018-12-03 05:58:09,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 05:58:09,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 05:58:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:09,567 INFO L225 Difference]: With dead ends: 6723 [2018-12-03 05:58:09,568 INFO L226 Difference]: Without dead ends: 6667 [2018-12-03 05:58:09,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:58:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-12-03 05:58:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5537. [2018-12-03 05:58:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5537 states. [2018-12-03 05:58:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 12215 transitions. [2018-12-03 05:58:09,610 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 12215 transitions. Word has length 96 [2018-12-03 05:58:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:09,611 INFO L480 AbstractCegarLoop]: Abstraction has 5537 states and 12215 transitions. [2018-12-03 05:58:09,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:58:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 12215 transitions. [2018-12-03 05:58:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:09,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:09,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:09,614 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:09,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1444123529, now seen corresponding path program 1 times [2018-12-03 05:58:09,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:09,679 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-03 05:58:09,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:09,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:09,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:09,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:09,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:09,680 INFO L87 Difference]: Start difference. First operand 5537 states and 12215 transitions. Second operand 6 states. [2018-12-03 05:58:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:09,876 INFO L93 Difference]: Finished difference Result 6251 states and 13820 transitions. [2018-12-03 05:58:09,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:58:09,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 05:58:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:09,882 INFO L225 Difference]: With dead ends: 6251 [2018-12-03 05:58:09,882 INFO L226 Difference]: Without dead ends: 6251 [2018-12-03 05:58:09,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:58:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2018-12-03 05:58:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 5738. [2018-12-03 05:58:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5738 states. [2018-12-03 05:58:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 12654 transitions. [2018-12-03 05:58:09,934 INFO L78 Accepts]: Start accepts. Automaton has 5738 states and 12654 transitions. Word has length 96 [2018-12-03 05:58:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:09,934 INFO L480 AbstractCegarLoop]: Abstraction has 5738 states and 12654 transitions. [2018-12-03 05:58:09,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5738 states and 12654 transitions. [2018-12-03 05:58:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:09,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:09,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:09,939 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:09,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1287895816, now seen corresponding path program 1 times [2018-12-03 05:58:09,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:09,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:09,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:09,993 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-03 05:58:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:09,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:09,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:09,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:09,994 INFO L87 Difference]: Start difference. First operand 5738 states and 12654 transitions. Second operand 6 states. [2018-12-03 05:58:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:10,340 INFO L93 Difference]: Finished difference Result 7828 states and 17147 transitions. [2018-12-03 05:58:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:58:10,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 05:58:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:10,346 INFO L225 Difference]: With dead ends: 7828 [2018-12-03 05:58:10,346 INFO L226 Difference]: Without dead ends: 7812 [2018-12-03 05:58:10,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:58:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2018-12-03 05:58:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 6150. [2018-12-03 05:58:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6150 states. [2018-12-03 05:58:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 13666 transitions. [2018-12-03 05:58:10,398 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 13666 transitions. Word has length 96 [2018-12-03 05:58:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:10,398 INFO L480 AbstractCegarLoop]: Abstraction has 6150 states and 13666 transitions. [2018-12-03 05:58:10,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 13666 transitions. [2018-12-03 05:58:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:10,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:10,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:10,403 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:10,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:10,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1499246729, now seen corresponding path program 1 times [2018-12-03 05:58:10,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:10,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:10,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:10,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:10,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:10,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-03 05:58:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 05:58:10,468 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:10,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:58:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:58:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 05:58:10,469 INFO L87 Difference]: Start difference. First operand 6150 states and 13666 transitions. Second operand 6 states. [2018-12-03 05:58:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:10,589 INFO L93 Difference]: Finished difference Result 6503 states and 14194 transitions. [2018-12-03 05:58:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:58:10,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 05:58:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:10,594 INFO L225 Difference]: With dead ends: 6503 [2018-12-03 05:58:10,594 INFO L226 Difference]: Without dead ends: 6459 [2018-12-03 05:58:10,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2018-12-03 05:58:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 5527. [2018-12-03 05:58:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5527 states. [2018-12-03 05:58:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 12176 transitions. [2018-12-03 05:58:10,636 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 12176 transitions. Word has length 96 [2018-12-03 05:58:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:10,636 INFO L480 AbstractCegarLoop]: Abstraction has 5527 states and 12176 transitions. [2018-12-03 05:58:10,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:58:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 12176 transitions. [2018-12-03 05:58:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:10,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:10,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:10,640 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:10,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1980997513, now seen corresponding path program 1 times [2018-12-03 05:58:10,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:10,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:10,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:10,772 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-03 05:58:10,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:10,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 05:58:10,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:10,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:58:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:58:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:58:10,773 INFO L87 Difference]: Start difference. First operand 5527 states and 12176 transitions. Second operand 9 states. [2018-12-03 05:58:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:11,049 INFO L93 Difference]: Finished difference Result 6582 states and 14307 transitions. [2018-12-03 05:58:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:58:11,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-03 05:58:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:11,053 INFO L225 Difference]: With dead ends: 6582 [2018-12-03 05:58:11,054 INFO L226 Difference]: Without dead ends: 6582 [2018-12-03 05:58:11,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-03 05:58:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2018-12-03 05:58:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 5831. [2018-12-03 05:58:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5831 states. [2018-12-03 05:58:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5831 states to 5831 states and 12800 transitions. [2018-12-03 05:58:11,093 INFO L78 Accepts]: Start accepts. Automaton has 5831 states and 12800 transitions. Word has length 96 [2018-12-03 05:58:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:11,093 INFO L480 AbstractCegarLoop]: Abstraction has 5831 states and 12800 transitions. [2018-12-03 05:58:11,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:58:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 5831 states and 12800 transitions. [2018-12-03 05:58:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:11,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:11,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:11,097 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:11,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1146496118, now seen corresponding path program 1 times [2018-12-03 05:58:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:11,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:11,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:11,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:11,175 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-03 05:58:11,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:11,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 05:58:11,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:11,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:58:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:58:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:58:11,176 INFO L87 Difference]: Start difference. First operand 5831 states and 12800 transitions. Second operand 7 states. [2018-12-03 05:58:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:11,282 INFO L93 Difference]: Finished difference Result 7465 states and 16512 transitions. [2018-12-03 05:58:11,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:58:11,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 05:58:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:11,287 INFO L225 Difference]: With dead ends: 7465 [2018-12-03 05:58:11,287 INFO L226 Difference]: Without dead ends: 7465 [2018-12-03 05:58:11,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:58:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7465 states. [2018-12-03 05:58:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7465 to 5214. [2018-12-03 05:58:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5214 states. [2018-12-03 05:58:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 11389 transitions. [2018-12-03 05:58:11,328 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 11389 transitions. Word has length 96 [2018-12-03 05:58:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:11,328 INFO L480 AbstractCegarLoop]: Abstraction has 5214 states and 11389 transitions. [2018-12-03 05:58:11,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:58:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 11389 transitions. [2018-12-03 05:58:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:11,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:11,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:11,331 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:11,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:11,332 INFO L82 PathProgramCache]: Analyzing trace with hash -453394421, now seen corresponding path program 1 times [2018-12-03 05:58:11,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:11,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:11,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:11,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:58:11,452 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-03 05:58:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:58:11,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 05:58:11,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:58:11,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 05:58:11,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 05:58:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 05:58:11,453 INFO L87 Difference]: Start difference. First operand 5214 states and 11389 transitions. Second operand 11 states. [2018-12-03 05:58:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:58:12,804 INFO L93 Difference]: Finished difference Result 9915 states and 21866 transitions. [2018-12-03 05:58:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 05:58:12,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-03 05:58:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:58:12,811 INFO L225 Difference]: With dead ends: 9915 [2018-12-03 05:58:12,811 INFO L226 Difference]: Without dead ends: 6171 [2018-12-03 05:58:12,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:58:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2018-12-03 05:58:12,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 4642. [2018-12-03 05:58:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2018-12-03 05:58:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 10103 transitions. [2018-12-03 05:58:12,853 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 10103 transitions. Word has length 96 [2018-12-03 05:58:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:58:12,853 INFO L480 AbstractCegarLoop]: Abstraction has 4642 states and 10103 transitions. [2018-12-03 05:58:12,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 05:58:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 10103 transitions. [2018-12-03 05:58:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 05:58:12,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:58:12,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 05:58:12,856 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:58:12,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:58:12,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-03 05:58:12,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:58:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:12,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:58:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:58:12,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:58:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:58:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 05:58:12,892 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 05:58:12,961 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 05:58:12,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:58:12 BasicIcfg [2018-12-03 05:58:12,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 05:58:12,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 05:58:12,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 05:58:12,962 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 05:58:12,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:57:48" (3/4) ... [2018-12-03 05:58:12,964 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 05:58:13,033 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63027cff-182c-41ae-92fd-d29d05e4fb3a/bin-2019/utaipan/witness.graphml [2018-12-03 05:58:13,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 05:58:13,034 INFO L168 Benchmark]: Toolchain (without parser) took 25740.24 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 953.5 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-03 05:58:13,035 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:58:13,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-03 05:58:13,035 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.13 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-03 05:58:13,035 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:58:13,036 INFO L168 Benchmark]: RCFGBuilder took 367.41 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-03 05:58:13,036 INFO L168 Benchmark]: TraceAbstraction took 24925.57 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-03 05:58:13,036 INFO L168 Benchmark]: Witness Printer took 71.48 ms. Allocated memory is still 4.1 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-12-03 05:58:13,037 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -173.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.13 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 367.41 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24925.57 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 71.48 ms. Allocated memory is still 4.1 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t311; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t312; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 24.8s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8854 SDtfs, 10350 SDslu, 19252 SDs, 0 SdLazy, 8238 SolverSat, 498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 76 SyntacticMatches, 28 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 185996 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2365 NumberOfCodeBlocks, 2365 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2237 ConstructedInterpolants, 0 QuantifiedInterpolants, 543815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...