./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/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 955793ded220663ed453216afabe04ee8e7d5e37 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:15:18,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:15:18,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:15:18,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:15:18,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:15:18,814 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:15:18,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:15:18,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:15:18,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:15:18,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:15:18,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:15:18,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:15:18,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:15:18,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:15:18,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:15:18,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:15:18,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:15:18,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:15:18,824 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:15:18,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:15:18,825 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:15:18,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:15:18,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:15:18,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:15:18,827 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:15:18,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:15:18,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:15:18,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:15:18,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:15:18,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:15:18,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:15:18,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:15:18,831 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:15:18,831 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:15:18,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:15:18,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:15:18,832 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 04:15:18,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:15:18,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:15:18,840 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:15:18,840 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:15:18,840 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:15:18,840 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:15:18,840 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:15:18,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:15:18,841 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:15:18,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:15:18,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:15:18,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:15:18,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:15:18,843 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_bf3e51fa-22a8-4191-8b47-6c80da127af5/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 -> 955793ded220663ed453216afabe04ee8e7d5e37 [2018-12-02 04:15:18,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:15:18,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:15:18,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:15:18,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:15:18,870 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:15:18,870 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_rmo.opt_false-unreach-call.i [2018-12-02 04:15:18,905 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/data/d5db5be35/6c10963a4a98468b955305dae98e9c59/FLAG97b62fb6c [2018-12-02 04:15:19,232 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:15:19,232 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/sv-benchmarks/c/pthread-wmm/mix000_rmo.opt_false-unreach-call.i [2018-12-02 04:15:19,242 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/data/d5db5be35/6c10963a4a98468b955305dae98e9c59/FLAG97b62fb6c [2018-12-02 04:15:19,254 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/data/d5db5be35/6c10963a4a98468b955305dae98e9c59 [2018-12-02 04:15:19,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:15:19,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:15:19,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:15:19,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:15:19,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:15:19,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19, skipping insertion in model container [2018-12-02 04:15:19,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:15:19,291 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:15:19,472 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:15:19,480 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:15:19,558 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:15:19,588 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:15:19,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19 WrapperNode [2018-12-02 04:15:19,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:15:19,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:15:19,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:15:19,589 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:15:19,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:15:19,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:15:19,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:15:19,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:15:19,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... [2018-12-02 04:15:19,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:15:19,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:15:19,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:15:19,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:15:19,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/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 04:15:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 04:15:19,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 04:15:19,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 04:15:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:15:19,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:15:19,681 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 04:15:20,036 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:15:20,036 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 04:15:20,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:15:20 BoogieIcfgContainer [2018-12-02 04:15:20,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:15:20,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:15:20,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:15:20,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:15:20,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:15:19" (1/3) ... [2018-12-02 04:15:20,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3fb739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:15:20, skipping insertion in model container [2018-12-02 04:15:20,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:15:19" (2/3) ... [2018-12-02 04:15:20,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3fb739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:15:20, skipping insertion in model container [2018-12-02 04:15:20,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:15:20" (3/3) ... [2018-12-02 04:15:20,041 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_rmo.opt_false-unreach-call.i [2018-12-02 04:15:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,065 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,066 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,066 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,067 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,068 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,069 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,070 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,071 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,072 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,073 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,074 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,075 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,076 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,076 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,076 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,077 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:15:20,099 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 04:15:20,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:15:20,104 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 04:15:20,113 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 04:15:20,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:15:20,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:15:20,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:15:20,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:15:20,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:15:20,128 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:15:20,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:15:20,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:15:20,135 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-12-02 04:15:25,902 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-12-02 04:15:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-12-02 04:15:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 04:15:25,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:25,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:25,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:25,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2018-12-02 04:15:25,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:25,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:26,084 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 04:15:26,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:15:26,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:26,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:15:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:15:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:26,100 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-12-02 04:15:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:26,893 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-12-02 04:15:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:15:26,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-02 04:15:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:27,388 INFO L225 Difference]: With dead ends: 150584 [2018-12-02 04:15:27,388 INFO L226 Difference]: Without dead ends: 105840 [2018-12-02 04:15:27,389 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 04:15:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-12-02 04:15:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-12-02 04:15:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-12-02 04:15:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-12-02 04:15:29,466 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-12-02 04:15:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:29,467 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-12-02 04:15:29,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:15:29,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-12-02 04:15:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 04:15:29,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:29,471 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 04:15:29,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:29,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:29,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2018-12-02 04:15:29,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:29,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:29,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:29,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:29,518 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 04:15:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:29,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:15:29,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:29,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:15:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:15:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:29,519 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 4 states. [2018-12-02 04:15:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:29,678 INFO L93 Difference]: Finished difference Result 14310 states and 48364 transitions. [2018-12-02 04:15:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:15:29,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 04:15:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:29,709 INFO L225 Difference]: With dead ends: 14310 [2018-12-02 04:15:29,709 INFO L226 Difference]: Without dead ends: 11490 [2018-12-02 04:15:29,709 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 04:15:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2018-12-02 04:15:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 11490. [2018-12-02 04:15:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-12-02 04:15:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 37855 transitions. [2018-12-02 04:15:29,836 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 37855 transitions. Word has length 47 [2018-12-02 04:15:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:29,836 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 37855 transitions. [2018-12-02 04:15:29,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:15:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 37855 transitions. [2018-12-02 04:15:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 04:15:29,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:29,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:29,837 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:29,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1095203171, now seen corresponding path program 1 times [2018-12-02 04:15:29,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:29,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:29,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:29,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:29,895 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 04:15:29,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:29,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:15:29,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:29,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:15:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:15:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:29,896 INFO L87 Difference]: Start difference. First operand 11490 states and 37855 transitions. Second operand 5 states. [2018-12-02 04:15:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:30,286 INFO L93 Difference]: Finished difference Result 23360 states and 75856 transitions. [2018-12-02 04:15:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:15:30,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 04:15:30,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:30,330 INFO L225 Difference]: With dead ends: 23360 [2018-12-02 04:15:30,330 INFO L226 Difference]: Without dead ends: 23285 [2018-12-02 04:15:30,331 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 04:15:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2018-12-02 04:15:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 15417. [2018-12-02 04:15:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2018-12-02 04:15:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 49310 transitions. [2018-12-02 04:15:30,539 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 49310 transitions. Word has length 48 [2018-12-02 04:15:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:30,540 INFO L480 AbstractCegarLoop]: Abstraction has 15417 states and 49310 transitions. [2018-12-02 04:15:30,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:15:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 49310 transitions. [2018-12-02 04:15:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 04:15:30,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:30,543 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] [2018-12-02 04:15:30,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:30,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash 659319747, now seen corresponding path program 1 times [2018-12-02 04:15:30,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:30,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:30,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:30,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:30,579 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 04:15:30,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:15:30,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:30,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:15:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:15:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:15:30,581 INFO L87 Difference]: Start difference. First operand 15417 states and 49310 transitions. Second operand 3 states. [2018-12-02 04:15:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:30,687 INFO L93 Difference]: Finished difference Result 28677 states and 90548 transitions. [2018-12-02 04:15:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:15:30,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 04:15:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:30,724 INFO L225 Difference]: With dead ends: 28677 [2018-12-02 04:15:30,724 INFO L226 Difference]: Without dead ends: 28673 [2018-12-02 04:15:30,724 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 04:15:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2018-12-02 04:15:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24152. [2018-12-02 04:15:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2018-12-02 04:15:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 76316 transitions. [2018-12-02 04:15:31,007 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 76316 transitions. Word has length 50 [2018-12-02 04:15:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:31,007 INFO L480 AbstractCegarLoop]: Abstraction has 24152 states and 76316 transitions. [2018-12-02 04:15:31,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:15:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 76316 transitions. [2018-12-02 04:15:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 04:15:31,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:31,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:31,009 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:31,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 669168142, now seen corresponding path program 1 times [2018-12-02 04:15:31,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:31,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:31,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:31,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:31,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:31,056 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 04:15:31,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:31,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:15:31,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:31,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:15:31,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:15:31,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:15:31,057 INFO L87 Difference]: Start difference. First operand 24152 states and 76316 transitions. Second operand 6 states. [2018-12-02 04:15:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:31,492 INFO L93 Difference]: Finished difference Result 33838 states and 105314 transitions. [2018-12-02 04:15:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:15:31,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 04:15:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:31,533 INFO L225 Difference]: With dead ends: 33838 [2018-12-02 04:15:31,534 INFO L226 Difference]: Without dead ends: 33741 [2018-12-02 04:15:31,534 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 04:15:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33741 states. [2018-12-02 04:15:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33741 to 23973. [2018-12-02 04:15:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23973 states. [2018-12-02 04:15:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23973 states to 23973 states and 75822 transitions. [2018-12-02 04:15:31,854 INFO L78 Accepts]: Start accepts. Automaton has 23973 states and 75822 transitions. Word has length 54 [2018-12-02 04:15:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:31,854 INFO L480 AbstractCegarLoop]: Abstraction has 23973 states and 75822 transitions. [2018-12-02 04:15:31,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:15:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 23973 states and 75822 transitions. [2018-12-02 04:15:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 04:15:31,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:31,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:31,859 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:31,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:31,860 INFO L82 PathProgramCache]: Analyzing trace with hash -494140957, now seen corresponding path program 1 times [2018-12-02 04:15:31,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:31,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:31,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:31,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:31,901 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 04:15:31,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:31,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:15:31,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:31,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:15:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:15:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:31,902 INFO L87 Difference]: Start difference. First operand 23973 states and 75822 transitions. Second operand 4 states. [2018-12-02 04:15:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:32,174 INFO L93 Difference]: Finished difference Result 30737 states and 97932 transitions. [2018-12-02 04:15:32,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:15:32,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 04:15:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:32,213 INFO L225 Difference]: With dead ends: 30737 [2018-12-02 04:15:32,213 INFO L226 Difference]: Without dead ends: 30737 [2018-12-02 04:15:32,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30737 states. [2018-12-02 04:15:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30737 to 27609. [2018-12-02 04:15:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27609 states. [2018-12-02 04:15:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27609 states to 27609 states and 87450 transitions. [2018-12-02 04:15:32,531 INFO L78 Accepts]: Start accepts. Automaton has 27609 states and 87450 transitions. Word has length 64 [2018-12-02 04:15:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:32,531 INFO L480 AbstractCegarLoop]: Abstraction has 27609 states and 87450 transitions. [2018-12-02 04:15:32,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:15:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27609 states and 87450 transitions. [2018-12-02 04:15:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 04:15:32,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:32,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:32,537 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:32,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:32,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1248669378, now seen corresponding path program 1 times [2018-12-02 04:15:32,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:32,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:32,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:32,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:32,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:32,598 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 04:15:32,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:15:32,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:32,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:15:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:15:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:15:32,599 INFO L87 Difference]: Start difference. First operand 27609 states and 87450 transitions. Second operand 6 states. [2018-12-02 04:15:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:33,262 INFO L93 Difference]: Finished difference Result 65702 states and 204771 transitions. [2018-12-02 04:15:33,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:15:33,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 04:15:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:33,352 INFO L225 Difference]: With dead ends: 65702 [2018-12-02 04:15:33,352 INFO L226 Difference]: Without dead ends: 65638 [2018-12-02 04:15:33,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 04:15:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65638 states. [2018-12-02 04:15:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65638 to 39277. [2018-12-02 04:15:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39277 states. [2018-12-02 04:15:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39277 states to 39277 states and 121531 transitions. [2018-12-02 04:15:34,065 INFO L78 Accepts]: Start accepts. Automaton has 39277 states and 121531 transitions. Word has length 64 [2018-12-02 04:15:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:34,065 INFO L480 AbstractCegarLoop]: Abstraction has 39277 states and 121531 transitions. [2018-12-02 04:15:34,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:15:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 39277 states and 121531 transitions. [2018-12-02 04:15:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 04:15:34,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:34,075 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] [2018-12-02 04:15:34,075 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:34,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1121736755, now seen corresponding path program 1 times [2018-12-02 04:15:34,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:34,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:34,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:34,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:34,103 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 04:15:34,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:34,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:15:34,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:34,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:15:34,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:15:34,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:15:34,103 INFO L87 Difference]: Start difference. First operand 39277 states and 121531 transitions. Second operand 3 states. [2018-12-02 04:15:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:34,242 INFO L93 Difference]: Finished difference Result 44930 states and 137016 transitions. [2018-12-02 04:15:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:15:34,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-02 04:15:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:34,298 INFO L225 Difference]: With dead ends: 44930 [2018-12-02 04:15:34,298 INFO L226 Difference]: Without dead ends: 44930 [2018-12-02 04:15:34,299 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 04:15:34,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44930 states. [2018-12-02 04:15:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44930 to 38917. [2018-12-02 04:15:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38917 states. [2018-12-02 04:15:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38917 states to 38917 states and 117881 transitions. [2018-12-02 04:15:34,732 INFO L78 Accepts]: Start accepts. Automaton has 38917 states and 117881 transitions. Word has length 70 [2018-12-02 04:15:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:34,732 INFO L480 AbstractCegarLoop]: Abstraction has 38917 states and 117881 transitions. [2018-12-02 04:15:34,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:15:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 38917 states and 117881 transitions. [2018-12-02 04:15:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 04:15:34,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:34,742 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] [2018-12-02 04:15:34,742 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:34,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:34,742 INFO L82 PathProgramCache]: Analyzing trace with hash 729490707, now seen corresponding path program 1 times [2018-12-02 04:15:34,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:34,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:34,825 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 04:15:34,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:34,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:15:34,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:34,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:15:34,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:15:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:15:34,826 INFO L87 Difference]: Start difference. First operand 38917 states and 117881 transitions. Second operand 7 states. [2018-12-02 04:15:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:35,580 INFO L93 Difference]: Finished difference Result 56282 states and 170059 transitions. [2018-12-02 04:15:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:15:35,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-02 04:15:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:35,649 INFO L225 Difference]: With dead ends: 56282 [2018-12-02 04:15:35,649 INFO L226 Difference]: Without dead ends: 55978 [2018-12-02 04:15:35,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:15:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55978 states. [2018-12-02 04:15:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55978 to 47673. [2018-12-02 04:15:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47673 states. [2018-12-02 04:15:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47673 states to 47673 states and 144132 transitions. [2018-12-02 04:15:36,225 INFO L78 Accepts]: Start accepts. Automaton has 47673 states and 144132 transitions. Word has length 71 [2018-12-02 04:15:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:36,226 INFO L480 AbstractCegarLoop]: Abstraction has 47673 states and 144132 transitions. [2018-12-02 04:15:36,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:15:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47673 states and 144132 transitions. [2018-12-02 04:15:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 04:15:36,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:36,238 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] [2018-12-02 04:15:36,238 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:36,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1067460652, now seen corresponding path program 1 times [2018-12-02 04:15:36,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:36,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:36,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:36,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:36,279 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 04:15:36,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:36,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:15:36,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:36,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:15:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:15:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:36,280 INFO L87 Difference]: Start difference. First operand 47673 states and 144132 transitions. Second operand 5 states. [2018-12-02 04:15:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:36,331 INFO L93 Difference]: Finished difference Result 13173 states and 32973 transitions. [2018-12-02 04:15:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:15:36,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-02 04:15:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:36,340 INFO L225 Difference]: With dead ends: 13173 [2018-12-02 04:15:36,340 INFO L226 Difference]: Without dead ends: 11053 [2018-12-02 04:15:36,341 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 04:15:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2018-12-02 04:15:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 8482. [2018-12-02 04:15:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2018-12-02 04:15:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 21145 transitions. [2018-12-02 04:15:36,487 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 21145 transitions. Word has length 71 [2018-12-02 04:15:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:36,487 INFO L480 AbstractCegarLoop]: Abstraction has 8482 states and 21145 transitions. [2018-12-02 04:15:36,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:15:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 21145 transitions. [2018-12-02 04:15:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 04:15:36,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:36,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:36,495 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:36,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1542306492, now seen corresponding path program 1 times [2018-12-02 04:15:36,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:36,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:36,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:36,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:36,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:36,543 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 04:15:36,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:36,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:15:36,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:36,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:15:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:15:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:36,544 INFO L87 Difference]: Start difference. First operand 8482 states and 21145 transitions. Second operand 4 states. [2018-12-02 04:15:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:36,698 INFO L93 Difference]: Finished difference Result 9897 states and 24269 transitions. [2018-12-02 04:15:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:15:36,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-02 04:15:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:36,706 INFO L225 Difference]: With dead ends: 9897 [2018-12-02 04:15:36,706 INFO L226 Difference]: Without dead ends: 9897 [2018-12-02 04:15:36,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9897 states. [2018-12-02 04:15:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9897 to 9378. [2018-12-02 04:15:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9378 states. [2018-12-02 04:15:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 23112 transitions. [2018-12-02 04:15:36,778 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 23112 transitions. Word has length 99 [2018-12-02 04:15:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:36,779 INFO L480 AbstractCegarLoop]: Abstraction has 9378 states and 23112 transitions. [2018-12-02 04:15:36,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:15:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 23112 transitions. [2018-12-02 04:15:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 04:15:36,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:36,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:36,786 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:36,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash 407993763, now seen corresponding path program 1 times [2018-12-02 04:15:36,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:36,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:36,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:36,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:36,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:36,875 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 04:15:36,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:15:36,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:36,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:15:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:15:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:15:36,876 INFO L87 Difference]: Start difference. First operand 9378 states and 23112 transitions. Second operand 7 states. [2018-12-02 04:15:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:37,171 INFO L93 Difference]: Finished difference Result 14626 states and 34768 transitions. [2018-12-02 04:15:37,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:15:37,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 04:15:37,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:37,182 INFO L225 Difference]: With dead ends: 14626 [2018-12-02 04:15:37,182 INFO L226 Difference]: Without dead ends: 14516 [2018-12-02 04:15:37,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:15:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14516 states. [2018-12-02 04:15:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14516 to 11967. [2018-12-02 04:15:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11967 states. [2018-12-02 04:15:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11967 states to 11967 states and 28803 transitions. [2018-12-02 04:15:37,295 INFO L78 Accepts]: Start accepts. Automaton has 11967 states and 28803 transitions. Word has length 99 [2018-12-02 04:15:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:37,295 INFO L480 AbstractCegarLoop]: Abstraction has 11967 states and 28803 transitions. [2018-12-02 04:15:37,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:15:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 11967 states and 28803 transitions. [2018-12-02 04:15:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 04:15:37,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:37,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:37,305 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:37,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2018919428, now seen corresponding path program 2 times [2018-12-02 04:15:37,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:37,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:37,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:37,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:37,351 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 04:15:37,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:37,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:15:37,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:37,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:15:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:15:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:37,352 INFO L87 Difference]: Start difference. First operand 11967 states and 28803 transitions. Second operand 5 states. [2018-12-02 04:15:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:37,566 INFO L93 Difference]: Finished difference Result 14380 states and 33980 transitions. [2018-12-02 04:15:37,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:15:37,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 04:15:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:37,576 INFO L225 Difference]: With dead ends: 14380 [2018-12-02 04:15:37,576 INFO L226 Difference]: Without dead ends: 14344 [2018-12-02 04:15:37,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 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 04:15:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14344 states. [2018-12-02 04:15:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14344 to 12662. [2018-12-02 04:15:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12662 states. [2018-12-02 04:15:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12662 states to 12662 states and 30243 transitions. [2018-12-02 04:15:37,683 INFO L78 Accepts]: Start accepts. Automaton has 12662 states and 30243 transitions. Word has length 99 [2018-12-02 04:15:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:37,683 INFO L480 AbstractCegarLoop]: Abstraction has 12662 states and 30243 transitions. [2018-12-02 04:15:37,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:15:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 12662 states and 30243 transitions. [2018-12-02 04:15:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 04:15:37,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:37,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:37,693 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:37,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1250541776, now seen corresponding path program 3 times [2018-12-02 04:15:37,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:37,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:15:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:37,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:37,775 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 04:15:37,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:37,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:15:37,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:15:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:15:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:15:37,776 INFO L87 Difference]: Start difference. First operand 12662 states and 30243 transitions. Second operand 8 states. [2018-12-02 04:15:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:38,527 INFO L93 Difference]: Finished difference Result 16977 states and 40619 transitions. [2018-12-02 04:15:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:15:38,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-02 04:15:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:38,548 INFO L225 Difference]: With dead ends: 16977 [2018-12-02 04:15:38,548 INFO L226 Difference]: Without dead ends: 16945 [2018-12-02 04:15:38,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:15:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16945 states. [2018-12-02 04:15:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16945 to 13635. [2018-12-02 04:15:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2018-12-02 04:15:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 32662 transitions. [2018-12-02 04:15:38,677 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 32662 transitions. Word has length 99 [2018-12-02 04:15:38,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:38,677 INFO L480 AbstractCegarLoop]: Abstraction has 13635 states and 32662 transitions. [2018-12-02 04:15:38,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:15:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 32662 transitions. [2018-12-02 04:15:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 04:15:38,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:38,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:38,689 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:38,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1247474161, now seen corresponding path program 1 times [2018-12-02 04:15:38,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:38,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:38,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:15:38,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:38,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:38,738 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 04:15:38,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:38,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:15:38,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:38,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:15:38,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:15:38,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:15:38,739 INFO L87 Difference]: Start difference. First operand 13635 states and 32662 transitions. Second operand 6 states. [2018-12-02 04:15:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:39,066 INFO L93 Difference]: Finished difference Result 16474 states and 39203 transitions. [2018-12-02 04:15:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:15:39,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 04:15:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:39,080 INFO L225 Difference]: With dead ends: 16474 [2018-12-02 04:15:39,080 INFO L226 Difference]: Without dead ends: 16474 [2018-12-02 04:15:39,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:15:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16474 states. [2018-12-02 04:15:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16474 to 14787. [2018-12-02 04:15:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14787 states. [2018-12-02 04:15:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14787 states to 14787 states and 35323 transitions. [2018-12-02 04:15:39,210 INFO L78 Accepts]: Start accepts. Automaton has 14787 states and 35323 transitions. Word has length 99 [2018-12-02 04:15:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:39,210 INFO L480 AbstractCegarLoop]: Abstraction has 14787 states and 35323 transitions. [2018-12-02 04:15:39,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:15:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14787 states and 35323 transitions. [2018-12-02 04:15:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 04:15:39,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:39,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:39,222 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:39,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1278493968, now seen corresponding path program 1 times [2018-12-02 04:15:39,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:39,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:39,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:39,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:39,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:39,259 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 04:15:39,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:39,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:15:39,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:39,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:15:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:15:39,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:15:39,260 INFO L87 Difference]: Start difference. First operand 14787 states and 35323 transitions. Second operand 3 states. [2018-12-02 04:15:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:39,291 INFO L93 Difference]: Finished difference Result 14723 states and 35051 transitions. [2018-12-02 04:15:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:15:39,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-02 04:15:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:39,302 INFO L225 Difference]: With dead ends: 14723 [2018-12-02 04:15:39,302 INFO L226 Difference]: Without dead ends: 14691 [2018-12-02 04:15:39,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:15:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14691 states. [2018-12-02 04:15:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14691 to 13185. [2018-12-02 04:15:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13185 states. [2018-12-02 04:15:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 31503 transitions. [2018-12-02 04:15:39,417 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 31503 transitions. Word has length 99 [2018-12-02 04:15:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:39,418 INFO L480 AbstractCegarLoop]: Abstraction has 13185 states and 31503 transitions. [2018-12-02 04:15:39,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:15:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 31503 transitions. [2018-12-02 04:15:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:39,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:39,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:39,427 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:39,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash -470928217, now seen corresponding path program 1 times [2018-12-02 04:15:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:39,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:39,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:15:39,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:15:39,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:39,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:15:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:15:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:15:39,506 INFO L87 Difference]: Start difference. First operand 13185 states and 31503 transitions. Second operand 7 states. [2018-12-02 04:15:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:40,029 INFO L93 Difference]: Finished difference Result 17522 states and 40246 transitions. [2018-12-02 04:15:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:15:40,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 04:15:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:40,073 INFO L225 Difference]: With dead ends: 17522 [2018-12-02 04:15:40,073 INFO L226 Difference]: Without dead ends: 17522 [2018-12-02 04:15:40,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:15:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17522 states. [2018-12-02 04:15:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17522 to 14564. [2018-12-02 04:15:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14564 states. [2018-12-02 04:15:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14564 states to 14564 states and 33938 transitions. [2018-12-02 04:15:40,193 INFO L78 Accepts]: Start accepts. Automaton has 14564 states and 33938 transitions. Word has length 101 [2018-12-02 04:15:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:40,193 INFO L480 AbstractCegarLoop]: Abstraction has 14564 states and 33938 transitions. [2018-12-02 04:15:40,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:15:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14564 states and 33938 transitions. [2018-12-02 04:15:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:40,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:40,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:40,204 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:40,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash 222173480, now seen corresponding path program 1 times [2018-12-02 04:15:40,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:40,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:40,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:40,236 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 04:15:40,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:40,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:15:40,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:40,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:15:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:15:40,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:40,237 INFO L87 Difference]: Start difference. First operand 14564 states and 33938 transitions. Second operand 4 states. [2018-12-02 04:15:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:40,277 INFO L93 Difference]: Finished difference Result 14564 states and 33906 transitions. [2018-12-02 04:15:40,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:15:40,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 04:15:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:40,287 INFO L225 Difference]: With dead ends: 14564 [2018-12-02 04:15:40,287 INFO L226 Difference]: Without dead ends: 14564 [2018-12-02 04:15:40,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:40,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14564 states. [2018-12-02 04:15:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14564 to 13382. [2018-12-02 04:15:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13382 states. [2018-12-02 04:15:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13382 states to 13382 states and 31204 transitions. [2018-12-02 04:15:40,404 INFO L78 Accepts]: Start accepts. Automaton has 13382 states and 31204 transitions. Word has length 101 [2018-12-02 04:15:40,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:40,404 INFO L480 AbstractCegarLoop]: Abstraction has 13382 states and 31204 transitions. [2018-12-02 04:15:40,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:15:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13382 states and 31204 transitions. [2018-12-02 04:15:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:40,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:40,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:40,414 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:40,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2085312056, now seen corresponding path program 1 times [2018-12-02 04:15:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:40,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:40,476 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 04:15:40,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:40,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:15:40,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:40,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:15:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:15:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:15:40,477 INFO L87 Difference]: Start difference. First operand 13382 states and 31204 transitions. Second operand 7 states. [2018-12-02 04:15:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:40,737 INFO L93 Difference]: Finished difference Result 13863 states and 32384 transitions. [2018-12-02 04:15:40,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:15:40,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-02 04:15:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:40,752 INFO L225 Difference]: With dead ends: 13863 [2018-12-02 04:15:40,752 INFO L226 Difference]: Without dead ends: 13863 [2018-12-02 04:15:40,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:15:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13863 states. [2018-12-02 04:15:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13863 to 13288. [2018-12-02 04:15:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13288 states. [2018-12-02 04:15:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13288 states to 13288 states and 31014 transitions. [2018-12-02 04:15:40,881 INFO L78 Accepts]: Start accepts. Automaton has 13288 states and 31014 transitions. Word has length 101 [2018-12-02 04:15:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:40,882 INFO L480 AbstractCegarLoop]: Abstraction has 13288 states and 31014 transitions. [2018-12-02 04:15:40,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:15:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 13288 states and 31014 transitions. [2018-12-02 04:15:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:40,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:40,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:40,891 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:40,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 379001387, now seen corresponding path program 1 times [2018-12-02 04:15:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:40,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:40,909 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 04:15:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:40,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:15:40,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:40,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:15:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:15:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:15:40,910 INFO L87 Difference]: Start difference. First operand 13288 states and 31014 transitions. Second operand 3 states. [2018-12-02 04:15:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:40,958 INFO L93 Difference]: Finished difference Result 16253 states and 37986 transitions. [2018-12-02 04:15:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:15:40,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-02 04:15:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:40,975 INFO L225 Difference]: With dead ends: 16253 [2018-12-02 04:15:40,975 INFO L226 Difference]: Without dead ends: 16253 [2018-12-02 04:15:40,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:15:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2018-12-02 04:15:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 16195. [2018-12-02 04:15:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16195 states. [2018-12-02 04:15:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 37858 transitions. [2018-12-02 04:15:41,111 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 37858 transitions. Word has length 101 [2018-12-02 04:15:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:41,111 INFO L480 AbstractCegarLoop]: Abstraction has 16195 states and 37858 transitions. [2018-12-02 04:15:41,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:15:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 37858 transitions. [2018-12-02 04:15:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:41,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:41,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:41,123 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:41,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash 590352300, now seen corresponding path program 1 times [2018-12-02 04:15:41,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:41,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:41,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:41,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:41,162 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 04:15:41,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:41,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:15:41,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:41,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:15:41,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:15:41,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:41,163 INFO L87 Difference]: Start difference. First operand 16195 states and 37858 transitions. Second operand 4 states. [2018-12-02 04:15:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:41,345 INFO L93 Difference]: Finished difference Result 16803 states and 39211 transitions. [2018-12-02 04:15:41,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:15:41,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 04:15:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:41,357 INFO L225 Difference]: With dead ends: 16803 [2018-12-02 04:15:41,357 INFO L226 Difference]: Without dead ends: 16803 [2018-12-02 04:15:41,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:15:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16803 states. [2018-12-02 04:15:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16803 to 15788. [2018-12-02 04:15:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15788 states. [2018-12-02 04:15:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15788 states to 15788 states and 36959 transitions. [2018-12-02 04:15:41,495 INFO L78 Accepts]: Start accepts. Automaton has 15788 states and 36959 transitions. Word has length 101 [2018-12-02 04:15:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:41,495 INFO L480 AbstractCegarLoop]: Abstraction has 15788 states and 36959 transitions. [2018-12-02 04:15:41,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:15:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15788 states and 36959 transitions. [2018-12-02 04:15:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:41,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:41,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:41,506 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:41,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:41,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1632634376, now seen corresponding path program 2 times [2018-12-02 04:15:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:41,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:41,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:41,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:41,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:41,550 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 04:15:41,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:41,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:15:41,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:41,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:15:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:15:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:41,551 INFO L87 Difference]: Start difference. First operand 15788 states and 36959 transitions. Second operand 5 states. [2018-12-02 04:15:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:41,749 INFO L93 Difference]: Finished difference Result 16959 states and 39455 transitions. [2018-12-02 04:15:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:15:41,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 04:15:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:41,761 INFO L225 Difference]: With dead ends: 16959 [2018-12-02 04:15:41,762 INFO L226 Difference]: Without dead ends: 16959 [2018-12-02 04:15:41,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 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 04:15:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16959 states. [2018-12-02 04:15:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16959 to 15751. [2018-12-02 04:15:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15751 states. [2018-12-02 04:15:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15751 states to 15751 states and 36811 transitions. [2018-12-02 04:15:41,893 INFO L78 Accepts]: Start accepts. Automaton has 15751 states and 36811 transitions. Word has length 101 [2018-12-02 04:15:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:41,893 INFO L480 AbstractCegarLoop]: Abstraction has 15751 states and 36811 transitions. [2018-12-02 04:15:41,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:15:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 15751 states and 36811 transitions. [2018-12-02 04:15:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:41,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:41,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:41,904 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:41,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash 119162228, now seen corresponding path program 3 times [2018-12-02 04:15:41,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:41,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:15:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:41,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:41,961 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 04:15:41,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:41,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:15:41,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:15:41,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:15:41,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:15:41,962 INFO L87 Difference]: Start difference. First operand 15751 states and 36811 transitions. Second operand 6 states. [2018-12-02 04:15:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:42,173 INFO L93 Difference]: Finished difference Result 18906 states and 44009 transitions. [2018-12-02 04:15:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:15:42,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-02 04:15:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:42,186 INFO L225 Difference]: With dead ends: 18906 [2018-12-02 04:15:42,186 INFO L226 Difference]: Without dead ends: 18906 [2018-12-02 04:15:42,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 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 04:15:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18906 states. [2018-12-02 04:15:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18906 to 15781. [2018-12-02 04:15:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15781 states. [2018-12-02 04:15:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15781 states to 15781 states and 36874 transitions. [2018-12-02 04:15:42,324 INFO L78 Accepts]: Start accepts. Automaton has 15781 states and 36874 transitions. Word has length 101 [2018-12-02 04:15:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:42,324 INFO L480 AbstractCegarLoop]: Abstraction has 15781 states and 36874 transitions. [2018-12-02 04:15:42,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:15:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15781 states and 36874 transitions. [2018-12-02 04:15:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 04:15:42,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:42,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:42,335 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:42,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash 902940276, now seen corresponding path program 4 times [2018-12-02 04:15:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:42,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:15:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:42,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:42,384 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 04:15:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:42,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:15:42,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:42,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:15:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:15:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:15:42,385 INFO L87 Difference]: Start difference. First operand 15781 states and 36874 transitions. Second operand 5 states. [2018-12-02 04:15:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:42,539 INFO L93 Difference]: Finished difference Result 17164 states and 39723 transitions. [2018-12-02 04:15:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:15:42,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 04:15:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:42,551 INFO L225 Difference]: With dead ends: 17164 [2018-12-02 04:15:42,551 INFO L226 Difference]: Without dead ends: 17164 [2018-12-02 04:15:42,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:15:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states. [2018-12-02 04:15:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 16005. [2018-12-02 04:15:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16005 states. [2018-12-02 04:15:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16005 states to 16005 states and 37337 transitions. [2018-12-02 04:15:42,708 INFO L78 Accepts]: Start accepts. Automaton has 16005 states and 37337 transitions. Word has length 101 [2018-12-02 04:15:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:42,708 INFO L480 AbstractCegarLoop]: Abstraction has 16005 states and 37337 transitions. [2018-12-02 04:15:42,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:15:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16005 states and 37337 transitions. [2018-12-02 04:15:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 04:15:42,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:42,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:42,722 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:42,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 966407303, now seen corresponding path program 1 times [2018-12-02 04:15:42,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:42,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:42,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:42,823 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 04:15:42,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:42,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 04:15:42,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:42,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:15:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:15:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:15:42,824 INFO L87 Difference]: Start difference. First operand 16005 states and 37337 transitions. Second operand 10 states. [2018-12-02 04:15:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:43,194 INFO L93 Difference]: Finished difference Result 18288 states and 42593 transitions. [2018-12-02 04:15:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:15:43,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-12-02 04:15:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:43,196 INFO L225 Difference]: With dead ends: 18288 [2018-12-02 04:15:43,196 INFO L226 Difference]: Without dead ends: 3323 [2018-12-02 04:15:43,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-02 04:15:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2018-12-02 04:15:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3321. [2018-12-02 04:15:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2018-12-02 04:15:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 7924 transitions. [2018-12-02 04:15:43,217 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 7924 transitions. Word has length 103 [2018-12-02 04:15:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:43,217 INFO L480 AbstractCegarLoop]: Abstraction has 3321 states and 7924 transitions. [2018-12-02 04:15:43,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:15:43,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 7924 transitions. [2018-12-02 04:15:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 04:15:43,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:43,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:15:43,219 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:43,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1671302440, now seen corresponding path program 1 times [2018-12-02 04:15:43,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:43,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:43,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:43,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:43,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:15:43,315 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 04:15:43,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:15:43,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 04:15:43,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:15:43,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 04:15:43,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 04:15:43,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:15:43,316 INFO L87 Difference]: Start difference. First operand 3321 states and 7924 transitions. Second operand 13 states. [2018-12-02 04:15:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:15:43,730 INFO L93 Difference]: Finished difference Result 5169 states and 12062 transitions. [2018-12-02 04:15:43,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 04:15:43,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-12-02 04:15:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:15:43,733 INFO L225 Difference]: With dead ends: 5169 [2018-12-02 04:15:43,733 INFO L226 Difference]: Without dead ends: 3786 [2018-12-02 04:15:43,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-02 04:15:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-12-02 04:15:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3372. [2018-12-02 04:15:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3372 states. [2018-12-02 04:15:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 7979 transitions. [2018-12-02 04:15:43,754 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 7979 transitions. Word has length 103 [2018-12-02 04:15:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:15:43,755 INFO L480 AbstractCegarLoop]: Abstraction has 3372 states and 7979 transitions. [2018-12-02 04:15:43,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 04:15:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 7979 transitions. [2018-12-02 04:15:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 04:15:43,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:15:43,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:15:43,757 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:15:43,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:15:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1336327482, now seen corresponding path program 2 times [2018-12-02 04:15:43,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:15:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:43,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:15:43,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:15:43,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:15:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:15:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:15:43,806 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:15:43,879 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 04:15:43,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:15:43 BasicIcfg [2018-12-02 04:15:43,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:15:43,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:15:43,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:15:43,881 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:15:43,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:15:20" (3/4) ... [2018-12-02 04:15:43,883 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 04:15:43,960 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bf3e51fa-22a8-4191-8b47-6c80da127af5/bin-2019/utaipan/witness.graphml [2018-12-02 04:15:43,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:15:43,961 INFO L168 Benchmark]: Toolchain (without parser) took 24704.77 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 947.0 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 640.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:15:43,962 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:15:43,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-02 04:15:43,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-02 04:15:43,962 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 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 04:15:43,962 INFO L168 Benchmark]: RCFGBuilder took 393.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2018-12-02 04:15:43,963 INFO L168 Benchmark]: TraceAbstraction took 23843.41 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 525.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:15:43,963 INFO L168 Benchmark]: Witness Printer took 80.01 ms. Allocated memory is still 3.2 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 83.3 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:15:43,964 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.84 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 393.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23843.41 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 525.2 MB. Max. memory is 11.5 GB. * Witness Printer took 80.01 ms. Allocated memory is still 3.2 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 83.3 MB). Peak memory consumption was 83.3 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] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L789] -1 pthread_t t10; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L790] FCALL, FORK -1 pthread_create(&t10, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L791] -1 pthread_t t11; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L792] FCALL, FORK -1 pthread_create(&t11, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0] [L752] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0] [L752] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L753] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L753] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L754] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L755] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L756] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L757] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L758] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L758] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=0] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0] [L767] 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, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=0] [L706] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1] [L716] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=1] [L767] 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) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=1] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [!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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 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 [L770] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 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 [!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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 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 [L774] 0 __unbuffered_cnt = __unbuffered_cnt + 1 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 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) [L717] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 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)) [L718] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L718] 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)) [L719] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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))=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 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)) [L720] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 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)) [L721] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L721] 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)) [L722] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L722] 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)) [L723] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -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) [L799] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] -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 [L801] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] -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 [L805] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 23.7s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9253 SDtfs, 9940 SDslu, 21577 SDs, 0 SdLazy, 7509 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 61 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83128occurred 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: 6.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 136088 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2289 NumberOfCodeBlocks, 2289 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2160 ConstructedInterpolants, 0 QuantifiedInterpolants, 417546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...