./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_rmo.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_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/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 e42b6a2a35cef26e55b291e79df7165f23d753e1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:46:52,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:46:52,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:46:52,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:46:52,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:46:52,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:46:52,804 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:46:52,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:46:52,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:46:52,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:46:52,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:46:52,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:46:52,808 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:46:52,809 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:46:52,810 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:46:52,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:46:52,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:46:52,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:46:52,813 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:46:52,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:46:52,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:46:52,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:46:52,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:46:52,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:46:52,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:46:52,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:46:52,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:46:52,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:46:52,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:46:52,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:46:52,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:46:52,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:46:52,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:46:52,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:46:52,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:46:52,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:46:52,822 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:46:52,829 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:46:52,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:46:52,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:46:52,830 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:46:52,830 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:46:52,830 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:46:52,830 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:46:52,831 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:46:52,831 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:46:52,831 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:46:52,831 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:46:52,831 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:46:52,831 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:46:52,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:46:52,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:46:52,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:46:52,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:46:52,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:46:52,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:46:52,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:46:52,833 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:46:52,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:46:52,833 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:46:52,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:46:52,834 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:46:52,834 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:46:52,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:46:52,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:46:52,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:46:52,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:46:52,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:46:52,835 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:46:52,835 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:46:52,835 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:46:52,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:46:52,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:46:52,836 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_05f250e5-1db8-4823-8711-f0c2b1fe39c7/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 -> e42b6a2a35cef26e55b291e79df7165f23d753e1 [2018-12-03 07:46:52,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:46:52,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:46:52,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:46:52,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:46:52,868 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:46:52,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i [2018-12-03 07:46:52,902 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/data/d86f0982e/099e9463246c4d08892a2f9992d3769c/FLAG8d983c120 [2018-12-03 07:46:53,339 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:46:53,339 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/sv-benchmarks/c/pthread-wmm/mix045_rmo.opt_false-unreach-call.i [2018-12-03 07:46:53,347 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/data/d86f0982e/099e9463246c4d08892a2f9992d3769c/FLAG8d983c120 [2018-12-03 07:46:53,355 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/data/d86f0982e/099e9463246c4d08892a2f9992d3769c [2018-12-03 07:46:53,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:46:53,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:46:53,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:46:53,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:46:53,360 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:46:53,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,362 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 03.12 07:46:53, skipping insertion in model container [2018-12-03 07:46:53,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:46:53,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:46:53,565 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:46:53,573 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:46:53,645 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:46:53,676 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:46:53,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53 WrapperNode [2018-12-03 07:46:53,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:46:53,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:46:53,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:46:53,677 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:46:53,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:46:53,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:46:53,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:46:53,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:46:53,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... [2018-12-03 07:46:53,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:46:53,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:46:53,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:46:53,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:46:53,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:46:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:46:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:46:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 07:46:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:46:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 07:46:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 07:46:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 07:46:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 07:46:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 07:46:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 07:46:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 07:46:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:46:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:46:53,770 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 07:46:54,100 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:46:54,100 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 07:46:54,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:46:54 BoogieIcfgContainer [2018-12-03 07:46:54,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:46:54,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:46:54,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:46:54,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:46:54,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:46:53" (1/3) ... [2018-12-03 07:46:54,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f3e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:46:54, skipping insertion in model container [2018-12-03 07:46:54,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:46:53" (2/3) ... [2018-12-03 07:46:54,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f3e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:46:54, skipping insertion in model container [2018-12-03 07:46:54,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:46:54" (3/3) ... [2018-12-03 07:46:54,107 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt_false-unreach-call.i [2018-12-03 07:46:54,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,139 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,139 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,139 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,140 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,141 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,141 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,141 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,142 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,143 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,144 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,145 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,146 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,146 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,146 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,147 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,147 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,147 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,147 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,148 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,149 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,150 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,151 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,152 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:46:54,158 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 07:46:54,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:46:54,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 07:46:54,180 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 07:46:54,201 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:46:54,201 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:46:54,201 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:46:54,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:46:54,202 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:46:54,202 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:46:54,202 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:46:54,202 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:46:54,212 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-03 07:47:07,882 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-03 07:47:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-03 07:47:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 07:47:07,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:07,891 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-03 07:47:07,893 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:07,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-03 07:47:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:07,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:07,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:07,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:07,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:08,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:08,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:47:08,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:08,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:47:08,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:47:08,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:47:08,054 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-03 07:47:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:09,228 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-03 07:47:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:47:09,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-03 07:47:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:11,601 INFO L225 Difference]: With dead ends: 233474 [2018-12-03 07:47:11,601 INFO L226 Difference]: Without dead ends: 203724 [2018-12-03 07:47:11,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:47:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-03 07:47:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-03 07:47:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-03 07:47:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-03 07:47:14,918 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-03 07:47:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:14,919 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-03 07:47:14,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:47:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-03 07:47:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:47:14,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:14,925 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-03 07:47:14,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:14,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-03 07:47:14,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:14,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:14,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:14,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:14,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:14,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:47:14,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:14,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:47:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:47:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:47:14,968 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-03 07:47:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:15,896 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-03 07:47:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:47:15,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 07:47:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:16,200 INFO L225 Difference]: With dead ends: 118894 [2018-12-03 07:47:16,200 INFO L226 Difference]: Without dead ends: 118894 [2018-12-03 07:47:16,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:47:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-03 07:47:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-03 07:47:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-03 07:47:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-03 07:47:20,385 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-03 07:47:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:20,385 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-03 07:47:20,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:47:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-03 07:47:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 07:47:20,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:20,388 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-03 07:47:20,388 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:20,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:20,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-03 07:47:20,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:20,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:20,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:20,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:20,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:47:20,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:20,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:47:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:47:20,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:47:20,446 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-03 07:47:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:22,005 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-03 07:47:22,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:47:22,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 07:47:22,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:23,337 INFO L225 Difference]: With dead ends: 325274 [2018-12-03 07:47:23,338 INFO L226 Difference]: Without dead ends: 324274 [2018-12-03 07:47:23,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:47:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-03 07:47:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-03 07:47:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-03 07:47:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-03 07:47:30,353 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-03 07:47:30,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:30,353 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-03 07:47:30,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:47:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-03 07:47:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:47:30,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:30,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:47:30,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:30,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:30,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-03 07:47:30,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:30,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:30,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:30,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:30,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:30,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:30,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:47:30,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:30,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:47:30,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:47:30,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:47:30,398 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 5 states. [2018-12-03 07:47:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:32,365 INFO L93 Difference]: Finished difference Result 334054 states and 1500995 transitions. [2018-12-03 07:47:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:47:32,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-03 07:47:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:33,262 INFO L225 Difference]: With dead ends: 334054 [2018-12-03 07:47:33,262 INFO L226 Difference]: Without dead ends: 333004 [2018-12-03 07:47:33,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:47:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-12-03 07:47:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-12-03 07:47:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-12-03 07:47:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876474 transitions. [2018-12-03 07:47:41,338 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876474 transitions. Word has length 53 [2018-12-03 07:47:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:41,338 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876474 transitions. [2018-12-03 07:47:41,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:47:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876474 transitions. [2018-12-03 07:47:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:47:41,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:41,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] [2018-12-03 07:47:41,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:41,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1090824439, now seen corresponding path program 1 times [2018-12-03 07:47:41,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:41,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:41,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:41,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:41,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:41,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:47:41,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:41,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:47:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:47:41,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:47:41,392 INFO L87 Difference]: Start difference. First operand 194884 states and 876474 transitions. Second operand 3 states. [2018-12-03 07:47:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:42,207 INFO L93 Difference]: Finished difference Result 194884 states and 876429 transitions. [2018-12-03 07:47:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:47:42,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-03 07:47:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:42,675 INFO L225 Difference]: With dead ends: 194884 [2018-12-03 07:47:42,676 INFO L226 Difference]: Without dead ends: 194884 [2018-12-03 07:47:42,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:47:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194884 states. [2018-12-03 07:47:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194884 to 194884. [2018-12-03 07:47:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-12-03 07:47:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876429 transitions. [2018-12-03 07:47:47,057 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876429 transitions. Word has length 60 [2018-12-03 07:47:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:47,057 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876429 transitions. [2018-12-03 07:47:47,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:47:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876429 transitions. [2018-12-03 07:47:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 07:47:47,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:47,076 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-03 07:47:47,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:47,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 651985896, now seen corresponding path program 1 times [2018-12-03 07:47:47,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:47,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:47,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:47,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:47:47,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:47,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:47:47,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:47:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:47:47,124 INFO L87 Difference]: Start difference. First operand 194884 states and 876429 transitions. Second operand 4 states. [2018-12-03 07:47:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:48,179 INFO L93 Difference]: Finished difference Result 172220 states and 761291 transitions. [2018-12-03 07:47:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:47:48,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-03 07:47:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:48,561 INFO L225 Difference]: With dead ends: 172220 [2018-12-03 07:47:48,561 INFO L226 Difference]: Without dead ends: 169615 [2018-12-03 07:47:48,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:47:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169615 states. [2018-12-03 07:47:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169615 to 169615. [2018-12-03 07:47:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-12-03 07:47:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752619 transitions. [2018-12-03 07:47:54,000 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752619 transitions. Word has length 60 [2018-12-03 07:47:54,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:54,000 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752619 transitions. [2018-12-03 07:47:54,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:47:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752619 transitions. [2018-12-03 07:47:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 07:47:54,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:54,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:47:54,017 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:54,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1663856536, now seen corresponding path program 1 times [2018-12-03 07:47:54,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:54,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:54,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:54,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:47:54,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:54,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:47:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:47:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:47:54,050 INFO L87 Difference]: Start difference. First operand 169615 states and 752619 transitions. Second operand 5 states. [2018-12-03 07:47:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:54,270 INFO L93 Difference]: Finished difference Result 59119 states and 239395 transitions. [2018-12-03 07:47:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:47:54,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-03 07:47:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:54,376 INFO L225 Difference]: With dead ends: 59119 [2018-12-03 07:47:54,376 INFO L226 Difference]: Without dead ends: 56807 [2018-12-03 07:47:54,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:47:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56807 states. [2018-12-03 07:47:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56807 to 56807. [2018-12-03 07:47:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56807 states. [2018-12-03 07:47:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56807 states to 56807 states and 230741 transitions. [2018-12-03 07:47:55,174 INFO L78 Accepts]: Start accepts. Automaton has 56807 states and 230741 transitions. Word has length 61 [2018-12-03 07:47:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:55,175 INFO L480 AbstractCegarLoop]: Abstraction has 56807 states and 230741 transitions. [2018-12-03 07:47:55,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:47:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 56807 states and 230741 transitions. [2018-12-03 07:47:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:47:55,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:55,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:47:55,182 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:55,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:55,182 INFO L82 PathProgramCache]: Analyzing trace with hash -106888934, now seen corresponding path program 1 times [2018-12-03 07:47:55,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:55,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:55,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:55,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:55,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:55,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:47:55,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:55,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:47:55,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:47:55,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:47:55,230 INFO L87 Difference]: Start difference. First operand 56807 states and 230741 transitions. Second operand 4 states. [2018-12-03 07:47:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:55,914 INFO L93 Difference]: Finished difference Result 78971 states and 316066 transitions. [2018-12-03 07:47:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:47:55,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 07:47:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:56,048 INFO L225 Difference]: With dead ends: 78971 [2018-12-03 07:47:56,048 INFO L226 Difference]: Without dead ends: 78971 [2018-12-03 07:47:56,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:47:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78971 states. [2018-12-03 07:47:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78971 to 61563. [2018-12-03 07:47:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61563 states. [2018-12-03 07:47:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61563 states to 61563 states and 248434 transitions. [2018-12-03 07:47:56,971 INFO L78 Accepts]: Start accepts. Automaton has 61563 states and 248434 transitions. Word has length 67 [2018-12-03 07:47:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:56,971 INFO L480 AbstractCegarLoop]: Abstraction has 61563 states and 248434 transitions. [2018-12-03 07:47:56,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:47:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61563 states and 248434 transitions. [2018-12-03 07:47:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:47:56,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:56,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:47:56,982 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:56,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1635921401, now seen corresponding path program 1 times [2018-12-03 07:47:56,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:56,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:56,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:56,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:56,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:57,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:57,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:47:57,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:57,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:47:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:47:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:47:57,032 INFO L87 Difference]: Start difference. First operand 61563 states and 248434 transitions. Second operand 4 states. [2018-12-03 07:47:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:57,642 INFO L93 Difference]: Finished difference Result 85638 states and 341484 transitions. [2018-12-03 07:47:57,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:47:57,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 07:47:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:47:57,940 INFO L225 Difference]: With dead ends: 85638 [2018-12-03 07:47:57,940 INFO L226 Difference]: Without dead ends: 85638 [2018-12-03 07:47:57,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:47:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85638 states. [2018-12-03 07:47:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85638 to 77175. [2018-12-03 07:47:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77175 states. [2018-12-03 07:47:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77175 states to 77175 states and 309663 transitions. [2018-12-03 07:47:58,993 INFO L78 Accepts]: Start accepts. Automaton has 77175 states and 309663 transitions. Word has length 67 [2018-12-03 07:47:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:47:58,993 INFO L480 AbstractCegarLoop]: Abstraction has 77175 states and 309663 transitions. [2018-12-03 07:47:58,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:47:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 77175 states and 309663 transitions. [2018-12-03 07:47:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:47:59,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:47:59,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:47:59,006 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:47:59,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:47:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1847272314, now seen corresponding path program 1 times [2018-12-03 07:47:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:47:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:47:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:47:59,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:47:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:47:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:47:59,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:47:59,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:47:59,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:47:59,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:47:59,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:47:59,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:47:59,070 INFO L87 Difference]: Start difference. First operand 77175 states and 309663 transitions. Second operand 6 states. [2018-12-03 07:47:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:47:59,825 INFO L93 Difference]: Finished difference Result 119285 states and 470917 transitions. [2018-12-03 07:47:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:47:59,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 07:47:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:00,074 INFO L225 Difference]: With dead ends: 119285 [2018-12-03 07:48:00,074 INFO L226 Difference]: Without dead ends: 119285 [2018-12-03 07:48:00,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:48:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119285 states. [2018-12-03 07:48:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119285 to 77129. [2018-12-03 07:48:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77129 states. [2018-12-03 07:48:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77129 states to 77129 states and 303415 transitions. [2018-12-03 07:48:01,653 INFO L78 Accepts]: Start accepts. Automaton has 77129 states and 303415 transitions. Word has length 67 [2018-12-03 07:48:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:01,653 INFO L480 AbstractCegarLoop]: Abstraction has 77129 states and 303415 transitions. [2018-12-03 07:48:01,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 77129 states and 303415 transitions. [2018-12-03 07:48:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 07:48:01,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:01,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:01,662 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:01,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1336738137, now seen corresponding path program 1 times [2018-12-03 07:48:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:01,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:01,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:01,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:01,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:01,698 INFO L87 Difference]: Start difference. First operand 77129 states and 303415 transitions. Second operand 6 states. [2018-12-03 07:48:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:01,768 INFO L93 Difference]: Finished difference Result 13017 states and 43647 transitions. [2018-12-03 07:48:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:48:01,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 07:48:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:01,782 INFO L225 Difference]: With dead ends: 13017 [2018-12-03 07:48:01,782 INFO L226 Difference]: Without dead ends: 11037 [2018-12-03 07:48:01,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:48:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11037 states. [2018-12-03 07:48:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11037 to 10667. [2018-12-03 07:48:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10667 states. [2018-12-03 07:48:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 35774 transitions. [2018-12-03 07:48:01,886 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 35774 transitions. Word has length 67 [2018-12-03 07:48:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:01,886 INFO L480 AbstractCegarLoop]: Abstraction has 10667 states and 35774 transitions. [2018-12-03 07:48:01,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 35774 transitions. [2018-12-03 07:48:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:01,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:01,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:01,896 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1574321697, now seen corresponding path program 1 times [2018-12-03 07:48:01,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:01,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:01,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:01,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:48:01,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:01,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:48:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:48:01,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:48:01,934 INFO L87 Difference]: Start difference. First operand 10667 states and 35774 transitions. Second operand 4 states. [2018-12-03 07:48:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:02,035 INFO L93 Difference]: Finished difference Result 12962 states and 42885 transitions. [2018-12-03 07:48:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:48:02,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 07:48:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:02,050 INFO L225 Difference]: With dead ends: 12962 [2018-12-03 07:48:02,051 INFO L226 Difference]: Without dead ends: 12962 [2018-12-03 07:48:02,051 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-03 07:48:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12962 states. [2018-12-03 07:48:02,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12962 to 11002. [2018-12-03 07:48:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11002 states. [2018-12-03 07:48:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11002 states to 11002 states and 36802 transitions. [2018-12-03 07:48:02,169 INFO L78 Accepts]: Start accepts. Automaton has 11002 states and 36802 transitions. Word has length 102 [2018-12-03 07:48:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:02,169 INFO L480 AbstractCegarLoop]: Abstraction has 11002 states and 36802 transitions. [2018-12-03 07:48:02,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:48:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 11002 states and 36802 transitions. [2018-12-03 07:48:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:02,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:02,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:02,180 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:02,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 784985312, now seen corresponding path program 1 times [2018-12-03 07:48:02,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:02,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:02,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:02,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:02,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:48:02,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:02,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:48:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:48:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:48:02,204 INFO L87 Difference]: Start difference. First operand 11002 states and 36802 transitions. Second operand 3 states. [2018-12-03 07:48:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:02,305 INFO L93 Difference]: Finished difference Result 11537 states and 38330 transitions. [2018-12-03 07:48:02,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:48:02,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-03 07:48:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:02,318 INFO L225 Difference]: With dead ends: 11537 [2018-12-03 07:48:02,318 INFO L226 Difference]: Without dead ends: 11537 [2018-12-03 07:48:02,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:48:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2018-12-03 07:48:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 11292. [2018-12-03 07:48:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11292 states. [2018-12-03 07:48:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11292 states to 11292 states and 37634 transitions. [2018-12-03 07:48:02,425 INFO L78 Accepts]: Start accepts. Automaton has 11292 states and 37634 transitions. Word has length 102 [2018-12-03 07:48:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:02,425 INFO L480 AbstractCegarLoop]: Abstraction has 11292 states and 37634 transitions. [2018-12-03 07:48:02,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:48:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 11292 states and 37634 transitions. [2018-12-03 07:48:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:02,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:02,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:02,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:02,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash -662794271, now seen corresponding path program 1 times [2018-12-03 07:48:02,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:02,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:02,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:02,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:02,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:48:02,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:48:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:48:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:48:02,507 INFO L87 Difference]: Start difference. First operand 11292 states and 37634 transitions. Second operand 8 states. [2018-12-03 07:48:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:03,027 INFO L93 Difference]: Finished difference Result 28455 states and 93181 transitions. [2018-12-03 07:48:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:48:03,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-03 07:48:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:03,059 INFO L225 Difference]: With dead ends: 28455 [2018-12-03 07:48:03,059 INFO L226 Difference]: Without dead ends: 28327 [2018-12-03 07:48:03,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:48:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28327 states. [2018-12-03 07:48:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28327 to 16507. [2018-12-03 07:48:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16507 states. [2018-12-03 07:48:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16507 states to 16507 states and 54743 transitions. [2018-12-03 07:48:03,281 INFO L78 Accepts]: Start accepts. Automaton has 16507 states and 54743 transitions. Word has length 102 [2018-12-03 07:48:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:03,281 INFO L480 AbstractCegarLoop]: Abstraction has 16507 states and 54743 transitions. [2018-12-03 07:48:03,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:48:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 16507 states and 54743 transitions. [2018-12-03 07:48:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:03,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:03,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:03,296 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:03,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:03,296 INFO L82 PathProgramCache]: Analyzing trace with hash 298819746, now seen corresponding path program 1 times [2018-12-03 07:48:03,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:03,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:03,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:03,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:03,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:48:03,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:03,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:48:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:48:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:48:03,344 INFO L87 Difference]: Start difference. First operand 16507 states and 54743 transitions. Second operand 5 states. [2018-12-03 07:48:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:03,506 INFO L93 Difference]: Finished difference Result 20095 states and 65790 transitions. [2018-12-03 07:48:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:48:03,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 07:48:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:03,528 INFO L225 Difference]: With dead ends: 20095 [2018-12-03 07:48:03,528 INFO L226 Difference]: Without dead ends: 20095 [2018-12-03 07:48:03,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-03 07:48:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20095 states. [2018-12-03 07:48:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20095 to 17062. [2018-12-03 07:48:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17062 states. [2018-12-03 07:48:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17062 states to 17062 states and 56342 transitions. [2018-12-03 07:48:03,742 INFO L78 Accepts]: Start accepts. Automaton has 17062 states and 56342 transitions. Word has length 102 [2018-12-03 07:48:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:03,742 INFO L480 AbstractCegarLoop]: Abstraction has 17062 states and 56342 transitions. [2018-12-03 07:48:03,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:48:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17062 states and 56342 transitions. [2018-12-03 07:48:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:03,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:03,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:03,757 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:03,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash 424238164, now seen corresponding path program 1 times [2018-12-03 07:48:03,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:03,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:03,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:03,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:03,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:03,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:03,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:03,810 INFO L87 Difference]: Start difference. First operand 17062 states and 56342 transitions. Second operand 6 states. [2018-12-03 07:48:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:04,018 INFO L93 Difference]: Finished difference Result 19617 states and 63676 transitions. [2018-12-03 07:48:04,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:48:04,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 07:48:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:04,038 INFO L225 Difference]: With dead ends: 19617 [2018-12-03 07:48:04,038 INFO L226 Difference]: Without dead ends: 19132 [2018-12-03 07:48:04,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19132 states. [2018-12-03 07:48:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19132 to 18372. [2018-12-03 07:48:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18372 states. [2018-12-03 07:48:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18372 states to 18372 states and 60260 transitions. [2018-12-03 07:48:04,221 INFO L78 Accepts]: Start accepts. Automaton has 18372 states and 60260 transitions. Word has length 102 [2018-12-03 07:48:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:04,222 INFO L480 AbstractCegarLoop]: Abstraction has 18372 states and 60260 transitions. [2018-12-03 07:48:04,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 18372 states and 60260 transitions. [2018-12-03 07:48:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:04,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:04,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:04,237 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:04,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2124978643, now seen corresponding path program 1 times [2018-12-03 07:48:04,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:04,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:04,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:04,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:04,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:48:04,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:04,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:48:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:48:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:04,291 INFO L87 Difference]: Start difference. First operand 18372 states and 60260 transitions. Second operand 7 states. [2018-12-03 07:48:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:04,568 INFO L93 Difference]: Finished difference Result 19715 states and 64540 transitions. [2018-12-03 07:48:04,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:48:04,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 07:48:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:04,594 INFO L225 Difference]: With dead ends: 19715 [2018-12-03 07:48:04,594 INFO L226 Difference]: Without dead ends: 19715 [2018-12-03 07:48:04,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19715 states. [2018-12-03 07:48:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19715 to 18217. [2018-12-03 07:48:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18217 states. [2018-12-03 07:48:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18217 states to 18217 states and 59836 transitions. [2018-12-03 07:48:04,783 INFO L78 Accepts]: Start accepts. Automaton has 18217 states and 59836 transitions. Word has length 102 [2018-12-03 07:48:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:04,783 INFO L480 AbstractCegarLoop]: Abstraction has 18217 states and 59836 transitions. [2018-12-03 07:48:04,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:48:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18217 states and 59836 transitions. [2018-12-03 07:48:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:04,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:04,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:04,799 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:04,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash -759109133, now seen corresponding path program 1 times [2018-12-03 07:48:04,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:04,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:04,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:04,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-03 07:48:04,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:04,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:48:04,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:04,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:48:04,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:48:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:48:04,861 INFO L87 Difference]: Start difference. First operand 18217 states and 59836 transitions. Second operand 5 states. [2018-12-03 07:48:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:04,957 INFO L93 Difference]: Finished difference Result 13647 states and 45004 transitions. [2018-12-03 07:48:04,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:48:04,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 07:48:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:04,972 INFO L225 Difference]: With dead ends: 13647 [2018-12-03 07:48:04,972 INFO L226 Difference]: Without dead ends: 13647 [2018-12-03 07:48:04,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13647 states. [2018-12-03 07:48:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13647 to 12867. [2018-12-03 07:48:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12867 states. [2018-12-03 07:48:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12867 states to 12867 states and 42680 transitions. [2018-12-03 07:48:05,099 INFO L78 Accepts]: Start accepts. Automaton has 12867 states and 42680 transitions. Word has length 102 [2018-12-03 07:48:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:05,099 INFO L480 AbstractCegarLoop]: Abstraction has 12867 states and 42680 transitions. [2018-12-03 07:48:05,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:48:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12867 states and 42680 transitions. [2018-12-03 07:48:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 07:48:05,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:05,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:05,110 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:05,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash 175247252, now seen corresponding path program 1 times [2018-12-03 07:48:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:05,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:05,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:05,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:05,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:05,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:05,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:05,194 INFO L87 Difference]: Start difference. First operand 12867 states and 42680 transitions. Second operand 6 states. [2018-12-03 07:48:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:05,272 INFO L93 Difference]: Finished difference Result 11587 states and 37752 transitions. [2018-12-03 07:48:05,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:48:05,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 07:48:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:05,284 INFO L225 Difference]: With dead ends: 11587 [2018-12-03 07:48:05,284 INFO L226 Difference]: Without dead ends: 11587 [2018-12-03 07:48:05,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11587 states. [2018-12-03 07:48:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11587 to 9620. [2018-12-03 07:48:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9620 states. [2018-12-03 07:48:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 31733 transitions. [2018-12-03 07:48:05,380 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 31733 transitions. Word has length 102 [2018-12-03 07:48:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:05,380 INFO L480 AbstractCegarLoop]: Abstraction has 9620 states and 31733 transitions. [2018-12-03 07:48:05,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 31733 transitions. [2018-12-03 07:48:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:05,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:05,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:05,389 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:05,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1941612432, now seen corresponding path program 1 times [2018-12-03 07:48:05,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:05,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:05,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:05,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:05,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:05,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:05,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:48:05,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:05,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:48:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:48:05,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:05,444 INFO L87 Difference]: Start difference. First operand 9620 states and 31733 transitions. Second operand 7 states. [2018-12-03 07:48:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:05,783 INFO L93 Difference]: Finished difference Result 16035 states and 51174 transitions. [2018-12-03 07:48:05,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:48:05,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-03 07:48:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:05,799 INFO L225 Difference]: With dead ends: 16035 [2018-12-03 07:48:05,800 INFO L226 Difference]: Without dead ends: 16035 [2018-12-03 07:48:05,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 07:48:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16035 states. [2018-12-03 07:48:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16035 to 11320. [2018-12-03 07:48:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11320 states. [2018-12-03 07:48:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 36978 transitions. [2018-12-03 07:48:05,941 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 36978 transitions. Word has length 104 [2018-12-03 07:48:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:05,941 INFO L480 AbstractCegarLoop]: Abstraction has 11320 states and 36978 transitions. [2018-12-03 07:48:05,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:48:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 36978 transitions. [2018-12-03 07:48:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:05,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:05,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:05,951 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:05,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1108590383, now seen corresponding path program 1 times [2018-12-03 07:48:05,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:05,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:05,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:05,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:06,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:06,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:06,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:06,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:06,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:06,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:06,016 INFO L87 Difference]: Start difference. First operand 11320 states and 36978 transitions. Second operand 6 states. [2018-12-03 07:48:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:06,105 INFO L93 Difference]: Finished difference Result 11785 states and 37980 transitions. [2018-12-03 07:48:06,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:48:06,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 07:48:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:06,117 INFO L225 Difference]: With dead ends: 11785 [2018-12-03 07:48:06,117 INFO L226 Difference]: Without dead ends: 11785 [2018-12-03 07:48:06,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:48:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2018-12-03 07:48:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 11140. [2018-12-03 07:48:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11140 states. [2018-12-03 07:48:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 36184 transitions. [2018-12-03 07:48:06,223 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 36184 transitions. Word has length 104 [2018-12-03 07:48:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:06,223 INFO L480 AbstractCegarLoop]: Abstraction has 11140 states and 36184 transitions. [2018-12-03 07:48:06,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 36184 transitions. [2018-12-03 07:48:06,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:06,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:06,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:06,233 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:06,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2023589103, now seen corresponding path program 1 times [2018-12-03 07:48:06,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:06,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:06,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:06,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:06,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:48:06,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:06,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:48:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:48:06,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:48:06,284 INFO L87 Difference]: Start difference. First operand 11140 states and 36184 transitions. Second operand 5 states. [2018-12-03 07:48:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:06,405 INFO L93 Difference]: Finished difference Result 12420 states and 40344 transitions. [2018-12-03 07:48:06,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:48:06,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 07:48:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:06,419 INFO L225 Difference]: With dead ends: 12420 [2018-12-03 07:48:06,419 INFO L226 Difference]: Without dead ends: 12420 [2018-12-03 07:48:06,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2018-12-03 07:48:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 9982. [2018-12-03 07:48:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9982 states. [2018-12-03 07:48:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9982 states to 9982 states and 32523 transitions. [2018-12-03 07:48:06,528 INFO L78 Accepts]: Start accepts. Automaton has 9982 states and 32523 transitions. Word has length 104 [2018-12-03 07:48:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:06,528 INFO L480 AbstractCegarLoop]: Abstraction has 9982 states and 32523 transitions. [2018-12-03 07:48:06,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:48:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9982 states and 32523 transitions. [2018-12-03 07:48:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:06,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:06,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:06,536 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:06,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-03 07:48:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:06,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:06,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:06,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:06,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 07:48:06,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:06,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:48:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:48:06,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:48:06,640 INFO L87 Difference]: Start difference. First operand 9982 states and 32523 transitions. Second operand 10 states. [2018-12-03 07:48:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:06,986 INFO L93 Difference]: Finished difference Result 19070 states and 62383 transitions. [2018-12-03 07:48:06,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:48:06,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-03 07:48:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:06,997 INFO L225 Difference]: With dead ends: 19070 [2018-12-03 07:48:06,997 INFO L226 Difference]: Without dead ends: 9290 [2018-12-03 07:48:06,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:48:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9290 states. [2018-12-03 07:48:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9290 to 9290. [2018-12-03 07:48:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9290 states. [2018-12-03 07:48:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9290 states to 9290 states and 30483 transitions. [2018-12-03 07:48:07,080 INFO L78 Accepts]: Start accepts. Automaton has 9290 states and 30483 transitions. Word has length 104 [2018-12-03 07:48:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:07,080 INFO L480 AbstractCegarLoop]: Abstraction has 9290 states and 30483 transitions. [2018-12-03 07:48:07,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:48:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9290 states and 30483 transitions. [2018-12-03 07:48:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:07,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:07,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:07,088 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:07,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-03 07:48:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:07,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:07,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:07,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:48:07,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:07,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:48:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:48:07,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:48:07,165 INFO L87 Difference]: Start difference. First operand 9290 states and 30483 transitions. Second operand 7 states. [2018-12-03 07:48:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:07,369 INFO L93 Difference]: Finished difference Result 16866 states and 56002 transitions. [2018-12-03 07:48:07,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:48:07,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-03 07:48:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:07,379 INFO L225 Difference]: With dead ends: 16866 [2018-12-03 07:48:07,379 INFO L226 Difference]: Without dead ends: 7619 [2018-12-03 07:48:07,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:48:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7619 states. [2018-12-03 07:48:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7619 to 7619. [2018-12-03 07:48:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7619 states. [2018-12-03 07:48:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 25605 transitions. [2018-12-03 07:48:07,454 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 25605 transitions. Word has length 104 [2018-12-03 07:48:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:07,454 INFO L480 AbstractCegarLoop]: Abstraction has 7619 states and 25605 transitions. [2018-12-03 07:48:07,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:48:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 25605 transitions. [2018-12-03 07:48:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:07,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:07,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:07,461 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:07,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2018-12-03 07:48:07,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:07,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:07,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:48:07,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:07,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:07,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:07,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:07,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:07,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:07,518 INFO L87 Difference]: Start difference. First operand 7619 states and 25605 transitions. Second operand 6 states. [2018-12-03 07:48:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:07,792 INFO L93 Difference]: Finished difference Result 8643 states and 28469 transitions. [2018-12-03 07:48:07,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:48:07,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 07:48:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:07,802 INFO L225 Difference]: With dead ends: 8643 [2018-12-03 07:48:07,802 INFO L226 Difference]: Without dead ends: 8643 [2018-12-03 07:48:07,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:48:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8643 states. [2018-12-03 07:48:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8643 to 7799. [2018-12-03 07:48:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7799 states. [2018-12-03 07:48:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7799 states to 7799 states and 26088 transitions. [2018-12-03 07:48:07,881 INFO L78 Accepts]: Start accepts. Automaton has 7799 states and 26088 transitions. Word has length 104 [2018-12-03 07:48:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:07,882 INFO L480 AbstractCegarLoop]: Abstraction has 7799 states and 26088 transitions. [2018-12-03 07:48:07,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7799 states and 26088 transitions. [2018-12-03 07:48:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:07,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:07,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:07,888 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:07,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-03 07:48:07,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:07,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:07,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:07,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:07,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:07,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:07,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:07,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:07,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:07,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:07,938 INFO L87 Difference]: Start difference. First operand 7799 states and 26088 transitions. Second operand 6 states. [2018-12-03 07:48:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:08,093 INFO L93 Difference]: Finished difference Result 7859 states and 26196 transitions. [2018-12-03 07:48:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:48:08,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 07:48:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:08,102 INFO L225 Difference]: With dead ends: 7859 [2018-12-03 07:48:08,102 INFO L226 Difference]: Without dead ends: 7779 [2018-12-03 07:48:08,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:48:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7779 states. [2018-12-03 07:48:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7779 to 7571. [2018-12-03 07:48:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2018-12-03 07:48:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 25420 transitions. [2018-12-03 07:48:08,172 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 25420 transitions. Word has length 104 [2018-12-03 07:48:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:08,172 INFO L480 AbstractCegarLoop]: Abstraction has 7571 states and 25420 transitions. [2018-12-03 07:48:08,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 25420 transitions. [2018-12-03 07:48:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:08,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:08,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:08,179 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:08,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 1 times [2018-12-03 07:48:08,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:08,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:08,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:08,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:08,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:48:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:48:08,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:48:08,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:48:08,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:48:08,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:48:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:48:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:48:08,250 INFO L87 Difference]: Start difference. First operand 7571 states and 25420 transitions. Second operand 6 states. [2018-12-03 07:48:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:48:08,394 INFO L93 Difference]: Finished difference Result 7908 states and 26266 transitions. [2018-12-03 07:48:08,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:48:08,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 07:48:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:48:08,407 INFO L225 Difference]: With dead ends: 7908 [2018-12-03 07:48:08,407 INFO L226 Difference]: Without dead ends: 7908 [2018-12-03 07:48:08,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:48:08,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7908 states. [2018-12-03 07:48:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7908 to 7731. [2018-12-03 07:48:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7731 states. [2018-12-03 07:48:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7731 states to 7731 states and 25816 transitions. [2018-12-03 07:48:08,494 INFO L78 Accepts]: Start accepts. Automaton has 7731 states and 25816 transitions. Word has length 104 [2018-12-03 07:48:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:48:08,494 INFO L480 AbstractCegarLoop]: Abstraction has 7731 states and 25816 transitions. [2018-12-03 07:48:08,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:48:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7731 states and 25816 transitions. [2018-12-03 07:48:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 07:48:08,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:48:08,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:48:08,501 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:48:08,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:48:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-03 07:48:08,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:48:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:08,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:48:08,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:48:08,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:48:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:48:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:48:08,540 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:48:08,614 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 07:48:08,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:48:08 BasicIcfg [2018-12-03 07:48:08,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:48:08,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:48:08,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:48:08,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:48:08,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:46:54" (3/4) ... [2018-12-03 07:48:08,617 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 07:48:08,687 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05f250e5-1db8-4823-8711-f0c2b1fe39c7/bin-2019/utaipan/witness.graphml [2018-12-03 07:48:08,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:48:08,688 INFO L168 Benchmark]: Toolchain (without parser) took 75330.76 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 948.1 MB in the beginning and 5.3 GB in the end (delta: -4.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,689 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:48:08,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,689 INFO L168 Benchmark]: Boogie Preprocessor took 21.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,689 INFO L168 Benchmark]: RCFGBuilder took 368.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,689 INFO L168 Benchmark]: TraceAbstraction took 74513.58 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,690 INFO L168 Benchmark]: Witness Printer took 72.26 ms. Allocated memory is still 8.1 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:48:08,691 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74513.58 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 6.9 GB). Free memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: -4.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 72.26 ms. Allocated memory is still 8.1 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L786] -1 pthread_t t1210; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L787] FCALL, FORK -1 pthread_create(&t1210, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L788] -1 pthread_t t1211; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L789] FCALL, FORK -1 pthread_create(&t1211, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L790] -1 pthread_t t1212; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L791] FCALL, FORK -1 pthread_create(&t1212, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L731] 2 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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, z=1] [L733] 2 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 74.4s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 19.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6467 SDtfs, 6570 SDslu, 13412 SDs, 0 SdLazy, 5067 SolverSat, 320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194884occurred in iteration=4, 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: 38.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 460287 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2403 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2272 ConstructedInterpolants, 0 QuantifiedInterpolants, 514813 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...