./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_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_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/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 bc28bb760373a1c30fb22cb571f76934eae5a007 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-08 17:33:20,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:33:20,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:33:20,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:33:20,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:33:20,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:33:20,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:33:20,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:33:20,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:33:20,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:33:20,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:33:20,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:33:20,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:33:20,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:33:20,920 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:33:20,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:33:20,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:33:20,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:33:20,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:33:20,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:33:20,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:33:20,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:33:20,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:33:20,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:33:20,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:33:20,926 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:33:20,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:33:20,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:33:20,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:33:20,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:33:20,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:33:20,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:33:20,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:33:20,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:33:20,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:33:20,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:33:20,930 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:33:20,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:33:20,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:33:20,937 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:33:20,937 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:33:20,937 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:33:20,937 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:33:20,938 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:33:20,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:33:20,939 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:33:20,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:33:20,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:33:20,940 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:33:20,941 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_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/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 -> bc28bb760373a1c30fb22cb571f76934eae5a007 [2018-12-08 17:33:20,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:33:20,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:33:20,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:33:20,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:33:20,971 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:33:20,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i [2018-12-08 17:33:21,009 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/data/c2b83e2a6/60279b17df7e4a5aa8964ea7504550d1/FLAG6bf591a4f [2018-12-08 17:33:21,441 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:33:21,442 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/sv-benchmarks/c/pthread-wmm/mix011_rmo.opt_false-unreach-call.i [2018-12-08 17:33:21,449 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/data/c2b83e2a6/60279b17df7e4a5aa8964ea7504550d1/FLAG6bf591a4f [2018-12-08 17:33:21,457 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/data/c2b83e2a6/60279b17df7e4a5aa8964ea7504550d1 [2018-12-08 17:33:21,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:33:21,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:33:21,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:33:21,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:33:21,463 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:33:21,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21, skipping insertion in model container [2018-12-08 17:33:21,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:33:21,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:33:21,713 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:33:21,762 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:33:21,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:33:21,842 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:33:21,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21 WrapperNode [2018-12-08 17:33:21,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:33:21,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:33:21,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:33:21,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:33:21,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:33:21,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:33:21,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:33:21,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:33:21,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... [2018-12-08 17:33:21,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:33:21,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:33:21,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:33:21,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:33:21,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/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-08 17:33:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 17:33:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 17:33:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 17:33:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 17:33:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 17:33:21,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 17:33:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 17:33:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 17:33:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 17:33:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 17:33:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 17:33:21,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:33:21,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:33:21,939 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 17:33:22,284 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:33:22,285 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 17:33:22,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:22 BoogieIcfgContainer [2018-12-08 17:33:22,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:33:22,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:33:22,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:33:22,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:33:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:33:21" (1/3) ... [2018-12-08 17:33:22,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4215b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:33:22, skipping insertion in model container [2018-12-08 17:33:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:33:21" (2/3) ... [2018-12-08 17:33:22,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4215b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:33:22, skipping insertion in model container [2018-12-08 17:33:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:22" (3/3) ... [2018-12-08 17:33:22,290 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_rmo.opt_false-unreach-call.i [2018-12-08 17:33:22,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,318 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,318 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,319 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,320 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,321 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,322 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,323 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,324 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,325 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,326 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,327 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,328 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,329 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,330 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,330 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,330 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,330 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,330 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,330 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,331 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,332 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,332 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,332 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,332 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,332 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,333 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,333 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,333 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,333 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,333 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,334 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,335 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,335 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,342 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,343 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,344 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,349 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 17:33:22,356 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 17:33:22,357 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:33:22,362 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 17:33:22,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 17:33:22,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:33:22,385 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:33:22,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:33:22,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:33:22,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:33:22,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:33:22,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:33:22,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:33:22,392 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 189places, 241 transitions [2018-12-08 17:35:54,888 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445146 states. [2018-12-08 17:35:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 445146 states. [2018-12-08 17:35:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 17:35:54,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:35:54,897 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-08 17:35:54,899 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:35:54,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:35:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1446185373, now seen corresponding path program 1 times [2018-12-08 17:35:54,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:35:54,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:35:54,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:35:54,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:35:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:35:55,044 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-08 17:35:55,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:35:55,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:35:55,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:35:55,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:35:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:35:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:35:55,058 INFO L87 Difference]: Start difference. First operand 445146 states. Second operand 4 states. [2018-12-08 17:36:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:04,338 INFO L93 Difference]: Finished difference Result 810626 states and 3886643 transitions. [2018-12-08 17:36:04,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:36:04,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 17:36:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:06,806 INFO L225 Difference]: With dead ends: 810626 [2018-12-08 17:36:06,806 INFO L226 Difference]: Without dead ends: 530976 [2018-12-08 17:36:06,807 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-08 17:36:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530976 states. [2018-12-08 17:36:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530976 to 307956. [2018-12-08 17:36:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307956 states. [2018-12-08 17:36:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307956 states to 307956 states and 1493657 transitions. [2018-12-08 17:36:21,380 INFO L78 Accepts]: Start accepts. Automaton has 307956 states and 1493657 transitions. Word has length 47 [2018-12-08 17:36:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:21,381 INFO L480 AbstractCegarLoop]: Abstraction has 307956 states and 1493657 transitions. [2018-12-08 17:36:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:36:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 307956 states and 1493657 transitions. [2018-12-08 17:36:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:36:21,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:21,391 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] [2018-12-08 17:36:21,391 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:21,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1064613016, now seen corresponding path program 1 times [2018-12-08 17:36:21,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:21,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:21,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:21,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:21,448 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-08 17:36:21,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:21,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:36:21,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:21,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:36:21,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:36:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:36:21,450 INFO L87 Difference]: Start difference. First operand 307956 states and 1493657 transitions. Second operand 4 states. [2018-12-08 17:36:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:26,358 INFO L93 Difference]: Finished difference Result 272410 states and 1287431 transitions. [2018-12-08 17:36:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:36:26,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-08 17:36:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:27,147 INFO L225 Difference]: With dead ends: 272410 [2018-12-08 17:36:27,147 INFO L226 Difference]: Without dead ends: 258310 [2018-12-08 17:36:27,147 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-08 17:36:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258310 states. [2018-12-08 17:36:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258310 to 258310. [2018-12-08 17:36:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258310 states. [2018-12-08 17:36:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258310 states to 258310 states and 1233238 transitions. [2018-12-08 17:36:36,315 INFO L78 Accepts]: Start accepts. Automaton has 258310 states and 1233238 transitions. Word has length 55 [2018-12-08 17:36:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:36,315 INFO L480 AbstractCegarLoop]: Abstraction has 258310 states and 1233238 transitions. [2018-12-08 17:36:36,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:36:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 258310 states and 1233238 transitions. [2018-12-08 17:36:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:36:36,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:36,321 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] [2018-12-08 17:36:36,321 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:36,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1750301674, now seen corresponding path program 1 times [2018-12-08 17:36:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:36,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:36,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:36,366 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-08 17:36:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:36:36,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:36:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:36:36,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:36:36,367 INFO L87 Difference]: Start difference. First operand 258310 states and 1233238 transitions. Second operand 5 states. [2018-12-08 17:36:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:36,622 INFO L93 Difference]: Finished difference Result 61670 states and 253006 transitions. [2018-12-08 17:36:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:36:36,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 17:36:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:36,726 INFO L225 Difference]: With dead ends: 61670 [2018-12-08 17:36:36,726 INFO L226 Difference]: Without dead ends: 49978 [2018-12-08 17:36:36,726 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-08 17:36:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2018-12-08 17:36:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49518. [2018-12-08 17:36:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49518 states. [2018-12-08 17:36:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49518 states to 49518 states and 199528 transitions. [2018-12-08 17:36:37,420 INFO L78 Accepts]: Start accepts. Automaton has 49518 states and 199528 transitions. Word has length 56 [2018-12-08 17:36:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:37,421 INFO L480 AbstractCegarLoop]: Abstraction has 49518 states and 199528 transitions. [2018-12-08 17:36:37,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:36:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 49518 states and 199528 transitions. [2018-12-08 17:36:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:36:37,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:37,423 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] [2018-12-08 17:36:37,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:37,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2065306486, now seen corresponding path program 1 times [2018-12-08 17:36:37,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:37,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:37,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:37,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:36:37,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:37,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:36:37,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:36:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:36:37,476 INFO L87 Difference]: Start difference. First operand 49518 states and 199528 transitions. Second operand 5 states. [2018-12-08 17:36:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:38,054 INFO L93 Difference]: Finished difference Result 100164 states and 398537 transitions. [2018-12-08 17:36:38,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:36:38,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-08 17:36:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:40,097 INFO L225 Difference]: With dead ends: 100164 [2018-12-08 17:36:40,098 INFO L226 Difference]: Without dead ends: 99789 [2018-12-08 17:36:40,098 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-08 17:36:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99789 states. [2018-12-08 17:36:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99789 to 66557. [2018-12-08 17:36:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66557 states. [2018-12-08 17:36:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66557 states to 66557 states and 261584 transitions. [2018-12-08 17:36:41,195 INFO L78 Accepts]: Start accepts. Automaton has 66557 states and 261584 transitions. Word has length 56 [2018-12-08 17:36:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:41,195 INFO L480 AbstractCegarLoop]: Abstraction has 66557 states and 261584 transitions. [2018-12-08 17:36:41,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:36:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 66557 states and 261584 transitions. [2018-12-08 17:36:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:36:41,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:41,199 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] [2018-12-08 17:36:41,200 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:41,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash 397938288, now seen corresponding path program 1 times [2018-12-08 17:36:41,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:41,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:41,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:41,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:41,222 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-08 17:36:41,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:41,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:36:41,222 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:41,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:36:41,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:36:41,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:36:41,223 INFO L87 Difference]: Start difference. First operand 66557 states and 261584 transitions. Second operand 3 states. [2018-12-08 17:36:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:41,873 INFO L93 Difference]: Finished difference Result 122933 states and 477675 transitions. [2018-12-08 17:36:41,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:36:41,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-08 17:36:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:42,118 INFO L225 Difference]: With dead ends: 122933 [2018-12-08 17:36:42,118 INFO L226 Difference]: Without dead ends: 122913 [2018-12-08 17:36:42,119 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-08 17:36:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122913 states. [2018-12-08 17:36:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122913 to 103768. [2018-12-08 17:36:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103768 states. [2018-12-08 17:36:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103768 states to 103768 states and 403446 transitions. [2018-12-08 17:36:44,007 INFO L78 Accepts]: Start accepts. Automaton has 103768 states and 403446 transitions. Word has length 58 [2018-12-08 17:36:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:44,008 INFO L480 AbstractCegarLoop]: Abstraction has 103768 states and 403446 transitions. [2018-12-08 17:36:44,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:36:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 103768 states and 403446 transitions. [2018-12-08 17:36:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 17:36:44,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:44,015 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] [2018-12-08 17:36:44,015 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:44,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash -549306821, now seen corresponding path program 1 times [2018-12-08 17:36:44,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:44,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:44,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:44,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:44,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:44,091 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-08 17:36:44,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:36:44,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:36:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:36:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:36:44,093 INFO L87 Difference]: Start difference. First operand 103768 states and 403446 transitions. Second operand 8 states. [2018-12-08 17:36:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:45,303 INFO L93 Difference]: Finished difference Result 140478 states and 532789 transitions. [2018-12-08 17:36:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:36:45,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-08 17:36:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:45,590 INFO L225 Difference]: With dead ends: 140478 [2018-12-08 17:36:45,590 INFO L226 Difference]: Without dead ends: 140013 [2018-12-08 17:36:45,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:36:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140013 states. [2018-12-08 17:36:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140013 to 105817. [2018-12-08 17:36:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105817 states. [2018-12-08 17:36:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105817 states to 105817 states and 410167 transitions. [2018-12-08 17:36:47,513 INFO L78 Accepts]: Start accepts. Automaton has 105817 states and 410167 transitions. Word has length 62 [2018-12-08 17:36:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:47,513 INFO L480 AbstractCegarLoop]: Abstraction has 105817 states and 410167 transitions. [2018-12-08 17:36:47,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:36:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105817 states and 410167 transitions. [2018-12-08 17:36:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:36:47,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:47,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:47,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:47,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:47,540 INFO L82 PathProgramCache]: Analyzing trace with hash 74113855, now seen corresponding path program 1 times [2018-12-08 17:36:47,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:47,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:47,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:47,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:47,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:47,583 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-08 17:36:47,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:47,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:36:47,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:47,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:36:47,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:36:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:36:47,584 INFO L87 Difference]: Start difference. First operand 105817 states and 410167 transitions. Second operand 4 states. [2018-12-08 17:36:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:48,238 INFO L93 Difference]: Finished difference Result 134671 states and 525470 transitions. [2018-12-08 17:36:48,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:36:48,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-08 17:36:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:48,758 INFO L225 Difference]: With dead ends: 134671 [2018-12-08 17:36:48,758 INFO L226 Difference]: Without dead ends: 134671 [2018-12-08 17:36:48,758 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-08 17:36:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134671 states. [2018-12-08 17:36:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134671 to 122063. [2018-12-08 17:36:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122063 states. [2018-12-08 17:36:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122063 states to 122063 states and 473790 transitions. [2018-12-08 17:36:52,967 INFO L78 Accepts]: Start accepts. Automaton has 122063 states and 473790 transitions. Word has length 73 [2018-12-08 17:36:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:52,967 INFO L480 AbstractCegarLoop]: Abstraction has 122063 states and 473790 transitions. [2018-12-08 17:36:52,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:36:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 122063 states and 473790 transitions. [2018-12-08 17:36:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:36:52,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:52,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:52,998 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:52,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1816924190, now seen corresponding path program 1 times [2018-12-08 17:36:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:53,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:53,057 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-08 17:36:53,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:53,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:36:53,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:53,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:36:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:36:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:36:53,058 INFO L87 Difference]: Start difference. First operand 122063 states and 473790 transitions. Second operand 6 states. [2018-12-08 17:36:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:53,265 INFO L93 Difference]: Finished difference Result 51087 states and 174606 transitions. [2018-12-08 17:36:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:36:53,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-08 17:36:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:53,337 INFO L225 Difference]: With dead ends: 51087 [2018-12-08 17:36:53,337 INFO L226 Difference]: Without dead ends: 44303 [2018-12-08 17:36:53,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:36:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2018-12-08 17:36:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 38118. [2018-12-08 17:36:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38118 states. [2018-12-08 17:36:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38118 states to 38118 states and 128492 transitions. [2018-12-08 17:36:53,834 INFO L78 Accepts]: Start accepts. Automaton has 38118 states and 128492 transitions. Word has length 73 [2018-12-08 17:36:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:53,834 INFO L480 AbstractCegarLoop]: Abstraction has 38118 states and 128492 transitions. [2018-12-08 17:36:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:36:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 38118 states and 128492 transitions. [2018-12-08 17:36:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 17:36:53,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:53,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:53,873 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:53,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2069100692, now seen corresponding path program 1 times [2018-12-08 17:36:53,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:53,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:53,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:53,930 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-08 17:36:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:53,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:36:53,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:53,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:36:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:36:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:36:53,931 INFO L87 Difference]: Start difference. First operand 38118 states and 128492 transitions. Second operand 4 states. [2018-12-08 17:36:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:54,174 INFO L93 Difference]: Finished difference Result 44328 states and 147355 transitions. [2018-12-08 17:36:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:36:54,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-08 17:36:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:54,232 INFO L225 Difference]: With dead ends: 44328 [2018-12-08 17:36:54,232 INFO L226 Difference]: Without dead ends: 44328 [2018-12-08 17:36:54,232 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-08 17:36:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44328 states. [2018-12-08 17:36:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44328 to 41995. [2018-12-08 17:36:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41995 states. [2018-12-08 17:36:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41995 states to 41995 states and 140228 transitions. [2018-12-08 17:36:54,827 INFO L78 Accepts]: Start accepts. Automaton has 41995 states and 140228 transitions. Word has length 108 [2018-12-08 17:36:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:54,827 INFO L480 AbstractCegarLoop]: Abstraction has 41995 states and 140228 transitions. [2018-12-08 17:36:54,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:36:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 41995 states and 140228 transitions. [2018-12-08 17:36:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 17:36:54,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:54,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:54,869 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:54,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash -118800437, now seen corresponding path program 1 times [2018-12-08 17:36:54,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:54,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:54,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:54,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:54,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:54,960 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-08 17:36:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:54,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:36:54,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:54,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:36:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:36:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:36:54,961 INFO L87 Difference]: Start difference. First operand 41995 states and 140228 transitions. Second operand 7 states. [2018-12-08 17:36:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:55,374 INFO L93 Difference]: Finished difference Result 67590 states and 220894 transitions. [2018-12-08 17:36:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:36:55,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-12-08 17:36:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:55,469 INFO L225 Difference]: With dead ends: 67590 [2018-12-08 17:36:55,469 INFO L226 Difference]: Without dead ends: 67160 [2018-12-08 17:36:55,470 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-08 17:36:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67160 states. [2018-12-08 17:36:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67160 to 54765. [2018-12-08 17:36:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54765 states. [2018-12-08 17:36:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54765 states to 54765 states and 180864 transitions. [2018-12-08 17:36:56,239 INFO L78 Accepts]: Start accepts. Automaton has 54765 states and 180864 transitions. Word has length 108 [2018-12-08 17:36:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:56,239 INFO L480 AbstractCegarLoop]: Abstraction has 54765 states and 180864 transitions. [2018-12-08 17:36:56,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:36:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 54765 states and 180864 transitions. [2018-12-08 17:36:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 17:36:56,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:56,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:56,301 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:56,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1749253668, now seen corresponding path program 2 times [2018-12-08 17:36:56,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:56,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:56,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:36:56,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:56,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:56,357 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-08 17:36:56,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:56,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:36:56,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:56,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:36:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:36:56,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:36:56,358 INFO L87 Difference]: Start difference. First operand 54765 states and 180864 transitions. Second operand 5 states. [2018-12-08 17:36:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:56,929 INFO L93 Difference]: Finished difference Result 69402 states and 224858 transitions. [2018-12-08 17:36:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:36:56,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-12-08 17:36:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:57,014 INFO L225 Difference]: With dead ends: 69402 [2018-12-08 17:36:57,014 INFO L226 Difference]: Without dead ends: 69222 [2018-12-08 17:36:57,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-08 17:36:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69222 states. [2018-12-08 17:36:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69222 to 59650. [2018-12-08 17:36:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59650 states. [2018-12-08 17:36:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59650 states to 59650 states and 195622 transitions. [2018-12-08 17:36:57,777 INFO L78 Accepts]: Start accepts. Automaton has 59650 states and 195622 transitions. Word has length 108 [2018-12-08 17:36:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 59650 states and 195622 transitions. [2018-12-08 17:36:57,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:36:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59650 states and 195622 transitions. [2018-12-08 17:36:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 17:36:57,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:57,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:57,842 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:57,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1777335976, now seen corresponding path program 3 times [2018-12-08 17:36:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:57,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:36:57,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:57,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:36:57,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:57,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:36:57,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:57,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:36:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:36:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:36:57,886 INFO L87 Difference]: Start difference. First operand 59650 states and 195622 transitions. Second operand 4 states. [2018-12-08 17:36:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:58,130 INFO L93 Difference]: Finished difference Result 60482 states and 198390 transitions. [2018-12-08 17:36:58,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:36:58,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-08 17:36:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:58,216 INFO L225 Difference]: With dead ends: 60482 [2018-12-08 17:36:58,216 INFO L226 Difference]: Without dead ends: 60482 [2018-12-08 17:36:58,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:36:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60482 states. [2018-12-08 17:36:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60482 to 59906. [2018-12-08 17:36:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59906 states. [2018-12-08 17:36:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59906 states to 59906 states and 196518 transitions. [2018-12-08 17:36:59,009 INFO L78 Accepts]: Start accepts. Automaton has 59906 states and 196518 transitions. Word has length 108 [2018-12-08 17:36:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:36:59,009 INFO L480 AbstractCegarLoop]: Abstraction has 59906 states and 196518 transitions. [2018-12-08 17:36:59,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:36:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 59906 states and 196518 transitions. [2018-12-08 17:36:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 17:36:59,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:36:59,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:36:59,074 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:36:59,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:36:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash 710176857, now seen corresponding path program 1 times [2018-12-08 17:36:59,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:36:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:59,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:36:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:36:59,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:36:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:36:59,153 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-08 17:36:59,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:36:59,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:36:59,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:36:59,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:36:59,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:36:59,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:36:59,154 INFO L87 Difference]: Start difference. First operand 59906 states and 196518 transitions. Second operand 6 states. [2018-12-08 17:36:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:36:59,347 INFO L93 Difference]: Finished difference Result 59714 states and 195382 transitions. [2018-12-08 17:36:59,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:36:59,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-12-08 17:36:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:36:59,431 INFO L225 Difference]: With dead ends: 59714 [2018-12-08 17:36:59,431 INFO L226 Difference]: Without dead ends: 59714 [2018-12-08 17:36:59,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:36:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59714 states. [2018-12-08 17:37:00,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59714 to 55882. [2018-12-08 17:37:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55882 states. [2018-12-08 17:37:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55882 states to 55882 states and 183616 transitions. [2018-12-08 17:37:00,170 INFO L78 Accepts]: Start accepts. Automaton has 55882 states and 183616 transitions. Word has length 108 [2018-12-08 17:37:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:00,170 INFO L480 AbstractCegarLoop]: Abstraction has 55882 states and 183616 transitions. [2018-12-08 17:37:00,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:37:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 55882 states and 183616 transitions. [2018-12-08 17:37:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:00,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:00,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:00,232 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:00,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash 814126514, now seen corresponding path program 1 times [2018-12-08 17:37:00,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:00,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:00,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:00,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:00,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:00,324 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-08 17:37:00,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:00,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:37:00,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:00,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:00,325 INFO L87 Difference]: Start difference. First operand 55882 states and 183616 transitions. Second operand 7 states. [2018-12-08 17:37:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:00,950 INFO L93 Difference]: Finished difference Result 80582 states and 256616 transitions. [2018-12-08 17:37:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:37:00,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-12-08 17:37:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:01,057 INFO L225 Difference]: With dead ends: 80582 [2018-12-08 17:37:01,057 INFO L226 Difference]: Without dead ends: 80582 [2018-12-08 17:37:01,057 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-08 17:37:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80582 states. [2018-12-08 17:37:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80582 to 63477. [2018-12-08 17:37:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63477 states. [2018-12-08 17:37:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63477 states to 63477 states and 204817 transitions. [2018-12-08 17:37:01,944 INFO L78 Accepts]: Start accepts. Automaton has 63477 states and 204817 transitions. Word has length 110 [2018-12-08 17:37:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:01,944 INFO L480 AbstractCegarLoop]: Abstraction has 63477 states and 204817 transitions. [2018-12-08 17:37:01,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 63477 states and 204817 transitions. [2018-12-08 17:37:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:02,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:02,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:02,014 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:02,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1507228211, now seen corresponding path program 1 times [2018-12-08 17:37:02,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:02,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:02,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:02,107 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-08 17:37:02,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:02,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:37:02,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:02,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:37:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:37:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:37:02,109 INFO L87 Difference]: Start difference. First operand 63477 states and 204817 transitions. Second operand 8 states. [2018-12-08 17:37:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:02,595 INFO L93 Difference]: Finished difference Result 72094 states and 230348 transitions. [2018-12-08 17:37:02,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:37:02,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-12-08 17:37:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:02,693 INFO L225 Difference]: With dead ends: 72094 [2018-12-08 17:37:02,693 INFO L226 Difference]: Without dead ends: 72094 [2018-12-08 17:37:02,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:37:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72094 states. [2018-12-08 17:37:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72094 to 66420. [2018-12-08 17:37:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66420 states. [2018-12-08 17:37:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66420 states to 66420 states and 213707 transitions. [2018-12-08 17:37:03,587 INFO L78 Accepts]: Start accepts. Automaton has 66420 states and 213707 transitions. Word has length 110 [2018-12-08 17:37:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:03,587 INFO L480 AbstractCegarLoop]: Abstraction has 66420 states and 213707 transitions. [2018-12-08 17:37:03,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:37:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 66420 states and 213707 transitions. [2018-12-08 17:37:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:03,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:03,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:03,660 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:03,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:03,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1900235404, now seen corresponding path program 1 times [2018-12-08 17:37:03,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:03,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:03,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:03,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:03,695 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-08 17:37:03,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:03,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 17:37:03,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:03,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 17:37:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 17:37:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 17:37:03,696 INFO L87 Difference]: Start difference. First operand 66420 states and 213707 transitions. Second operand 3 states. [2018-12-08 17:37:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:03,940 INFO L93 Difference]: Finished difference Result 81510 states and 261939 transitions. [2018-12-08 17:37:03,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 17:37:03,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-08 17:37:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:04,057 INFO L225 Difference]: With dead ends: 81510 [2018-12-08 17:37:04,057 INFO L226 Difference]: Without dead ends: 81510 [2018-12-08 17:37:04,057 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-08 17:37:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81510 states. [2018-12-08 17:37:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81510 to 81175. [2018-12-08 17:37:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81175 states. [2018-12-08 17:37:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81175 states to 81175 states and 260956 transitions. [2018-12-08 17:37:05,124 INFO L78 Accepts]: Start accepts. Automaton has 81175 states and 260956 transitions. Word has length 110 [2018-12-08 17:37:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:05,124 INFO L480 AbstractCegarLoop]: Abstraction has 81175 states and 260956 transitions. [2018-12-08 17:37:05,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 17:37:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 81175 states and 260956 transitions. [2018-12-08 17:37:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:05,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:05,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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:05,220 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:05,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1688884491, now seen corresponding path program 1 times [2018-12-08 17:37:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:05,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:05,280 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-08 17:37:05,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:05,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:37:05,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:05,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:37:05,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:37:05,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:37:05,281 INFO L87 Difference]: Start difference. First operand 81175 states and 260956 transitions. Second operand 4 states. [2018-12-08 17:37:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:05,814 INFO L93 Difference]: Finished difference Result 105053 states and 340505 transitions. [2018-12-08 17:37:05,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:37:05,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-08 17:37:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:05,992 INFO L225 Difference]: With dead ends: 105053 [2018-12-08 17:37:05,992 INFO L226 Difference]: Without dead ends: 105053 [2018-12-08 17:37:05,992 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-08 17:37:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105053 states. [2018-12-08 17:37:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105053 to 78835. [2018-12-08 17:37:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78835 states. [2018-12-08 17:37:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78835 states to 78835 states and 253524 transitions. [2018-12-08 17:37:07,226 INFO L78 Accepts]: Start accepts. Automaton has 78835 states and 253524 transitions. Word has length 110 [2018-12-08 17:37:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:07,226 INFO L480 AbstractCegarLoop]: Abstraction has 78835 states and 253524 transitions. [2018-12-08 17:37:07,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:37:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 78835 states and 253524 transitions. [2018-12-08 17:37:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:07,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:07,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:07,314 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:07,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1817711028, now seen corresponding path program 1 times [2018-12-08 17:37:07,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:07,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:07,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:07,382 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-08 17:37:07,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:07,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:37:07,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:07,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:37:07,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:37:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:37:07,383 INFO L87 Difference]: Start difference. First operand 78835 states and 253524 transitions. Second operand 6 states. [2018-12-08 17:37:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:07,836 INFO L93 Difference]: Finished difference Result 85275 states and 273116 transitions. [2018-12-08 17:37:07,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:37:07,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-08 17:37:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:07,957 INFO L225 Difference]: With dead ends: 85275 [2018-12-08 17:37:07,957 INFO L226 Difference]: Without dead ends: 85275 [2018-12-08 17:37:07,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85275 states. [2018-12-08 17:37:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85275 to 78815. [2018-12-08 17:37:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78815 states. [2018-12-08 17:37:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78815 states to 78815 states and 253428 transitions. [2018-12-08 17:37:09,166 INFO L78 Accepts]: Start accepts. Automaton has 78815 states and 253428 transitions. Word has length 110 [2018-12-08 17:37:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:09,166 INFO L480 AbstractCegarLoop]: Abstraction has 78815 states and 253428 transitions. [2018-12-08 17:37:09,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:37:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 78815 states and 253428 transitions. [2018-12-08 17:37:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:09,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:09,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:09,249 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:09,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash 304238880, now seen corresponding path program 2 times [2018-12-08 17:37:09,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:09,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:09,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:09,297 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-08 17:37:09,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:09,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:37:09,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:09,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:37:09,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:37:09,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:37:09,298 INFO L87 Difference]: Start difference. First operand 78815 states and 253428 transitions. Second operand 6 states. [2018-12-08 17:37:09,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:09,884 INFO L93 Difference]: Finished difference Result 96508 states and 310129 transitions. [2018-12-08 17:37:09,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:37:09,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-08 17:37:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:10,022 INFO L225 Difference]: With dead ends: 96508 [2018-12-08 17:37:10,023 INFO L226 Difference]: Without dead ends: 96508 [2018-12-08 17:37:10,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:37:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96508 states. [2018-12-08 17:37:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96508 to 79010. [2018-12-08 17:37:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79010 states. [2018-12-08 17:37:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79010 states to 79010 states and 254039 transitions. [2018-12-08 17:37:11,084 INFO L78 Accepts]: Start accepts. Automaton has 79010 states and 254039 transitions. Word has length 110 [2018-12-08 17:37:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:11,084 INFO L480 AbstractCegarLoop]: Abstraction has 79010 states and 254039 transitions. [2018-12-08 17:37:11,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:37:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 79010 states and 254039 transitions. [2018-12-08 17:37:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 17:37:11,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:11,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:11,173 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:11,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1088016928, now seen corresponding path program 3 times [2018-12-08 17:37:11,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:11,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:37:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:11,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:11,379 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-08 17:37:11,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:11,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:37:11,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:11,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:37:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:37:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:37:11,380 INFO L87 Difference]: Start difference. First operand 79010 states and 254039 transitions. Second operand 5 states. [2018-12-08 17:37:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:11,801 INFO L93 Difference]: Finished difference Result 88093 states and 280587 transitions. [2018-12-08 17:37:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:37:11,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-08 17:37:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:11,925 INFO L225 Difference]: With dead ends: 88093 [2018-12-08 17:37:11,925 INFO L226 Difference]: Without dead ends: 88093 [2018-12-08 17:37:11,925 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-08 17:37:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88093 states. [2018-12-08 17:37:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88093 to 82245. [2018-12-08 17:37:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82245 states. [2018-12-08 17:37:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82245 states to 82245 states and 263692 transitions. [2018-12-08 17:37:12,950 INFO L78 Accepts]: Start accepts. Automaton has 82245 states and 263692 transitions. Word has length 110 [2018-12-08 17:37:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:12,951 INFO L480 AbstractCegarLoop]: Abstraction has 82245 states and 263692 transitions. [2018-12-08 17:37:12,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:37:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 82245 states and 263692 transitions. [2018-12-08 17:37:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 17:37:13,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:13,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:13,046 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:13,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash 815485584, now seen corresponding path program 1 times [2018-12-08 17:37:13,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:13,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:37:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:13,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:13,107 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-08 17:37:13,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:13,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:37:13,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:13,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:13,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:13,109 INFO L87 Difference]: Start difference. First operand 82245 states and 263692 transitions. Second operand 7 states. [2018-12-08 17:37:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:13,730 INFO L93 Difference]: Finished difference Result 85880 states and 276035 transitions. [2018-12-08 17:37:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:37:13,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-08 17:37:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:13,847 INFO L225 Difference]: With dead ends: 85880 [2018-12-08 17:37:13,847 INFO L226 Difference]: Without dead ends: 85880 [2018-12-08 17:37:13,847 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-08 17:37:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85880 states. [2018-12-08 17:37:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85880 to 81485. [2018-12-08 17:37:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81485 states. [2018-12-08 17:37:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81485 states to 81485 states and 261504 transitions. [2018-12-08 17:37:14,829 INFO L78 Accepts]: Start accepts. Automaton has 81485 states and 261504 transitions. Word has length 112 [2018-12-08 17:37:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:14,829 INFO L480 AbstractCegarLoop]: Abstraction has 81485 states and 261504 transitions. [2018-12-08 17:37:14,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 81485 states and 261504 transitions. [2018-12-08 17:37:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 17:37:14,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:14,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:14,923 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:14,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1015168269, now seen corresponding path program 1 times [2018-12-08 17:37:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:14,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:14,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:14,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:14,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:15,028 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-08 17:37:15,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:15,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:37:15,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:15,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:37:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:37:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:37:15,028 INFO L87 Difference]: Start difference. First operand 81485 states and 261504 transitions. Second operand 10 states. [2018-12-08 17:37:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:15,923 INFO L93 Difference]: Finished difference Result 119497 states and 382173 transitions. [2018-12-08 17:37:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:37:15,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 112 [2018-12-08 17:37:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:15,980 INFO L225 Difference]: With dead ends: 119497 [2018-12-08 17:37:15,980 INFO L226 Difference]: Without dead ends: 46553 [2018-12-08 17:37:15,981 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-08 17:37:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46553 states. [2018-12-08 17:37:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46553 to 46553. [2018-12-08 17:37:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46553 states. [2018-12-08 17:37:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46553 states to 46553 states and 143112 transitions. [2018-12-08 17:37:16,454 INFO L78 Accepts]: Start accepts. Automaton has 46553 states and 143112 transitions. Word has length 112 [2018-12-08 17:37:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:16,454 INFO L480 AbstractCegarLoop]: Abstraction has 46553 states and 143112 transitions. [2018-12-08 17:37:16,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:37:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 46553 states and 143112 transitions. [2018-12-08 17:37:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 17:37:16,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:16,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:16,496 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:16,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1303226337, now seen corresponding path program 2 times [2018-12-08 17:37:16,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:16,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:16,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:16,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:16,557 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-08 17:37:16,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:16,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:37:16,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:16,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:37:16,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:37:16,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:37:16,557 INFO L87 Difference]: Start difference. First operand 46553 states and 143112 transitions. Second operand 7 states. [2018-12-08 17:37:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:16,953 INFO L93 Difference]: Finished difference Result 60677 states and 187841 transitions. [2018-12-08 17:37:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:37:16,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-08 17:37:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:16,969 INFO L225 Difference]: With dead ends: 60677 [2018-12-08 17:37:16,969 INFO L226 Difference]: Without dead ends: 13639 [2018-12-08 17:37:16,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:37:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13639 states. [2018-12-08 17:37:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13639 to 13637. [2018-12-08 17:37:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13637 states. [2018-12-08 17:37:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13637 states to 13637 states and 43709 transitions. [2018-12-08 17:37:17,104 INFO L78 Accepts]: Start accepts. Automaton has 13637 states and 43709 transitions. Word has length 112 [2018-12-08 17:37:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:17,104 INFO L480 AbstractCegarLoop]: Abstraction has 13637 states and 43709 transitions. [2018-12-08 17:37:17,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:37:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13637 states and 43709 transitions. [2018-12-08 17:37:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 17:37:17,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:17,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:17,117 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:17,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1533742338, now seen corresponding path program 1 times [2018-12-08 17:37:17,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:17,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:37:17,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:17,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:37:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:37:17,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:37:17,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 17:37:17,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:37:17,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:37:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:37:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:37:17,230 INFO L87 Difference]: Start difference. First operand 13637 states and 43709 transitions. Second operand 13 states. [2018-12-08 17:37:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:37:17,707 INFO L93 Difference]: Finished difference Result 23486 states and 73946 transitions. [2018-12-08 17:37:17,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:37:17,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-12-08 17:37:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:37:17,725 INFO L225 Difference]: With dead ends: 23486 [2018-12-08 17:37:17,725 INFO L226 Difference]: Without dead ends: 16872 [2018-12-08 17:37:17,725 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-08 17:37:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16872 states. [2018-12-08 17:37:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16872 to 13968. [2018-12-08 17:37:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13968 states. [2018-12-08 17:37:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13968 states to 13968 states and 44522 transitions. [2018-12-08 17:37:17,878 INFO L78 Accepts]: Start accepts. Automaton has 13968 states and 44522 transitions. Word has length 112 [2018-12-08 17:37:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:37:17,878 INFO L480 AbstractCegarLoop]: Abstraction has 13968 states and 44522 transitions. [2018-12-08 17:37:17,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:37:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 13968 states and 44522 transitions. [2018-12-08 17:37:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 17:37:17,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:37:17,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:37:17,891 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:37:17,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:37:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1576277736, now seen corresponding path program 2 times [2018-12-08 17:37:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:37:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:17,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:37:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:37:17,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:37:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:37:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:37:17,951 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:37:18,068 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 17:37:18,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:37:18 BasicIcfg [2018-12-08 17:37:18,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:37:18,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:37:18,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:37:18,070 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:37:18,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:33:22" (3/4) ... [2018-12-08 17:37:18,073 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:37:18,170 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_431f7a80-5fa5-40fa-afbd-50a2d2bccd65/bin-2019/utaipan/witness.graphml [2018-12-08 17:37:18,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:37:18,171 INFO L168 Benchmark]: Toolchain (without parser) took 236712.25 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 948.1 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,172 INFO L168 Benchmark]: CDTParser took 0.16 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-08 17:37:18,172 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,172 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,172 INFO L168 Benchmark]: Boogie Preprocessor took 20.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,172 INFO L168 Benchmark]: RCFGBuilder took 379.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,173 INFO L168 Benchmark]: TraceAbstraction took 235784.13 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,173 INFO L168 Benchmark]: Witness Printer took 100.43 ms. Allocated memory is still 7.4 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2018-12-08 17:37:18,174 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.16 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 382.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 379.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 235784.13 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.2 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 100.43 ms. Allocated memory is still 7.4 GB. Free memory was 2.7 GB in the beginning and 2.7 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L683] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L684] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L686] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L688] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L690] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L691] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L692] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L693] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L694] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L695] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L696] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L697] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L698] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L699] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L700] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L701] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L702] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L703] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L704] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L705] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L706] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L708] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] -1 pthread_t t298; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] FCALL, FORK -1 pthread_create(&t298, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] -1 pthread_t t299; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK -1 pthread_create(&t299, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 pthread_t t300; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK -1 pthread_create(&t300, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 0 z$w_buff1 = z$w_buff0 [L762] 0 z$w_buff0 = 1 [L763] 0 z$w_buff1_used = z$w_buff0_used [L764] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L767] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L768] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L769] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L770] 0 z$r_buff0_thd3 = (_Bool)1 [L773] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L774] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L775] 0 z$flush_delayed = weak$$choice2 [L776] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z = z$flush_delayed ? z$mem_tmp : z [L786] 0 z$flush_delayed = (_Bool)0 [L789] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 1 a = 1 [L715] 1 x = 1 [L720] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 2 x = 2 [L730] 2 y = 1 [L733] 2 __unbuffered_p1_EAX = y [L736] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L737] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L738] 2 z$flush_delayed = weak$$choice2 [L739] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L793] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L794] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L796] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L799] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L740] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L741] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L742] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L743] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L746] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z = z$flush_delayed ? z$mem_tmp : z [L749] 2 z$flush_delayed = (_Bool)0 [L754] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L826] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L832] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 304 locations, 3 error locations. UNSAFE Result, 235.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 33.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8738 SDtfs, 10627 SDslu, 22130 SDs, 0 SdLazy, 6580 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 64 SyntacticMatches, 27 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445146occurred 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: 46.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 443993 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2350 NumberOfCodeBlocks, 2350 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 491109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...