./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt_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_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/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 911bf73f8425eed07e7a2424facf62a9300c1e77 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 08:10:55,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:10:55,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:10:55,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:10:55,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:10:55,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:10:55,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:10:55,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:10:55,998 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:10:55,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:10:55,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:10:55,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:10:55,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:10:56,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:10:56,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:10:56,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:10:56,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:10:56,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:10:56,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:10:56,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:10:56,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:10:56,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:10:56,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:10:56,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:10:56,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:10:56,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:10:56,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:10:56,008 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:10:56,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:10:56,009 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:10:56,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:10:56,010 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:10:56,010 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:10:56,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:10:56,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:10:56,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:10:56,012 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 08:10:56,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:10:56,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:10:56,020 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:10:56,020 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:10:56,020 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:10:56,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:10:56,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:10:56,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:10:56,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:10:56,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:10:56,023 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:10:56,023 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:10:56,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:10:56,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:10:56,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 08:10:56,023 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_47f30a26-5bbf-4876-80ac-efd55731f59c/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 -> 911bf73f8425eed07e7a2424facf62a9300c1e77 [2018-12-02 08:10:56,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:10:56,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:10:56,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:10:56,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:10:56,053 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:10:56,053 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix048_pso.opt_false-unreach-call.i [2018-12-02 08:10:56,089 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/data/86697b423/26fa7461976a4029af7e5ba61b981f83/FLAGb82ff9373 [2018-12-02 08:10:56,526 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:10:56,527 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/sv-benchmarks/c/pthread-wmm/mix048_pso.opt_false-unreach-call.i [2018-12-02 08:10:56,534 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/data/86697b423/26fa7461976a4029af7e5ba61b981f83/FLAGb82ff9373 [2018-12-02 08:10:56,542 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/data/86697b423/26fa7461976a4029af7e5ba61b981f83 [2018-12-02 08:10:56,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:10:56,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:10:56,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:10:56,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:10:56,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:10:56,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56, skipping insertion in model container [2018-12-02 08:10:56,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:10:56,574 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:10:56,752 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:10:56,760 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:10:56,832 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:10:56,861 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:10:56,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56 WrapperNode [2018-12-02 08:10:56,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:10:56,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:10:56,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:10:56,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:10:56,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:10:56,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:10:56,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:10:56,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:10:56,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... [2018-12-02 08:10:56,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:10:56,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:10:56,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:10:56,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:10:56,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/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-02 08:10:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:10:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:10:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 08:10:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:10:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 08:10:56,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 08:10:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 08:10:56,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 08:10:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 08:10:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:10:56,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:10:56,949 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 08:10:57,238 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:10:57,238 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 08:10:57,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:10:57 BoogieIcfgContainer [2018-12-02 08:10:57,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:10:57,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:10:57,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:10:57,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:10:57,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:10:56" (1/3) ... [2018-12-02 08:10:57,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fa0f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:10:57, skipping insertion in model container [2018-12-02 08:10:57,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:10:56" (2/3) ... [2018-12-02 08:10:57,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fa0f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:10:57, skipping insertion in model container [2018-12-02 08:10:57,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:10:57" (3/3) ... [2018-12-02 08:10:57,243 INFO L112 eAbstractionObserver]: Analyzing ICFG mix048_pso.opt_false-unreach-call.i [2018-12-02 08:10:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,267 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:10:57,292 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 08:10:57,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:10:57,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 08:10:57,307 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 08:10:57,322 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:10:57,322 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:10:57,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:10:57,323 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:10:57,323 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:10:57,323 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:10:57,323 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:10:57,323 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:10:57,330 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-02 08:10:58,833 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-02 08:10:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-02 08:10:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 08:10:58,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:10:58,839 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] [2018-12-02 08:10:58,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:10:58,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:10:58,845 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-02 08:10:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:10:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:10:58,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:10:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:10:58,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:10:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:10:58,978 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-02 08:10:58,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:10:58,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:10:58,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:10:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:10:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:10:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:10:58,993 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-02 08:10:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:10:59,434 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-02 08:10:59,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:10:59,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-02 08:10:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:10:59,604 INFO L225 Difference]: With dead ends: 60790 [2018-12-02 08:10:59,604 INFO L226 Difference]: Without dead ends: 44270 [2018-12-02 08:10:59,605 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-02 08:10:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-02 08:11:00,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-02 08:11:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-02 08:11:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-02 08:11:00,389 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-02 08:11:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:00,389 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-02 08:11:00,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:11:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-02 08:11:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 08:11:00,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:00,396 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] [2018-12-02 08:11:00,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:00,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-02 08:11:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:00,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:00,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:00,456 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-02 08:11:00,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:00,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:11:00,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:00,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:11:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:11:00,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:11:00,458 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-02 08:11:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:00,525 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-02 08:11:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:11:00,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 08:11:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:00,541 INFO L225 Difference]: With dead ends: 8528 [2018-12-02 08:11:00,541 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 08:11:00,542 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-02 08:11:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 08:11:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-02 08:11:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-02 08:11:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-02 08:11:00,629 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-02 08:11:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:00,630 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-02 08:11:00,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:11:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-02 08:11:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 08:11:00,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:00,631 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-02 08:11:00,631 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:00,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:00,631 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-02 08:11:00,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:00,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:00,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:00,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:00,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:00,701 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-02 08:11:00,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:00,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:00,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:00,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:00,703 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-02 08:11:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:00,921 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-02 08:11:00,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:00,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 08:11:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:00,950 INFO L225 Difference]: With dead ends: 13998 [2018-12-02 08:11:00,950 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 08:11:00,951 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-02 08:11:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 08:11:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-02 08:11:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-02 08:11:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-02 08:11:01,163 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-02 08:11:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:01,164 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-02 08:11:01,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-02 08:11:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 08:11:01,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:01,166 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] [2018-12-02 08:11:01,166 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:01,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-02 08:11:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:01,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:01,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:01,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:01,202 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-02 08:11:01,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:01,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:11:01,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:01,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:11:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:11:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:11:01,203 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-02 08:11:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:01,255 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-02 08:11:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:11:01,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 08:11:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:01,271 INFO L225 Difference]: With dead ends: 13279 [2018-12-02 08:11:01,271 INFO L226 Difference]: Without dead ends: 13279 [2018-12-02 08:11:01,271 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-02 08:11:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-02 08:11:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-02 08:11:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-02 08:11:01,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-02 08:11:01,401 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-02 08:11:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:01,402 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-02 08:11:01,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:11:01,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-02 08:11:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 08:11:01,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:01,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] [2018-12-02 08:11:01,403 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:01,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-02 08:11:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:01,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:01,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:01,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:01,480 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-02 08:11:01,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:01,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:11:01,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:01,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:11:01,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:11:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:01,482 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-02 08:11:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:01,856 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-02 08:11:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:11:01,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 08:11:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:01,870 INFO L225 Difference]: With dead ends: 12285 [2018-12-02 08:11:01,870 INFO L226 Difference]: Without dead ends: 12213 [2018-12-02 08:11:01,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 08:11:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-02 08:11:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-02 08:11:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-02 08:11:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-02 08:11:01,981 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-02 08:11:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:01,982 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-02 08:11:01,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:11:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-02 08:11:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 08:11:01,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:01,985 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] [2018-12-02 08:11:01,985 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:01,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-02 08:11:01,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:01,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:02,017 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-02 08:11:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:11:02,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:02,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:11:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:11:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:11:02,019 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-02 08:11:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:02,098 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-02 08:11:02,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:11:02,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 08:11:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:02,112 INFO L225 Difference]: With dead ends: 12396 [2018-12-02 08:11:02,112 INFO L226 Difference]: Without dead ends: 12396 [2018-12-02 08:11:02,113 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-02 08:11:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-02 08:11:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-02 08:11:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-02 08:11:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-02 08:11:02,245 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-02 08:11:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:02,245 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-02 08:11:02,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:11:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-02 08:11:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 08:11:02,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:02,249 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] [2018-12-02 08:11:02,249 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:02,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-02 08:11:02,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:02,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:02,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:02,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:02,310 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-02 08:11:02,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:11:02,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:02,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:11:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:11:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:02,311 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-02 08:11:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:02,660 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-02 08:11:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:11:02,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-02 08:11:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:02,685 INFO L225 Difference]: With dead ends: 20969 [2018-12-02 08:11:02,685 INFO L226 Difference]: Without dead ends: 20898 [2018-12-02 08:11:02,685 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-02 08:11:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-02 08:11:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-02 08:11:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-02 08:11:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-02 08:11:02,859 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-02 08:11:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:02,859 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-02 08:11:02,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:11:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-02 08:11:02,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 08:11:02,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:02,863 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] [2018-12-02 08:11:02,864 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:02,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:02,864 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-12-02 08:11:02,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:02,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:02,908 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-02 08:11:02,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:02,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:11:02,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:02,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:11:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:11:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:11:02,909 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-02 08:11:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:03,105 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-02 08:11:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:11:03,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 08:11:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:03,125 INFO L225 Difference]: With dead ends: 17635 [2018-12-02 08:11:03,125 INFO L226 Difference]: Without dead ends: 17635 [2018-12-02 08:11:03,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:11:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-02 08:11:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-02 08:11:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-02 08:11:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-02 08:11:03,298 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-02 08:11:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:03,299 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-02 08:11:03,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:11:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-02 08:11:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 08:11:03,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:03,304 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] [2018-12-02 08:11:03,304 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:03,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-12-02 08:11:03,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:03,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:03,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:03,329 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-02 08:11:03,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:03,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:11:03,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:03,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:11:03,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:11:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:11:03,330 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-02 08:11:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:03,475 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-02 08:11:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:11:03,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-02 08:11:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:03,493 INFO L225 Difference]: With dead ends: 16385 [2018-12-02 08:11:03,493 INFO L226 Difference]: Without dead ends: 16385 [2018-12-02 08:11:03,494 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-02 08:11:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-02 08:11:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-02 08:11:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-02 08:11:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-02 08:11:03,655 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-02 08:11:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:03,656 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-02 08:11:03,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:11:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-02 08:11:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:03,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:03,662 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] [2018-12-02 08:11:03,662 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:03,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-12-02 08:11:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:03,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:03,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:03,724 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-02 08:11:03,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:03,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:11:03,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:03,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:11:03,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:11:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:03,788 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-02 08:11:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:04,416 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-02 08:11:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:04,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 08:11:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:04,443 INFO L225 Difference]: With dead ends: 19821 [2018-12-02 08:11:04,443 INFO L226 Difference]: Without dead ends: 19821 [2018-12-02 08:11:04,443 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-02 08:11:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-02 08:11:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-02 08:11:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-02 08:11:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-02 08:11:04,633 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-02 08:11:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:04,634 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-02 08:11:04,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:11:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-02 08:11:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:04,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:04,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] [2018-12-02 08:11:04,640 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:04,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-12-02 08:11:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:04,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:04,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:04,700 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-02 08:11:04,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:04,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:11:04,701 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:04,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:11:04,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:11:04,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:04,701 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-02 08:11:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:04,964 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-02 08:11:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:11:04,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 08:11:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:04,985 INFO L225 Difference]: With dead ends: 21449 [2018-12-02 08:11:04,985 INFO L226 Difference]: Without dead ends: 21449 [2018-12-02 08:11:04,985 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-02 08:11:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-02 08:11:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-02 08:11:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-02 08:11:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-02 08:11:05,184 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-02 08:11:05,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:05,184 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-02 08:11:05,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:11:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-02 08:11:05,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:05,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:05,191 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] [2018-12-02 08:11:05,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:05,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-12-02 08:11:05,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:05,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:05,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:05,224 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-02 08:11:05,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:05,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:05,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:05,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:05,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:05,224 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-02 08:11:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:05,466 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-02 08:11:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:05,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 08:11:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:05,493 INFO L225 Difference]: With dead ends: 25024 [2018-12-02 08:11:05,493 INFO L226 Difference]: Without dead ends: 25024 [2018-12-02 08:11:05,493 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-02 08:11:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-02 08:11:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-02 08:11:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-02 08:11:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-02 08:11:05,748 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-02 08:11:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:05,748 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-02 08:11:05,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-02 08:11:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:05,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:05,755 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] [2018-12-02 08:11:05,756 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:05,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:05,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-12-02 08:11:05,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:05,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:05,819 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-02 08:11:05,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:05,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:11:05,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:05,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:11:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:11:05,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:05,820 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 6 states. [2018-12-02 08:11:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:06,435 INFO L93 Difference]: Finished difference Result 30713 states and 93495 transitions. [2018-12-02 08:11:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:11:06,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-02 08:11:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:06,467 INFO L225 Difference]: With dead ends: 30713 [2018-12-02 08:11:06,467 INFO L226 Difference]: Without dead ends: 30609 [2018-12-02 08:11:06,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30609 states. [2018-12-02 08:11:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30609 to 27953. [2018-12-02 08:11:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27953 states. [2018-12-02 08:11:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27953 states to 27953 states and 84685 transitions. [2018-12-02 08:11:06,782 INFO L78 Accepts]: Start accepts. Automaton has 27953 states and 84685 transitions. Word has length 66 [2018-12-02 08:11:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:06,782 INFO L480 AbstractCegarLoop]: Abstraction has 27953 states and 84685 transitions. [2018-12-02 08:11:06,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:11:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27953 states and 84685 transitions. [2018-12-02 08:11:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:06,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:06,791 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] [2018-12-02 08:11:06,791 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:06,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-12-02 08:11:06,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:06,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:06,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:06,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:06,838 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-02 08:11:06,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:06,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:06,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:06,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:06,840 INFO L87 Difference]: Start difference. First operand 27953 states and 84685 transitions. Second operand 5 states. [2018-12-02 08:11:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:07,174 INFO L93 Difference]: Finished difference Result 40003 states and 119732 transitions. [2018-12-02 08:11:07,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:11:07,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 08:11:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:07,221 INFO L225 Difference]: With dead ends: 40003 [2018-12-02 08:11:07,222 INFO L226 Difference]: Without dead ends: 39851 [2018-12-02 08:11:07,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:11:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39851 states. [2018-12-02 08:11:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39851 to 35599. [2018-12-02 08:11:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35599 states. [2018-12-02 08:11:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35599 states to 35599 states and 107263 transitions. [2018-12-02 08:11:07,620 INFO L78 Accepts]: Start accepts. Automaton has 35599 states and 107263 transitions. Word has length 66 [2018-12-02 08:11:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 35599 states and 107263 transitions. [2018-12-02 08:11:07,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35599 states and 107263 transitions. [2018-12-02 08:11:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:07,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:07,629 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] [2018-12-02 08:11:07,630 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:07,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-12-02 08:11:07,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:07,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:07,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:07,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:07,714 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-02 08:11:07,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:07,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:11:07,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:07,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:11:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:11:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:07,715 INFO L87 Difference]: Start difference. First operand 35599 states and 107263 transitions. Second operand 7 states. [2018-12-02 08:11:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:08,016 INFO L93 Difference]: Finished difference Result 31703 states and 90827 transitions. [2018-12-02 08:11:08,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:11:08,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-12-02 08:11:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:08,047 INFO L225 Difference]: With dead ends: 31703 [2018-12-02 08:11:08,047 INFO L226 Difference]: Without dead ends: 31703 [2018-12-02 08:11:08,047 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-02 08:11:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31703 states. [2018-12-02 08:11:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31703 to 25460. [2018-12-02 08:11:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25460 states. [2018-12-02 08:11:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25460 states to 25460 states and 73006 transitions. [2018-12-02 08:11:08,363 INFO L78 Accepts]: Start accepts. Automaton has 25460 states and 73006 transitions. Word has length 66 [2018-12-02 08:11:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:08,363 INFO L480 AbstractCegarLoop]: Abstraction has 25460 states and 73006 transitions. [2018-12-02 08:11:08,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:11:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25460 states and 73006 transitions. [2018-12-02 08:11:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:08,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:08,371 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] [2018-12-02 08:11:08,371 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:08,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1503101163, now seen corresponding path program 1 times [2018-12-02 08:11:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:08,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:08,403 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-02 08:11:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:08,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:08,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:08,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:08,404 INFO L87 Difference]: Start difference. First operand 25460 states and 73006 transitions. Second operand 5 states. [2018-12-02 08:11:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:08,459 INFO L93 Difference]: Finished difference Result 7460 states and 17978 transitions. [2018-12-02 08:11:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:11:08,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-02 08:11:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:08,464 INFO L225 Difference]: With dead ends: 7460 [2018-12-02 08:11:08,464 INFO L226 Difference]: Without dead ends: 6135 [2018-12-02 08:11:08,464 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-02 08:11:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2018-12-02 08:11:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 5529. [2018-12-02 08:11:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2018-12-02 08:11:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 12867 transitions. [2018-12-02 08:11:08,503 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 12867 transitions. Word has length 66 [2018-12-02 08:11:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:08,503 INFO L480 AbstractCegarLoop]: Abstraction has 5529 states and 12867 transitions. [2018-12-02 08:11:08,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 12867 transitions. [2018-12-02 08:11:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 08:11:08,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:08,506 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] [2018-12-02 08:11:08,507 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:08,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-02 08:11:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:08,530 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-02 08:11:08,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:08,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:11:08,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:08,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:11:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:11:08,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:11:08,531 INFO L87 Difference]: Start difference. First operand 5529 states and 12867 transitions. Second operand 3 states. [2018-12-02 08:11:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:08,570 INFO L93 Difference]: Finished difference Result 7165 states and 16473 transitions. [2018-12-02 08:11:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:11:08,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 08:11:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:08,575 INFO L225 Difference]: With dead ends: 7165 [2018-12-02 08:11:08,575 INFO L226 Difference]: Without dead ends: 7165 [2018-12-02 08:11:08,575 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-02 08:11:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2018-12-02 08:11:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 5468. [2018-12-02 08:11:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-02 08:11:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12407 transitions. [2018-12-02 08:11:08,617 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12407 transitions. Word has length 66 [2018-12-02 08:11:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:08,618 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12407 transitions. [2018-12-02 08:11:08,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:11:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12407 transitions. [2018-12-02 08:11:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 08:11:08,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:08,621 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] [2018-12-02 08:11:08,621 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:08,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-02 08:11:08,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:08,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:08,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:08,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-02 08:11:08,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:08,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:08,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:08,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:08,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:08,662 INFO L87 Difference]: Start difference. First operand 5468 states and 12407 transitions. Second operand 5 states. [2018-12-02 08:11:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:08,753 INFO L93 Difference]: Finished difference Result 6622 states and 15012 transitions. [2018-12-02 08:11:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:11:08,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 08:11:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:08,757 INFO L225 Difference]: With dead ends: 6622 [2018-12-02 08:11:08,757 INFO L226 Difference]: Without dead ends: 6622 [2018-12-02 08:11:08,757 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-02 08:11:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2018-12-02 08:11:08,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 5912. [2018-12-02 08:11:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5912 states. [2018-12-02 08:11:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 13411 transitions. [2018-12-02 08:11:08,799 INFO L78 Accepts]: Start accepts. Automaton has 5912 states and 13411 transitions. Word has length 72 [2018-12-02 08:11:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:08,799 INFO L480 AbstractCegarLoop]: Abstraction has 5912 states and 13411 transitions. [2018-12-02 08:11:08,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5912 states and 13411 transitions. [2018-12-02 08:11:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 08:11:08,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:08,802 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] [2018-12-02 08:11:08,802 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:08,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-02 08:11:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:08,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:08,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:08,899 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-02 08:11:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:11:08,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:08,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:11:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:11:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:11:08,900 INFO L87 Difference]: Start difference. First operand 5912 states and 13411 transitions. Second operand 9 states. [2018-12-02 08:11:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:09,204 INFO L93 Difference]: Finished difference Result 7374 states and 16560 transitions. [2018-12-02 08:11:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 08:11:09,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-02 08:11:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:09,209 INFO L225 Difference]: With dead ends: 7374 [2018-12-02 08:11:09,209 INFO L226 Difference]: Without dead ends: 7272 [2018-12-02 08:11:09,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-02 08:11:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-12-02 08:11:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6009. [2018-12-02 08:11:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6009 states. [2018-12-02 08:11:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6009 states to 6009 states and 13504 transitions. [2018-12-02 08:11:09,252 INFO L78 Accepts]: Start accepts. Automaton has 6009 states and 13504 transitions. Word has length 72 [2018-12-02 08:11:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:09,252 INFO L480 AbstractCegarLoop]: Abstraction has 6009 states and 13504 transitions. [2018-12-02 08:11:09,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:11:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6009 states and 13504 transitions. [2018-12-02 08:11:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:11:09,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:09,256 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] [2018-12-02 08:11:09,256 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:09,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1961022429, now seen corresponding path program 1 times [2018-12-02 08:11:09,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:09,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:09,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:09,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:09,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:09,330 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-02 08:11:09,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:09,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:11:09,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:09,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:11:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:11:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:09,331 INFO L87 Difference]: Start difference. First operand 6009 states and 13504 transitions. Second operand 7 states. [2018-12-02 08:11:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:09,765 INFO L93 Difference]: Finished difference Result 7489 states and 16833 transitions. [2018-12-02 08:11:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:09,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 08:11:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:09,770 INFO L225 Difference]: With dead ends: 7489 [2018-12-02 08:11:09,770 INFO L226 Difference]: Without dead ends: 7489 [2018-12-02 08:11:09,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2018-12-02 08:11:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 6149. [2018-12-02 08:11:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2018-12-02 08:11:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 13892 transitions. [2018-12-02 08:11:09,821 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 13892 transitions. Word has length 93 [2018-12-02 08:11:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:09,821 INFO L480 AbstractCegarLoop]: Abstraction has 6149 states and 13892 transitions. [2018-12-02 08:11:09,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:11:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 13892 transitions. [2018-12-02 08:11:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 08:11:09,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:09,825 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] [2018-12-02 08:11:09,826 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:09,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 397526624, now seen corresponding path program 1 times [2018-12-02 08:11:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:09,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:09,860 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-02 08:11:09,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:09,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:11:09,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:09,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:11:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:11:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:11:09,862 INFO L87 Difference]: Start difference. First operand 6149 states and 13892 transitions. Second operand 4 states. [2018-12-02 08:11:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:09,928 INFO L93 Difference]: Finished difference Result 7316 states and 16390 transitions. [2018-12-02 08:11:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:11:09,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-02 08:11:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:09,933 INFO L225 Difference]: With dead ends: 7316 [2018-12-02 08:11:09,933 INFO L226 Difference]: Without dead ends: 7316 [2018-12-02 08:11:09,933 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-02 08:11:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2018-12-02 08:11:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 6506. [2018-12-02 08:11:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2018-12-02 08:11:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 14662 transitions. [2018-12-02 08:11:09,987 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 14662 transitions. Word has length 93 [2018-12-02 08:11:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:09,988 INFO L480 AbstractCegarLoop]: Abstraction has 6506 states and 14662 transitions. [2018-12-02 08:11:09,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:11:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 14662 transitions. [2018-12-02 08:11:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:09,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:09,992 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] [2018-12-02 08:11:09,992 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:09,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash 51507110, now seen corresponding path program 1 times [2018-12-02 08:11:09,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:09,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:09,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:10,048 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-02 08:11:10,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:10,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:10,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:10,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:10,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:10,049 INFO L87 Difference]: Start difference. First operand 6506 states and 14662 transitions. Second operand 5 states. [2018-12-02 08:11:10,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:10,114 INFO L93 Difference]: Finished difference Result 7013 states and 15750 transitions. [2018-12-02 08:11:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:10,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-02 08:11:10,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:10,119 INFO L225 Difference]: With dead ends: 7013 [2018-12-02 08:11:10,119 INFO L226 Difference]: Without dead ends: 7013 [2018-12-02 08:11:10,119 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-02 08:11:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2018-12-02 08:11:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5402. [2018-12-02 08:11:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5402 states. [2018-12-02 08:11:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5402 states to 5402 states and 12178 transitions. [2018-12-02 08:11:10,163 INFO L78 Accepts]: Start accepts. Automaton has 5402 states and 12178 transitions. Word has length 95 [2018-12-02 08:11:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:10,163 INFO L480 AbstractCegarLoop]: Abstraction has 5402 states and 12178 transitions. [2018-12-02 08:11:10,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5402 states and 12178 transitions. [2018-12-02 08:11:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:10,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:10,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 08:11:10,167 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:10,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash 62823237, now seen corresponding path program 1 times [2018-12-02 08:11:10,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:10,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:10,277 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-02 08:11:10,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 08:11:10,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:10,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 08:11:10,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:11:10,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:11:10,278 INFO L87 Difference]: Start difference. First operand 5402 states and 12178 transitions. Second operand 11 states. [2018-12-02 08:11:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:11,126 INFO L93 Difference]: Finished difference Result 7780 states and 17289 transitions. [2018-12-02 08:11:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 08:11:11,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 08:11:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:11,136 INFO L225 Difference]: With dead ends: 7780 [2018-12-02 08:11:11,137 INFO L226 Difference]: Without dead ends: 7748 [2018-12-02 08:11:11,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-12-02 08:11:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2018-12-02 08:11:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6075. [2018-12-02 08:11:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2018-12-02 08:11:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 13575 transitions. [2018-12-02 08:11:11,211 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 13575 transitions. Word has length 95 [2018-12-02 08:11:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:11,211 INFO L480 AbstractCegarLoop]: Abstraction has 6075 states and 13575 transitions. [2018-12-02 08:11:11,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 08:11:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 13575 transitions. [2018-12-02 08:11:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:11,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:11,216 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] [2018-12-02 08:11:11,216 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:11,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1126882425, now seen corresponding path program 1 times [2018-12-02 08:11:11,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:11,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:11:11,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:11,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 08:11:11,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:11,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 08:11:11,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 08:11:11,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:11:11,316 INFO L87 Difference]: Start difference. First operand 6075 states and 13575 transitions. Second operand 9 states. [2018-12-02 08:11:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:11,846 INFO L93 Difference]: Finished difference Result 7670 states and 16959 transitions. [2018-12-02 08:11:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 08:11:11,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-02 08:11:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:11,855 INFO L225 Difference]: With dead ends: 7670 [2018-12-02 08:11:11,855 INFO L226 Difference]: Without dead ends: 7670 [2018-12-02 08:11:11,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-02 08:11:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2018-12-02 08:11:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 6328. [2018-12-02 08:11:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-02 08:11:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 14116 transitions. [2018-12-02 08:11:11,916 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 14116 transitions. Word has length 95 [2018-12-02 08:11:11,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:11,916 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 14116 transitions. [2018-12-02 08:11:11,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 08:11:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 14116 transitions. [2018-12-02 08:11:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:11,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:11,924 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] [2018-12-02 08:11:11,924 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:11,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:11,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-12-02 08:11:11,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:11,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:12,008 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-02 08:11:12,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:12,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:11:12,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:12,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:11:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:11:12,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:11:12,009 INFO L87 Difference]: Start difference. First operand 6328 states and 14116 transitions. Second operand 5 states. [2018-12-02 08:11:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:12,045 INFO L93 Difference]: Finished difference Result 6328 states and 14100 transitions. [2018-12-02 08:11:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:11:12,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-02 08:11:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:12,048 INFO L225 Difference]: With dead ends: 6328 [2018-12-02 08:11:12,048 INFO L226 Difference]: Without dead ends: 6328 [2018-12-02 08:11:12,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2018-12-02 08:11:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 5834. [2018-12-02 08:11:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2018-12-02 08:11:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 12950 transitions. [2018-12-02 08:11:12,085 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 12950 transitions. Word has length 95 [2018-12-02 08:11:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:12,085 INFO L480 AbstractCegarLoop]: Abstraction has 5834 states and 12950 transitions. [2018-12-02 08:11:12,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:11:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 12950 transitions. [2018-12-02 08:11:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:12,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:12,089 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] [2018-12-02 08:11:12,089 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:12,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-12-02 08:11:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:12,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:12,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:12,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:12,182 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-02 08:11:12,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 08:11:12,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:12,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 08:11:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:11:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:11:12,183 INFO L87 Difference]: Start difference. First operand 5834 states and 12950 transitions. Second operand 11 states. [2018-12-02 08:11:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:13,300 INFO L93 Difference]: Finished difference Result 10673 states and 23818 transitions. [2018-12-02 08:11:13,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 08:11:13,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 08:11:13,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:13,305 INFO L225 Difference]: With dead ends: 10673 [2018-12-02 08:11:13,305 INFO L226 Difference]: Without dead ends: 7307 [2018-12-02 08:11:13,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 08:11:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2018-12-02 08:11:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 5651. [2018-12-02 08:11:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5651 states. [2018-12-02 08:11:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5651 states to 5651 states and 12511 transitions. [2018-12-02 08:11:13,346 INFO L78 Accepts]: Start accepts. Automaton has 5651 states and 12511 transitions. Word has length 95 [2018-12-02 08:11:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:13,346 INFO L480 AbstractCegarLoop]: Abstraction has 5651 states and 12511 transitions. [2018-12-02 08:11:13,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 08:11:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 5651 states and 12511 transitions. [2018-12-02 08:11:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:13,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:13,350 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] [2018-12-02 08:11:13,350 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:13,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:13,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1822988144, now seen corresponding path program 1 times [2018-12-02 08:11:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:13,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:13,413 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-02 08:11:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:11:13,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:13,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:11:13,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:11:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:13,413 INFO L87 Difference]: Start difference. First operand 5651 states and 12511 transitions. Second operand 6 states. [2018-12-02 08:11:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:13,511 INFO L93 Difference]: Finished difference Result 6456 states and 14105 transitions. [2018-12-02 08:11:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:13,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 08:11:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:13,515 INFO L225 Difference]: With dead ends: 6456 [2018-12-02 08:11:13,515 INFO L226 Difference]: Without dead ends: 6419 [2018-12-02 08:11:13,515 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-02 08:11:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2018-12-02 08:11:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 5751. [2018-12-02 08:11:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5751 states. [2018-12-02 08:11:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 12603 transitions. [2018-12-02 08:11:13,555 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 12603 transitions. Word has length 95 [2018-12-02 08:11:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:13,555 INFO L480 AbstractCegarLoop]: Abstraction has 5751 states and 12603 transitions. [2018-12-02 08:11:13,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:11:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 12603 transitions. [2018-12-02 08:11:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:13,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:13,558 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] [2018-12-02 08:11:13,559 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:13,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1486517392, now seen corresponding path program 2 times [2018-12-02 08:11:13,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:13,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:13,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:13,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:13,624 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-02 08:11:13,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:11:13,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:11:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:11:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:13,625 INFO L87 Difference]: Start difference. First operand 5751 states and 12603 transitions. Second operand 7 states. [2018-12-02 08:11:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:13,855 INFO L93 Difference]: Finished difference Result 7729 states and 16698 transitions. [2018-12-02 08:11:13,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 08:11:13,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 08:11:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:13,860 INFO L225 Difference]: With dead ends: 7729 [2018-12-02 08:11:13,860 INFO L226 Difference]: Without dead ends: 7729 [2018-12-02 08:11:13,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-02 08:11:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7729 states. [2018-12-02 08:11:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7729 to 6230. [2018-12-02 08:11:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6230 states. [2018-12-02 08:11:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 13665 transitions. [2018-12-02 08:11:13,907 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 13665 transitions. Word has length 95 [2018-12-02 08:11:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:13,907 INFO L480 AbstractCegarLoop]: Abstraction has 6230 states and 13665 transitions. [2018-12-02 08:11:13,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:11:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 13665 transitions. [2018-12-02 08:11:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:13,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:13,911 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] [2018-12-02 08:11:13,911 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:13,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 1 times [2018-12-02 08:11:13,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:13,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:11:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:13,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:13,974 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-02 08:11:13,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:13,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:11:13,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:13,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:11:13,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:11:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:11:13,975 INFO L87 Difference]: Start difference. First operand 6230 states and 13665 transitions. Second operand 6 states. [2018-12-02 08:11:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:14,080 INFO L93 Difference]: Finished difference Result 6511 states and 14234 transitions. [2018-12-02 08:11:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:11:14,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-02 08:11:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:14,085 INFO L225 Difference]: With dead ends: 6511 [2018-12-02 08:11:14,085 INFO L226 Difference]: Without dead ends: 6511 [2018-12-02 08:11:14,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:11:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2018-12-02 08:11:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 6105. [2018-12-02 08:11:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6105 states. [2018-12-02 08:11:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6105 states to 6105 states and 13384 transitions. [2018-12-02 08:11:14,127 INFO L78 Accepts]: Start accepts. Automaton has 6105 states and 13384 transitions. Word has length 95 [2018-12-02 08:11:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:14,127 INFO L480 AbstractCegarLoop]: Abstraction has 6105 states and 13384 transitions. [2018-12-02 08:11:14,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:11:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6105 states and 13384 transitions. [2018-12-02 08:11:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:14,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:14,131 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] [2018-12-02 08:11:14,131 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:14,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:14,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2142213391, now seen corresponding path program 2 times [2018-12-02 08:11:14,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:11:14,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:14,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:11:14,211 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-02 08:11:14,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:11:14,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:11:14,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:11:14,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:11:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:11:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:11:14,212 INFO L87 Difference]: Start difference. First operand 6105 states and 13384 transitions. Second operand 7 states. [2018-12-02 08:11:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:11:14,310 INFO L93 Difference]: Finished difference Result 7349 states and 16045 transitions. [2018-12-02 08:11:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:11:14,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-02 08:11:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:11:14,315 INFO L225 Difference]: With dead ends: 7349 [2018-12-02 08:11:14,315 INFO L226 Difference]: Without dead ends: 7349 [2018-12-02 08:11:14,315 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-02 08:11:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2018-12-02 08:11:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 5311. [2018-12-02 08:11:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2018-12-02 08:11:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 11544 transitions. [2018-12-02 08:11:14,354 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 11544 transitions. Word has length 95 [2018-12-02 08:11:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:11:14,354 INFO L480 AbstractCegarLoop]: Abstraction has 5311 states and 11544 transitions. [2018-12-02 08:11:14,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:11:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 11544 transitions. [2018-12-02 08:11:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 08:11:14,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:11:14,358 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] [2018-12-02 08:11:14,358 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:11:14,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:11:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-12-02 08:11:14,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:11:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:14,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:11:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:11:14,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:11:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:11:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:11:14,403 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:11:14,470 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 08:11:14,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:11:14 BasicIcfg [2018-12-02 08:11:14,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:11:14,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:11:14,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:11:14,472 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:11:14,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:10:57" (3/4) ... [2018-12-02 08:11:14,474 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 08:11:14,543 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_47f30a26-5bbf-4876-80ac-efd55731f59c/bin-2019/utaipan/witness.graphml [2018-12-02 08:11:14,543 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:11:14,544 INFO L168 Benchmark]: Toolchain (without parser) took 17999.74 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 952.4 MB in the beginning and 1.3 GB in the end (delta: -375.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 08:11:14,545 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:11:14,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-02 08:11:14,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.42 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:11:14,545 INFO L168 Benchmark]: Boogie Preprocessor took 20.12 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-02 08:11:14,545 INFO L168 Benchmark]: RCFGBuilder took 325.55 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: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:11:14,546 INFO L168 Benchmark]: TraceAbstraction took 17232.23 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -305.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 08:11:14,546 INFO L168 Benchmark]: Witness Printer took 71.65 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:11:14,547 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.42 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.12 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 325.55 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: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17232.23 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -305.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 71.65 ms. Allocated memory is still 2.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 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] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L770] -1 pthread_t t1289; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L771] FCALL, FORK -1 pthread_create(&t1289, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t1290; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L773] FCALL, FORK -1 pthread_create(&t1290, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L715] 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, 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] [L729] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L736] 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=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] [L736] 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) [L737] 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=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] [L737] 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)) [L738] 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=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] [L738] 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)) [L739] 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=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] [L739] 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)) [L740] 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=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] [L740] 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)) [L741] 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=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] [L741] 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)) [L742] 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=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] [L742] 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)) [L743] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L715] 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) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L717] 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 [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$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 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L748] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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] [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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] [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_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] [L752] 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L779] 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=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] [L779] 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=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] [L779] 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=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] [L779] -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) [L780] 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=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] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] 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=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] [L781] -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 [L782] 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=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] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] 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=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] [L783] -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 [L786] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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=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, 222 locations, 3 error locations. UNSAFE Result, 17.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8243 SDtfs, 10027 SDslu, 19834 SDs, 0 SdLazy, 9374 SolverSat, 410 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 76 SyntacticMatches, 40 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35599occurred in iteration=14, 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: 4.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 73306 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2280 NumberOfCodeBlocks, 2280 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2155 ConstructedInterpolants, 0 QuantifiedInterpolants, 524804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...