./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/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 2ad3f78977fb69cd2f99ad06c218209d75543485 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:36:18,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:36:18,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:36:18,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:36:18,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:36:18,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:36:18,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:36:18,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:36:18,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:36:18,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:36:18,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:36:18,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:36:18,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:36:18,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:36:18,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:36:18,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:36:18,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:36:18,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:36:18,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:36:18,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:36:18,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:36:18,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:36:18,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:36:18,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:36:18,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:36:18,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:36:18,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:36:18,690 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:36:18,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:36:18,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:36:18,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:36:18,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:36:18,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:36:18,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:36:18,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:36:18,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:36:18,693 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 12:36:18,700 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:36:18,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:36:18,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:36:18,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:36:18,701 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:36:18,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:36:18,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:36:18,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:36:18,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:36:18,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:36:18,704 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:36:18,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:36:18,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:36:18,704 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:36:18,704 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_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/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 -> 2ad3f78977fb69cd2f99ad06c218209d75543485 [2018-12-02 12:36:18,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:36:18,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:36:18,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:36:18,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:36:18,730 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:36:18,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i [2018-12-02 12:36:18,765 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/data/4bb728ff5/be6aa7f4d5444a0b98c6c33b7e201dce/FLAG30deedcda [2018-12-02 12:36:19,225 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:36:19,226 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/sv-benchmarks/c/pthread-wmm/safe033_pso.oepc_false-unreach-call.i [2018-12-02 12:36:19,234 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/data/4bb728ff5/be6aa7f4d5444a0b98c6c33b7e201dce/FLAG30deedcda [2018-12-02 12:36:19,242 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/data/4bb728ff5/be6aa7f4d5444a0b98c6c33b7e201dce [2018-12-02 12:36:19,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:36:19,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:36:19,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:36:19,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:36:19,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:36:19,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19, skipping insertion in model container [2018-12-02 12:36:19,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:36:19,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:36:19,447 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:36:19,455 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:36:19,525 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:36:19,554 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:36:19,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19 WrapperNode [2018-12-02 12:36:19,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:36:19,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:36:19,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:36:19,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:36:19,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:36:19,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:36:19,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:36:19,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:36:19,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... [2018-12-02 12:36:19,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:36:19,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:36:19,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:36:19,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:36:19,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:36:19,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:36:19,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:36:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:36:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:36:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:36:19,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:36:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:36:19,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:36:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:36:19,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:36:19,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:36:19,642 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:36:19,953 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:36:19,953 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:36:19,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:36:19 BoogieIcfgContainer [2018-12-02 12:36:19,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:36:19,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:36:19,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:36:19,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:36:19,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:36:19" (1/3) ... [2018-12-02 12:36:19,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700c819c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:36:19, skipping insertion in model container [2018-12-02 12:36:19,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:36:19" (2/3) ... [2018-12-02 12:36:19,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700c819c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:36:19, skipping insertion in model container [2018-12-02 12:36:19,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:36:19" (3/3) ... [2018-12-02 12:36:19,958 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc_false-unreach-call.i [2018-12-02 12:36:19,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,981 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,982 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,983 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,984 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,985 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,986 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,987 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,988 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,989 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:36:19,996 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:36:19,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:36:20,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:36:20,011 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:36:20,027 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:36:20,027 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:36:20,027 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:36:20,027 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:36:20,027 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:36:20,027 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:36:20,027 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:36:20,027 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:36:20,034 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129places, 161 transitions [2018-12-02 12:36:21,354 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2018-12-02 12:36:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2018-12-02 12:36:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 12:36:21,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:21,362 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] [2018-12-02 12:36:21,363 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:21,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -743892383, now seen corresponding path program 1 times [2018-12-02 12:36:21,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:21,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:21,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:21,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:21,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:21,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:21,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:21,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:21,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:21,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:21,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:21,523 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2018-12-02 12:36:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:21,870 INFO L93 Difference]: Finished difference Result 47765 states and 183116 transitions. [2018-12-02 12:36:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:36:21,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-02 12:36:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:22,013 INFO L225 Difference]: With dead ends: 47765 [2018-12-02 12:36:22,013 INFO L226 Difference]: Without dead ends: 34605 [2018-12-02 12:36:22,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34605 states. [2018-12-02 12:36:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34605 to 21753. [2018-12-02 12:36:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2018-12-02 12:36:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2018-12-02 12:36:22,686 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2018-12-02 12:36:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:22,686 INFO L480 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2018-12-02 12:36:22,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2018-12-02 12:36:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 12:36:22,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:22,691 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] [2018-12-02 12:36:22,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:22,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash 243022970, now seen corresponding path program 1 times [2018-12-02 12:36:22,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:22,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:22,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:22,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:22,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:22,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:22,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:22,742 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 4 states. [2018-12-02 12:36:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:22,794 INFO L93 Difference]: Finished difference Result 7167 states and 23623 transitions. [2018-12-02 12:36:22,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:36:22,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-02 12:36:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:22,808 INFO L225 Difference]: With dead ends: 7167 [2018-12-02 12:36:22,808 INFO L226 Difference]: Without dead ends: 6321 [2018-12-02 12:36:22,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6321 states. [2018-12-02 12:36:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6321 to 6321. [2018-12-02 12:36:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6321 states. [2018-12-02 12:36:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 20695 transitions. [2018-12-02 12:36:22,881 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 20695 transitions. Word has length 44 [2018-12-02 12:36:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:22,881 INFO L480 AbstractCegarLoop]: Abstraction has 6321 states and 20695 transitions. [2018-12-02 12:36:22,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 20695 transitions. [2018-12-02 12:36:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 12:36:22,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:22,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:22,882 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:22,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:22,882 INFO L82 PathProgramCache]: Analyzing trace with hash -69776966, now seen corresponding path program 1 times [2018-12-02 12:36:22,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:22,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:22,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:22,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:22,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:22,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:22,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:22,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:22,935 INFO L87 Difference]: Start difference. First operand 6321 states and 20695 transitions. Second operand 5 states. [2018-12-02 12:36:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:23,196 INFO L93 Difference]: Finished difference Result 12017 states and 38781 transitions. [2018-12-02 12:36:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:36:23,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 12:36:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:23,214 INFO L225 Difference]: With dead ends: 12017 [2018-12-02 12:36:23,214 INFO L226 Difference]: Without dead ends: 11942 [2018-12-02 12:36:23,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11942 states. [2018-12-02 12:36:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11942 to 8286. [2018-12-02 12:36:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8286 states. [2018-12-02 12:36:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 26548 transitions. [2018-12-02 12:36:23,344 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 26548 transitions. Word has length 45 [2018-12-02 12:36:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:23,345 INFO L480 AbstractCegarLoop]: Abstraction has 8286 states and 26548 transitions. [2018-12-02 12:36:23,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:23,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 26548 transitions. [2018-12-02 12:36:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 12:36:23,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:23,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:23,347 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:23,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1748582240, now seen corresponding path program 1 times [2018-12-02 12:36:23,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:23,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:23,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:23,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:23,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:36:23,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:23,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:36:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:36:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:23,372 INFO L87 Difference]: Start difference. First operand 8286 states and 26548 transitions. Second operand 3 states. [2018-12-02 12:36:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:23,426 INFO L93 Difference]: Finished difference Result 10982 states and 34703 transitions. [2018-12-02 12:36:23,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:36:23,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-02 12:36:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:23,440 INFO L225 Difference]: With dead ends: 10982 [2018-12-02 12:36:23,440 INFO L226 Difference]: Without dead ends: 10978 [2018-12-02 12:36:23,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10978 states. [2018-12-02 12:36:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10978 to 8504. [2018-12-02 12:36:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8504 states. [2018-12-02 12:36:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 26984 transitions. [2018-12-02 12:36:23,540 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 26984 transitions. Word has length 47 [2018-12-02 12:36:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:23,541 INFO L480 AbstractCegarLoop]: Abstraction has 8504 states and 26984 transitions. [2018-12-02 12:36:23,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:36:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 26984 transitions. [2018-12-02 12:36:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 12:36:23,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:23,542 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] [2018-12-02 12:36:23,543 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:23,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:23,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1993857643, now seen corresponding path program 1 times [2018-12-02 12:36:23,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:23,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:23,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:23,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:23,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:23,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:23,586 INFO L87 Difference]: Start difference. First operand 8504 states and 26984 transitions. Second operand 6 states. [2018-12-02 12:36:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:23,831 INFO L93 Difference]: Finished difference Result 11920 states and 37195 transitions. [2018-12-02 12:36:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:36:23,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-02 12:36:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:23,844 INFO L225 Difference]: With dead ends: 11920 [2018-12-02 12:36:23,844 INFO L226 Difference]: Without dead ends: 11823 [2018-12-02 12:36:23,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:36:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2018-12-02 12:36:23,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 9278. [2018-12-02 12:36:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2018-12-02 12:36:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 29428 transitions. [2018-12-02 12:36:23,956 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 29428 transitions. Word has length 51 [2018-12-02 12:36:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:23,956 INFO L480 AbstractCegarLoop]: Abstraction has 9278 states and 29428 transitions. [2018-12-02 12:36:23,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 29428 transitions. [2018-12-02 12:36:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 12:36:23,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:23,963 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-02 12:36:23,963 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:23,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1315887873, now seen corresponding path program 1 times [2018-12-02 12:36:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:23,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:24,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:24,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:24,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:24,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:24,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:24,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:24,021 INFO L87 Difference]: Start difference. First operand 9278 states and 29428 transitions. Second operand 5 states. [2018-12-02 12:36:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:24,096 INFO L93 Difference]: Finished difference Result 2586 states and 6693 transitions. [2018-12-02 12:36:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:36:24,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-02 12:36:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:24,099 INFO L225 Difference]: With dead ends: 2586 [2018-12-02 12:36:24,099 INFO L226 Difference]: Without dead ends: 2138 [2018-12-02 12:36:24,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-12-02 12:36:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2125. [2018-12-02 12:36:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2018-12-02 12:36:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 5339 transitions. [2018-12-02 12:36:24,115 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 5339 transitions. Word has length 61 [2018-12-02 12:36:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:24,115 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 5339 transitions. [2018-12-02 12:36:24,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 5339 transitions. [2018-12-02 12:36:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:24,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:24,118 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] [2018-12-02 12:36:24,118 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:24,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1710407868, now seen corresponding path program 1 times [2018-12-02 12:36:24,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:24,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:24,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:24,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:24,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:24,168 INFO L87 Difference]: Start difference. First operand 2125 states and 5339 transitions. Second operand 4 states. [2018-12-02 12:36:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:24,265 INFO L93 Difference]: Finished difference Result 2907 states and 7134 transitions. [2018-12-02 12:36:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:36:24,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 12:36:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:24,268 INFO L225 Difference]: With dead ends: 2907 [2018-12-02 12:36:24,268 INFO L226 Difference]: Without dead ends: 2907 [2018-12-02 12:36:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-12-02 12:36:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2488. [2018-12-02 12:36:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2488 states. [2018-12-02 12:36:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 6155 transitions. [2018-12-02 12:36:24,287 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 6155 transitions. Word has length 80 [2018-12-02 12:36:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:24,287 INFO L480 AbstractCegarLoop]: Abstraction has 2488 states and 6155 transitions. [2018-12-02 12:36:24,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 6155 transitions. [2018-12-02 12:36:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:24,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:24,291 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] [2018-12-02 12:36:24,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:24,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -366801475, now seen corresponding path program 1 times [2018-12-02 12:36:24,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:24,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:24,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:24,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:24,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:24,353 INFO L87 Difference]: Start difference. First operand 2488 states and 6155 transitions. Second operand 6 states. [2018-12-02 12:36:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:24,548 INFO L93 Difference]: Finished difference Result 2571 states and 6195 transitions. [2018-12-02 12:36:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:36:24,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-12-02 12:36:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:24,550 INFO L225 Difference]: With dead ends: 2571 [2018-12-02 12:36:24,550 INFO L226 Difference]: Without dead ends: 2571 [2018-12-02 12:36:24,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-12-02 12:36:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2339. [2018-12-02 12:36:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2018-12-02 12:36:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 5602 transitions. [2018-12-02 12:36:24,566 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 5602 transitions. Word has length 80 [2018-12-02 12:36:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:24,567 INFO L480 AbstractCegarLoop]: Abstraction has 2339 states and 5602 transitions. [2018-12-02 12:36:24,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 5602 transitions. [2018-12-02 12:36:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:24,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:24,568 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] [2018-12-02 12:36:24,569 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:24,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1817662385, now seen corresponding path program 1 times [2018-12-02 12:36:24,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:24,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:24,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:24,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:24,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:24,626 INFO L87 Difference]: Start difference. First operand 2339 states and 5602 transitions. Second operand 6 states. [2018-12-02 12:36:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:24,964 INFO L93 Difference]: Finished difference Result 3002 states and 7052 transitions. [2018-12-02 12:36:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:36:24,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-12-02 12:36:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:24,966 INFO L225 Difference]: With dead ends: 3002 [2018-12-02 12:36:24,966 INFO L226 Difference]: Without dead ends: 2927 [2018-12-02 12:36:24,966 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-02 12:36:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2018-12-02 12:36:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2682. [2018-12-02 12:36:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-12-02 12:36:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 6364 transitions. [2018-12-02 12:36:24,986 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 6364 transitions. Word has length 80 [2018-12-02 12:36:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:24,986 INFO L480 AbstractCegarLoop]: Abstraction has 2682 states and 6364 transitions. [2018-12-02 12:36:24,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 6364 transitions. [2018-12-02 12:36:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:24,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:24,988 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] [2018-12-02 12:36:24,988 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:24,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:24,989 INFO L82 PathProgramCache]: Analyzing trace with hash -130354882, now seen corresponding path program 2 times [2018-12-02 12:36:24,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:24,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:24,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:25,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:25,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:36:25,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:25,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:36:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:36:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:25,060 INFO L87 Difference]: Start difference. First operand 2682 states and 6364 transitions. Second operand 7 states. [2018-12-02 12:36:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:25,369 INFO L93 Difference]: Finished difference Result 3229 states and 7678 transitions. [2018-12-02 12:36:25,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:36:25,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-12-02 12:36:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:25,372 INFO L225 Difference]: With dead ends: 3229 [2018-12-02 12:36:25,372 INFO L226 Difference]: Without dead ends: 3229 [2018-12-02 12:36:25,372 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-02 12:36:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2018-12-02 12:36:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2712. [2018-12-02 12:36:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2712 states. [2018-12-02 12:36:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 6470 transitions. [2018-12-02 12:36:25,393 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 6470 transitions. Word has length 80 [2018-12-02 12:36:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:25,394 INFO L480 AbstractCegarLoop]: Abstraction has 2712 states and 6470 transitions. [2018-12-02 12:36:25,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:36:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 6470 transitions. [2018-12-02 12:36:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:25,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:25,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:25,396 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:25,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash 467201070, now seen corresponding path program 1 times [2018-12-02 12:36:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:25,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:36:25,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:25,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:25,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:25,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:25,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:25,468 INFO L87 Difference]: Start difference. First operand 2712 states and 6470 transitions. Second operand 6 states. [2018-12-02 12:36:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:25,612 INFO L93 Difference]: Finished difference Result 3109 states and 7177 transitions. [2018-12-02 12:36:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:36:25,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-12-02 12:36:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:25,614 INFO L225 Difference]: With dead ends: 3109 [2018-12-02 12:36:25,614 INFO L226 Difference]: Without dead ends: 3109 [2018-12-02 12:36:25,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:36:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2018-12-02 12:36:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2796. [2018-12-02 12:36:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-12-02 12:36:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 6505 transitions. [2018-12-02 12:36:25,634 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 6505 transitions. Word has length 80 [2018-12-02 12:36:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:25,635 INFO L480 AbstractCegarLoop]: Abstraction has 2796 states and 6505 transitions. [2018-12-02 12:36:25,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 6505 transitions. [2018-12-02 12:36:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:25,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:25,637 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] [2018-12-02 12:36:25,637 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:25,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 212464525, now seen corresponding path program 1 times [2018-12-02 12:36:25,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:25,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:25,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:25,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:25,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:25,670 INFO L87 Difference]: Start difference. First operand 2796 states and 6505 transitions. Second operand 4 states. [2018-12-02 12:36:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:25,730 INFO L93 Difference]: Finished difference Result 3004 states and 7041 transitions. [2018-12-02 12:36:25,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:36:25,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 12:36:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:25,732 INFO L225 Difference]: With dead ends: 3004 [2018-12-02 12:36:25,732 INFO L226 Difference]: Without dead ends: 3004 [2018-12-02 12:36:25,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2018-12-02 12:36:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2860. [2018-12-02 12:36:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2018-12-02 12:36:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 6681 transitions. [2018-12-02 12:36:25,753 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 6681 transitions. Word has length 80 [2018-12-02 12:36:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:25,753 INFO L480 AbstractCegarLoop]: Abstraction has 2860 states and 6681 transitions. [2018-12-02 12:36:25,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 6681 transitions. [2018-12-02 12:36:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 12:36:25,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:25,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] [2018-12-02 12:36:25,757 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:25,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1594989938, now seen corresponding path program 1 times [2018-12-02 12:36:25,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:25,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:25,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:25,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:25,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:25,825 INFO L87 Difference]: Start difference. First operand 2860 states and 6681 transitions. Second operand 6 states. [2018-12-02 12:36:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:25,901 INFO L93 Difference]: Finished difference Result 2812 states and 6449 transitions. [2018-12-02 12:36:25,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:36:25,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-12-02 12:36:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:25,905 INFO L225 Difference]: With dead ends: 2812 [2018-12-02 12:36:25,905 INFO L226 Difference]: Without dead ends: 2812 [2018-12-02 12:36:25,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2018-12-02 12:36:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2541. [2018-12-02 12:36:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2018-12-02 12:36:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 5837 transitions. [2018-12-02 12:36:25,929 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 5837 transitions. Word has length 80 [2018-12-02 12:36:25,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:25,930 INFO L480 AbstractCegarLoop]: Abstraction has 2541 states and 5837 transitions. [2018-12-02 12:36:25,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 5837 transitions. [2018-12-02 12:36:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:36:25,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:25,932 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] [2018-12-02 12:36:25,932 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:25,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1562827304, now seen corresponding path program 1 times [2018-12-02 12:36:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:25,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:26,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:26,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:26,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:26,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:26,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:26,039 INFO L87 Difference]: Start difference. First operand 2541 states and 5837 transitions. Second operand 6 states. [2018-12-02 12:36:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:26,151 INFO L93 Difference]: Finished difference Result 2927 states and 6650 transitions. [2018-12-02 12:36:26,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:36:26,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 12:36:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:26,154 INFO L225 Difference]: With dead ends: 2927 [2018-12-02 12:36:26,154 INFO L226 Difference]: Without dead ends: 2869 [2018-12-02 12:36:26,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2018-12-02 12:36:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2244. [2018-12-02 12:36:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-12-02 12:36:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5100 transitions. [2018-12-02 12:36:26,178 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5100 transitions. Word has length 82 [2018-12-02 12:36:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:26,178 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5100 transitions. [2018-12-02 12:36:26,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5100 transitions. [2018-12-02 12:36:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:36:26,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:26,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] [2018-12-02 12:36:26,181 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:26,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -514382039, now seen corresponding path program 1 times [2018-12-02 12:36:26,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:26,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:26,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:26,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:26,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:26,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:26,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:26,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:26,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:26,265 INFO L87 Difference]: Start difference. First operand 2244 states and 5100 transitions. Second operand 5 states. [2018-12-02 12:36:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:26,297 INFO L93 Difference]: Finished difference Result 2244 states and 5084 transitions. [2018-12-02 12:36:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:36:26,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-02 12:36:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:26,299 INFO L225 Difference]: With dead ends: 2244 [2018-12-02 12:36:26,299 INFO L226 Difference]: Without dead ends: 2244 [2018-12-02 12:36:26,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2018-12-02 12:36:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2244. [2018-12-02 12:36:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-12-02 12:36:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5084 transitions. [2018-12-02 12:36:26,343 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5084 transitions. Word has length 82 [2018-12-02 12:36:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:26,343 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5084 transitions. [2018-12-02 12:36:26,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5084 transitions. [2018-12-02 12:36:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:36:26,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:26,345 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] [2018-12-02 12:36:26,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:26,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 373121642, now seen corresponding path program 1 times [2018-12-02 12:36:26,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:26,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:26,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:26,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:26,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:36:26,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:26,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:36:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:36:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:26,428 INFO L87 Difference]: Start difference. First operand 2244 states and 5084 transitions. Second operand 7 states. [2018-12-02 12:36:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:26,640 INFO L93 Difference]: Finished difference Result 3952 states and 9010 transitions. [2018-12-02 12:36:26,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:36:26,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 12:36:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:26,642 INFO L225 Difference]: With dead ends: 3952 [2018-12-02 12:36:26,642 INFO L226 Difference]: Without dead ends: 1652 [2018-12-02 12:36:26,642 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-02 12:36:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-12-02 12:36:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2018-12-02 12:36:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-12-02 12:36:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3759 transitions. [2018-12-02 12:36:26,653 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3759 transitions. Word has length 82 [2018-12-02 12:36:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:26,653 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 3759 transitions. [2018-12-02 12:36:26,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:36:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3759 transitions. [2018-12-02 12:36:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:36:26,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:26,655 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] [2018-12-02 12:36:26,655 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:26,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1980467430, now seen corresponding path program 2 times [2018-12-02 12:36:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:26,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:36:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:36:26,689 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:36:26,754 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:36:26,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:36:26 BasicIcfg [2018-12-02 12:36:26,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:36:26,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:36:26,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:36:26,756 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:36:26,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:36:19" (3/4) ... [2018-12-02 12:36:26,757 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:36:26,826 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5cd0724f-40d4-48d6-85e8-beebdc45dbf9/bin-2019/utaipan/witness.graphml [2018-12-02 12:36:26,826 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:36:26,827 INFO L168 Benchmark]: Toolchain (without parser) took 7583.01 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 675.3 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -381.0 MB). Peak memory consumption was 294.3 MB. Max. memory is 11.5 GB. [2018-12-02 12:36:26,828 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:36:26,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:36:26,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:36:26,828 INFO L168 Benchmark]: Boogie Preprocessor took 18.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:36:26,828 INFO L168 Benchmark]: RCFGBuilder took 349.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:36:26,829 INFO L168 Benchmark]: TraceAbstraction took 6801.02 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 548.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -307.1 MB). Peak memory consumption was 241.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:36:26,829 INFO L168 Benchmark]: Witness Printer took 70.89 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-02 12:36:26,830 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6801.02 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 548.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -307.1 MB). Peak memory consumption was 241.9 MB. Max. memory is 11.5 GB. * Witness Printer took 70.89 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L680] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L681] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L682] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L683] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L684] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L685] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L686] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L687] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L688] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L689] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L690] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L691] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L692] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L694] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L695] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] -1 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] FCALL, FORK -1 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L768] -1 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] FCALL, FORK -1 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 x$w_buff1 = x$w_buff0 [L731] 0 x$w_buff0 = 1 [L732] 0 x$w_buff1_used = x$w_buff0_used [L733] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L736] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L737] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L738] 0 x$r_buff0_thd2 = (_Bool)1 [L741] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L700] 1 y = 2 [L705] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L706] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L707] 1 x$flush_delayed = weak$$choice2 [L708] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L710] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L711] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L712] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L712] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L713] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L714] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L715] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L716] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x = x$flush_delayed ? x$mem_tmp : x [L718] 1 x$flush_delayed = (_Bool)0 [L723] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L748] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L748] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L751] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L779] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. UNSAFE Result, 6.7s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3513 SDtfs, 4229 SDslu, 6399 SDs, 0 SdLazy, 2740 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27853occurred in iteration=0, 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: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 24306 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 211681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...