./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c2c913e175195bf706fadb68174e6f93da37994 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 18:12:13,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:12:13,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:12:13,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:12:13,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:12:13,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:12:13,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:12:13,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:12:13,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:12:13,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:12:13,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:12:13,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:12:13,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:12:13,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:12:13,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:12:13,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:12:13,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:12:13,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:12:13,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:12:13,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:12:13,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:12:13,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:12:13,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:12:13,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:12:13,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:12:13,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:12:13,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:12:13,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:12:13,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:12:13,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:12:13,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:12:13,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:12:13,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:12:13,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:12:13,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:12:13,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:12:13,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:12:13,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:12:13,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:12:13,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:12:13,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:12:13,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:12:13,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:12:13,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:12:13,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:12:13,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:12:13,068 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:12:13,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:12:13,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:12:13,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:12:13,069 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:12:13,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:12:13,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:12:13,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:12:13,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:12:13,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:12:13,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:12:13,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:12:13,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:12:13,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:12:13,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:12:13,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:12:13,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:12:13,071 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:12:13,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer 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 -> Automizer 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 -> 7c2c913e175195bf706fadb68174e6f93da37994 [2019-12-07 18:12:13,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:12:13,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:12:13,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:12:13,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:12:13,181 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:12:13,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i [2019-12-07 18:12:13,219 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/data/b0a6d667b/032b3312972b49cbb98ed1683f079f9d/FLAGd4b7dd072 [2019-12-07 18:12:13,714 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:12:13,715 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/sv-benchmarks/c/pthread-wmm/rfi008_rmo.oepc.i [2019-12-07 18:12:13,724 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/data/b0a6d667b/032b3312972b49cbb98ed1683f079f9d/FLAGd4b7dd072 [2019-12-07 18:12:13,733 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/data/b0a6d667b/032b3312972b49cbb98ed1683f079f9d [2019-12-07 18:12:13,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:12:13,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:12:13,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:12:13,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:12:13,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:12:13,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:12:13" (1/1) ... [2019-12-07 18:12:13,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:13, skipping insertion in model container [2019-12-07 18:12:13,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:12:13" (1/1) ... [2019-12-07 18:12:13,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:12:13,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:12:14,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:12:14,053 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:12:14,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:12:14,160 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:12:14,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14 WrapperNode [2019-12-07 18:12:14,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:12:14,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:12:14,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:12:14,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:12:14,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:12:14,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:12:14,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:12:14,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:12:14,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... [2019-12-07 18:12:14,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:12:14,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:12:14,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:12:14,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:12:14,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/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 [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:12:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:12:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:12:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:12:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:12:14,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:12:14,277 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:12:14,668 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:12:14,668 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:12:14,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:12:14 BoogieIcfgContainer [2019-12-07 18:12:14,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:12:14,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:12:14,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:12:14,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:12:14,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:12:13" (1/3) ... [2019-12-07 18:12:14,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0dfc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:12:14, skipping insertion in model container [2019-12-07 18:12:14,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:12:14" (2/3) ... [2019-12-07 18:12:14,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0dfc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:12:14, skipping insertion in model container [2019-12-07 18:12:14,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:12:14" (3/3) ... [2019-12-07 18:12:14,674 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.oepc.i [2019-12-07 18:12:14,680 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:12:14,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:12:14,685 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:12:14,685 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:12:14,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:12:14,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:12:14,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:12:14,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:12:14,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:12:14,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:12:14,772 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:12:14,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:12:14,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:12:14,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:12:14,782 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 18:12:14,784 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 18:12:14,859 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 18:12:14,860 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:12:14,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 18:12:14,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 18:12:14,933 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 18:12:14,933 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:12:14,942 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 18:12:14,967 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 18:12:14,968 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:12:18,186 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 18:12:18,356 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 18:12:18,449 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 18:12:18,450 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 18:12:18,452 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 18:12:20,023 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 18:12:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 18:12:20,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:12:20,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:20,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:12:20,029 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 18:12:20,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:20,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758952858] [2019-12-07 18:12:20,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:20,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758952858] [2019-12-07 18:12:20,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:20,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:12:20,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262058030] [2019-12-07 18:12:20,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:20,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:20,219 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 18:12:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:20,531 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 18:12:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:20,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:12:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:20,682 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 18:12:20,682 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 18:12:20,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 18:12:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 18:12:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 18:12:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 18:12:21,701 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 18:12:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:21,702 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 18:12:21,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 18:12:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:12:21,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:21,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:21,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-07 18:12:21,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:21,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357807041] [2019-12-07 18:12:21,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:21,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357807041] [2019-12-07 18:12:21,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:21,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:12:21,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375251523] [2019-12-07 18:12:21,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:21,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:21,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:21,767 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 18:12:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:22,168 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 18:12:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:12:22,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:12:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:22,272 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 18:12:22,272 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 18:12:22,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 18:12:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 18:12:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 18:12:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 18:12:23,505 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 18:12:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:23,505 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 18:12:23,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 18:12:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:12:23,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:23,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:23,510 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:23,510 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 18:12:23,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:23,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823739023] [2019-12-07 18:12:23,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:23,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823739023] [2019-12-07 18:12:23,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:23,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:12:23,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206489952] [2019-12-07 18:12:23,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:23,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:23,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:23,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:23,555 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 18:12:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:23,873 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 18:12:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:12:23,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:12:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:23,989 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 18:12:23,989 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 18:12:23,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 18:12:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 18:12:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 18:12:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 18:12:25,165 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 18:12:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:25,166 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 18:12:25,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 18:12:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:12:25,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:25,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:25,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-07 18:12:25,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:25,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129938341] [2019-12-07 18:12:25,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:25,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129938341] [2019-12-07 18:12:25,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:25,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:12:25,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022699387] [2019-12-07 18:12:25,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:25,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:25,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:25,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:25,195 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 18:12:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:25,474 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 18:12:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:25,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 18:12:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:25,612 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 18:12:25,612 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 18:12:25,612 INFO L630 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 [2019-12-07 18:12:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 18:12:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 18:12:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 18:12:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 18:12:27,459 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 18:12:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:27,459 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 18:12:27,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 18:12:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:12:27,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:27,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:27,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash 965979864, now seen corresponding path program 1 times [2019-12-07 18:12:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:27,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133028014] [2019-12-07 18:12:27,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:27,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133028014] [2019-12-07 18:12:27,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:27,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:12:27,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709974837] [2019-12-07 18:12:27,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:27,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:27,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:27,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:27,519 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 18:12:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:27,757 INFO L93 Difference]: Finished difference Result 74600 states and 244461 transitions. [2019-12-07 18:12:27,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:27,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:12:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:27,881 INFO L225 Difference]: With dead ends: 74600 [2019-12-07 18:12:27,881 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 18:12:27,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 18:12:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74508. [2019-12-07 18:12:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74508 states. [2019-12-07 18:12:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74508 states to 74508 states and 244321 transitions. [2019-12-07 18:12:30,329 INFO L78 Accepts]: Start accepts. Automaton has 74508 states and 244321 transitions. Word has length 16 [2019-12-07 18:12:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:30,330 INFO L462 AbstractCegarLoop]: Abstraction has 74508 states and 244321 transitions. [2019-12-07 18:12:30,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 74508 states and 244321 transitions. [2019-12-07 18:12:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:12:30,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:30,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:30,334 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash -119401417, now seen corresponding path program 1 times [2019-12-07 18:12:30,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:30,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785891381] [2019-12-07 18:12:30,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:30,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785891381] [2019-12-07 18:12:30,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:30,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:12:30,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086423958] [2019-12-07 18:12:30,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:30,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:30,370 INFO L87 Difference]: Start difference. First operand 74508 states and 244321 transitions. Second operand 3 states. [2019-12-07 18:12:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:30,587 INFO L93 Difference]: Finished difference Result 70111 states and 229603 transitions. [2019-12-07 18:12:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:30,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 18:12:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:30,706 INFO L225 Difference]: With dead ends: 70111 [2019-12-07 18:12:30,706 INFO L226 Difference]: Without dead ends: 70111 [2019-12-07 18:12:30,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70111 states. [2019-12-07 18:12:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70111 to 70111. [2019-12-07 18:12:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70111 states. [2019-12-07 18:12:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70111 states to 70111 states and 229603 transitions. [2019-12-07 18:12:32,340 INFO L78 Accepts]: Start accepts. Automaton has 70111 states and 229603 transitions. Word has length 17 [2019-12-07 18:12:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:32,341 INFO L462 AbstractCegarLoop]: Abstraction has 70111 states and 229603 transitions. [2019-12-07 18:12:32,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 70111 states and 229603 transitions. [2019-12-07 18:12:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:12:32,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:32,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:32,346 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-07 18:12:32,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:32,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635150542] [2019-12-07 18:12:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:32,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635150542] [2019-12-07 18:12:32,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:32,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:12:32,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185003318] [2019-12-07 18:12:32,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:32,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:32,386 INFO L87 Difference]: Start difference. First operand 70111 states and 229603 transitions. Second operand 4 states. [2019-12-07 18:12:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:32,808 INFO L93 Difference]: Finished difference Result 85638 states and 277753 transitions. [2019-12-07 18:12:32,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:12:32,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:12:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:32,946 INFO L225 Difference]: With dead ends: 85638 [2019-12-07 18:12:32,946 INFO L226 Difference]: Without dead ends: 85638 [2019-12-07 18:12:32,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85638 states. [2019-12-07 18:12:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85638 to 70760. [2019-12-07 18:12:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70760 states. [2019-12-07 18:12:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70760 states to 70760 states and 231729 transitions. [2019-12-07 18:12:34,776 INFO L78 Accepts]: Start accepts. Automaton has 70760 states and 231729 transitions. Word has length 17 [2019-12-07 18:12:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:34,777 INFO L462 AbstractCegarLoop]: Abstraction has 70760 states and 231729 transitions. [2019-12-07 18:12:34,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 70760 states and 231729 transitions. [2019-12-07 18:12:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:12:34,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:34,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:12:34,785 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2046192734, now seen corresponding path program 1 times [2019-12-07 18:12:34,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:34,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439091303] [2019-12-07 18:12:34,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:34,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439091303] [2019-12-07 18:12:34,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:34,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:12:34,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601918829] [2019-12-07 18:12:34,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:34,809 INFO L87 Difference]: Start difference. First operand 70760 states and 231729 transitions. Second operand 3 states. [2019-12-07 18:12:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:34,828 INFO L93 Difference]: Finished difference Result 6599 states and 15392 transitions. [2019-12-07 18:12:34,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:34,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:12:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:34,834 INFO L225 Difference]: With dead ends: 6599 [2019-12-07 18:12:34,834 INFO L226 Difference]: Without dead ends: 6599 [2019-12-07 18:12:34,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2019-12-07 18:12:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6523. [2019-12-07 18:12:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6523 states. [2019-12-07 18:12:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 15240 transitions. [2019-12-07 18:12:34,899 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 15240 transitions. Word has length 20 [2019-12-07 18:12:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:34,899 INFO L462 AbstractCegarLoop]: Abstraction has 6523 states and 15240 transitions. [2019-12-07 18:12:34,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 15240 transitions. [2019-12-07 18:12:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:12:34,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:34,902 INFO L410 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] [2019-12-07 18:12:34,902 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-07 18:12:34,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:34,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831605045] [2019-12-07 18:12:34,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:34,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831605045] [2019-12-07 18:12:34,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:34,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:12:34,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997163322] [2019-12-07 18:12:34,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:12:34,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:12:34,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:34,940 INFO L87 Difference]: Start difference. First operand 6523 states and 15240 transitions. Second operand 5 states. [2019-12-07 18:12:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:35,204 INFO L93 Difference]: Finished difference Result 8820 states and 20125 transitions. [2019-12-07 18:12:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:12:35,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:12:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:35,211 INFO L225 Difference]: With dead ends: 8820 [2019-12-07 18:12:35,211 INFO L226 Difference]: Without dead ends: 8820 [2019-12-07 18:12:35,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:12:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2019-12-07 18:12:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 8383. [2019-12-07 18:12:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8383 states. [2019-12-07 18:12:35,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 19259 transitions. [2019-12-07 18:12:35,297 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 19259 transitions. Word has length 27 [2019-12-07 18:12:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:35,297 INFO L462 AbstractCegarLoop]: Abstraction has 8383 states and 19259 transitions. [2019-12-07 18:12:35,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:12:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 19259 transitions. [2019-12-07 18:12:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:12:35,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:35,301 INFO L410 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] [2019-12-07 18:12:35,301 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-07 18:12:35,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:35,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700232336] [2019-12-07 18:12:35,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:35,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700232336] [2019-12-07 18:12:35,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:35,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:12:35,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498494221] [2019-12-07 18:12:35,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:35,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:35,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:35,323 INFO L87 Difference]: Start difference. First operand 8383 states and 19259 transitions. Second operand 3 states. [2019-12-07 18:12:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:35,375 INFO L93 Difference]: Finished difference Result 9518 states and 20716 transitions. [2019-12-07 18:12:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:35,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 18:12:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:35,383 INFO L225 Difference]: With dead ends: 9518 [2019-12-07 18:12:35,383 INFO L226 Difference]: Without dead ends: 9518 [2019-12-07 18:12:35,383 INFO L630 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 [2019-12-07 18:12:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9518 states. [2019-12-07 18:12:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9518 to 8380. [2019-12-07 18:12:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8380 states. [2019-12-07 18:12:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8380 states to 8380 states and 18372 transitions. [2019-12-07 18:12:35,468 INFO L78 Accepts]: Start accepts. Automaton has 8380 states and 18372 transitions. Word has length 30 [2019-12-07 18:12:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:35,468 INFO L462 AbstractCegarLoop]: Abstraction has 8380 states and 18372 transitions. [2019-12-07 18:12:35,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8380 states and 18372 transitions. [2019-12-07 18:12:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:12:35,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:35,473 INFO L410 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] [2019-12-07 18:12:35,473 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-07 18:12:35,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:35,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976699764] [2019-12-07 18:12:35,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:35,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976699764] [2019-12-07 18:12:35,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:35,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:12:35,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628857075] [2019-12-07 18:12:35,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:12:35,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:12:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:35,510 INFO L87 Difference]: Start difference. First operand 8380 states and 18372 transitions. Second operand 5 states. [2019-12-07 18:12:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:35,759 INFO L93 Difference]: Finished difference Result 9477 states and 20541 transitions. [2019-12-07 18:12:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:12:35,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 18:12:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:35,766 INFO L225 Difference]: With dead ends: 9477 [2019-12-07 18:12:35,766 INFO L226 Difference]: Without dead ends: 9477 [2019-12-07 18:12:35,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:12:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9477 states. [2019-12-07 18:12:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9477 to 7498. [2019-12-07 18:12:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-07 18:12:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 16585 transitions. [2019-12-07 18:12:35,840 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 16585 transitions. Word has length 33 [2019-12-07 18:12:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:35,840 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 16585 transitions. [2019-12-07 18:12:35,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:12:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 16585 transitions. [2019-12-07 18:12:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:12:35,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:35,846 INFO L410 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] [2019-12-07 18:12:35,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-07 18:12:35,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:35,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130419727] [2019-12-07 18:12:35,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:35,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130419727] [2019-12-07 18:12:35,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:35,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:12:35,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102452869] [2019-12-07 18:12:35,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:12:35,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:35,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:12:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:12:35,898 INFO L87 Difference]: Start difference. First operand 7498 states and 16585 transitions. Second operand 6 states. [2019-12-07 18:12:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:36,251 INFO L93 Difference]: Finished difference Result 10029 states and 21581 transitions. [2019-12-07 18:12:36,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:12:36,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 18:12:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:36,258 INFO L225 Difference]: With dead ends: 10029 [2019-12-07 18:12:36,258 INFO L226 Difference]: Without dead ends: 10028 [2019-12-07 18:12:36,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:12:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10028 states. [2019-12-07 18:12:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10028 to 9219. [2019-12-07 18:12:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9219 states. [2019-12-07 18:12:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9219 states to 9219 states and 20043 transitions. [2019-12-07 18:12:36,341 INFO L78 Accepts]: Start accepts. Automaton has 9219 states and 20043 transitions. Word has length 39 [2019-12-07 18:12:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:36,342 INFO L462 AbstractCegarLoop]: Abstraction has 9219 states and 20043 transitions. [2019-12-07 18:12:36,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:12:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9219 states and 20043 transitions. [2019-12-07 18:12:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:12:36,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:36,348 INFO L410 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] [2019-12-07 18:12:36,348 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:36,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1234492719, now seen corresponding path program 1 times [2019-12-07 18:12:36,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:36,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852850907] [2019-12-07 18:12:36,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:36,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852850907] [2019-12-07 18:12:36,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:36,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:12:36,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608053434] [2019-12-07 18:12:36,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:12:36,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:36,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:12:36,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:36,422 INFO L87 Difference]: Start difference. First operand 9219 states and 20043 transitions. Second operand 5 states. [2019-12-07 18:12:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:36,785 INFO L93 Difference]: Finished difference Result 10615 states and 22877 transitions. [2019-12-07 18:12:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:12:36,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 18:12:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:36,793 INFO L225 Difference]: With dead ends: 10615 [2019-12-07 18:12:36,793 INFO L226 Difference]: Without dead ends: 10615 [2019-12-07 18:12:36,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:12:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10615 states. [2019-12-07 18:12:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10615 to 10209. [2019-12-07 18:12:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10209 states. [2019-12-07 18:12:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10209 states to 10209 states and 22083 transitions. [2019-12-07 18:12:36,892 INFO L78 Accepts]: Start accepts. Automaton has 10209 states and 22083 transitions. Word has length 41 [2019-12-07 18:12:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:36,893 INFO L462 AbstractCegarLoop]: Abstraction has 10209 states and 22083 transitions. [2019-12-07 18:12:36,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:12:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 10209 states and 22083 transitions. [2019-12-07 18:12:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:12:36,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:36,901 INFO L410 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] [2019-12-07 18:12:36,901 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 27659275, now seen corresponding path program 1 times [2019-12-07 18:12:36,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:36,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325830934] [2019-12-07 18:12:36,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:36,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325830934] [2019-12-07 18:12:36,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:36,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:12:36,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130874581] [2019-12-07 18:12:36,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:36,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:36,961 INFO L87 Difference]: Start difference. First operand 10209 states and 22083 transitions. Second operand 4 states. [2019-12-07 18:12:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:36,997 INFO L93 Difference]: Finished difference Result 10208 states and 22081 transitions. [2019-12-07 18:12:36,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:12:36,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 18:12:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:37,004 INFO L225 Difference]: With dead ends: 10208 [2019-12-07 18:12:37,004 INFO L226 Difference]: Without dead ends: 10208 [2019-12-07 18:12:37,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10208 states. [2019-12-07 18:12:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10208 to 10208. [2019-12-07 18:12:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10208 states. [2019-12-07 18:12:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10208 states to 10208 states and 22081 transitions. [2019-12-07 18:12:37,094 INFO L78 Accepts]: Start accepts. Automaton has 10208 states and 22081 transitions. Word has length 42 [2019-12-07 18:12:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:37,094 INFO L462 AbstractCegarLoop]: Abstraction has 10208 states and 22081 transitions. [2019-12-07 18:12:37,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10208 states and 22081 transitions. [2019-12-07 18:12:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 18:12:37,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:37,102 INFO L410 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] [2019-12-07 18:12:37,103 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash 857431396, now seen corresponding path program 1 times [2019-12-07 18:12:37,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:37,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267170037] [2019-12-07 18:12:37,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:37,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267170037] [2019-12-07 18:12:37,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:37,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:12:37,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954269110] [2019-12-07 18:12:37,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:12:37,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:12:37,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:12:37,169 INFO L87 Difference]: Start difference. First operand 10208 states and 22081 transitions. Second operand 6 states. [2019-12-07 18:12:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:37,276 INFO L93 Difference]: Finished difference Result 14830 states and 32211 transitions. [2019-12-07 18:12:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:12:37,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 18:12:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:37,284 INFO L225 Difference]: With dead ends: 14830 [2019-12-07 18:12:37,284 INFO L226 Difference]: Without dead ends: 11832 [2019-12-07 18:12:37,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:12:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2019-12-07 18:12:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 11832. [2019-12-07 18:12:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11832 states. [2019-12-07 18:12:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11832 states to 11832 states and 25734 transitions. [2019-12-07 18:12:37,391 INFO L78 Accepts]: Start accepts. Automaton has 11832 states and 25734 transitions. Word has length 43 [2019-12-07 18:12:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:37,391 INFO L462 AbstractCegarLoop]: Abstraction has 11832 states and 25734 transitions. [2019-12-07 18:12:37,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:12:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11832 states and 25734 transitions. [2019-12-07 18:12:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 18:12:37,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:37,402 INFO L410 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] [2019-12-07 18:12:37,402 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 520873357, now seen corresponding path program 1 times [2019-12-07 18:12:37,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:37,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38752081] [2019-12-07 18:12:37,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:37,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38752081] [2019-12-07 18:12:37,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:37,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:12:37,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753848520] [2019-12-07 18:12:37,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:37,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:37,453 INFO L87 Difference]: Start difference. First operand 11832 states and 25734 transitions. Second operand 4 states. [2019-12-07 18:12:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:37,482 INFO L93 Difference]: Finished difference Result 8697 states and 18696 transitions. [2019-12-07 18:12:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:12:37,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 18:12:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:37,491 INFO L225 Difference]: With dead ends: 8697 [2019-12-07 18:12:37,491 INFO L226 Difference]: Without dead ends: 8391 [2019-12-07 18:12:37,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-07 18:12:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 6984. [2019-12-07 18:12:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6984 states. [2019-12-07 18:12:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 15354 transitions. [2019-12-07 18:12:37,561 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 15354 transitions. Word has length 44 [2019-12-07 18:12:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:37,561 INFO L462 AbstractCegarLoop]: Abstraction has 6984 states and 15354 transitions. [2019-12-07 18:12:37,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 15354 transitions. [2019-12-07 18:12:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 18:12:37,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:37,569 INFO L410 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] [2019-12-07 18:12:37,569 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -383030595, now seen corresponding path program 1 times [2019-12-07 18:12:37,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:37,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543662616] [2019-12-07 18:12:37,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:37,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543662616] [2019-12-07 18:12:37,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:37,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:12:37,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558924248] [2019-12-07 18:12:37,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:12:37,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:12:37,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:12:37,671 INFO L87 Difference]: Start difference. First operand 6984 states and 15354 transitions. Second operand 8 states. [2019-12-07 18:12:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:38,075 INFO L93 Difference]: Finished difference Result 12735 states and 27615 transitions. [2019-12-07 18:12:38,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:12:38,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-07 18:12:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:38,083 INFO L225 Difference]: With dead ends: 12735 [2019-12-07 18:12:38,083 INFO L226 Difference]: Without dead ends: 11498 [2019-12-07 18:12:38,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:12:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11498 states. [2019-12-07 18:12:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11498 to 8388. [2019-12-07 18:12:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8388 states. [2019-12-07 18:12:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8388 states to 8388 states and 18672 transitions. [2019-12-07 18:12:38,179 INFO L78 Accepts]: Start accepts. Automaton has 8388 states and 18672 transitions. Word has length 68 [2019-12-07 18:12:38,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:38,179 INFO L462 AbstractCegarLoop]: Abstraction has 8388 states and 18672 transitions. [2019-12-07 18:12:38,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:12:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 8388 states and 18672 transitions. [2019-12-07 18:12:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 18:12:38,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:38,185 INFO L410 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] [2019-12-07 18:12:38,186 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1183485973, now seen corresponding path program 2 times [2019-12-07 18:12:38,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:38,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430400218] [2019-12-07 18:12:38,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:38,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430400218] [2019-12-07 18:12:38,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:38,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:12:38,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689646266] [2019-12-07 18:12:38,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:12:38,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:12:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:38,227 INFO L87 Difference]: Start difference. First operand 8388 states and 18672 transitions. Second operand 3 states. [2019-12-07 18:12:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:38,253 INFO L93 Difference]: Finished difference Result 8388 states and 18671 transitions. [2019-12-07 18:12:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:12:38,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 18:12:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:38,260 INFO L225 Difference]: With dead ends: 8388 [2019-12-07 18:12:38,260 INFO L226 Difference]: Without dead ends: 8388 [2019-12-07 18:12:38,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:12:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8388 states. [2019-12-07 18:12:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8388 to 8155. [2019-12-07 18:12:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8155 states. [2019-12-07 18:12:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8155 states to 8155 states and 18243 transitions. [2019-12-07 18:12:38,346 INFO L78 Accepts]: Start accepts. Automaton has 8155 states and 18243 transitions. Word has length 68 [2019-12-07 18:12:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:38,346 INFO L462 AbstractCegarLoop]: Abstraction has 8155 states and 18243 transitions. [2019-12-07 18:12:38,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:12:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 8155 states and 18243 transitions. [2019-12-07 18:12:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:12:38,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:38,353 INFO L410 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] [2019-12-07 18:12:38,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1553549851, now seen corresponding path program 1 times [2019-12-07 18:12:38,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:38,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554457449] [2019-12-07 18:12:38,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:38,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554457449] [2019-12-07 18:12:38,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:38,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:12:38,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21743616] [2019-12-07 18:12:38,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:38,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:38,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:38,411 INFO L87 Difference]: Start difference. First operand 8155 states and 18243 transitions. Second operand 4 states. [2019-12-07 18:12:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:38,567 INFO L93 Difference]: Finished difference Result 7567 states and 16598 transitions. [2019-12-07 18:12:38,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:12:38,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 18:12:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:38,573 INFO L225 Difference]: With dead ends: 7567 [2019-12-07 18:12:38,573 INFO L226 Difference]: Without dead ends: 7567 [2019-12-07 18:12:38,573 INFO L630 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 [2019-12-07 18:12:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2019-12-07 18:12:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 7318. [2019-12-07 18:12:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7318 states. [2019-12-07 18:12:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 16076 transitions. [2019-12-07 18:12:38,637 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 16076 transitions. Word has length 69 [2019-12-07 18:12:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:38,637 INFO L462 AbstractCegarLoop]: Abstraction has 7318 states and 16076 transitions. [2019-12-07 18:12:38,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 16076 transitions. [2019-12-07 18:12:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:12:38,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:38,642 INFO L410 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] [2019-12-07 18:12:38,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2143163095, now seen corresponding path program 2 times [2019-12-07 18:12:38,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:38,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394589867] [2019-12-07 18:12:38,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394589867] [2019-12-07 18:12:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:38,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:12:38,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117692717] [2019-12-07 18:12:38,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:12:38,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:12:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:12:38,690 INFO L87 Difference]: Start difference. First operand 7318 states and 16076 transitions. Second operand 4 states. [2019-12-07 18:12:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:38,713 INFO L93 Difference]: Finished difference Result 8377 states and 18273 transitions. [2019-12-07 18:12:38,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:12:38,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 18:12:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:38,714 INFO L225 Difference]: With dead ends: 8377 [2019-12-07 18:12:38,714 INFO L226 Difference]: Without dead ends: 1248 [2019-12-07 18:12:38,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:38,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-07 18:12:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2019-12-07 18:12:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-12-07 18:12:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2538 transitions. [2019-12-07 18:12:38,724 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 2538 transitions. Word has length 69 [2019-12-07 18:12:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:38,724 INFO L462 AbstractCegarLoop]: Abstraction has 1248 states and 2538 transitions. [2019-12-07 18:12:38,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:12:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 2538 transitions. [2019-12-07 18:12:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:12:38,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:38,726 INFO L410 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] [2019-12-07 18:12:38,726 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash -929833754, now seen corresponding path program 1 times [2019-12-07 18:12:38,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:38,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496164272] [2019-12-07 18:12:38,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:38,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496164272] [2019-12-07 18:12:38,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:38,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:12:38,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226055871] [2019-12-07 18:12:38,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:12:38,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:12:38,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:12:38,959 INFO L87 Difference]: Start difference. First operand 1248 states and 2538 transitions. Second operand 14 states. [2019-12-07 18:12:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:39,439 INFO L93 Difference]: Finished difference Result 2032 states and 4083 transitions. [2019-12-07 18:12:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:12:39,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-12-07 18:12:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:39,440 INFO L225 Difference]: With dead ends: 2032 [2019-12-07 18:12:39,440 INFO L226 Difference]: Without dead ends: 1464 [2019-12-07 18:12:39,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:12:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-12-07 18:12:39,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1270. [2019-12-07 18:12:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-12-07 18:12:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2575 transitions. [2019-12-07 18:12:39,450 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2575 transitions. Word has length 70 [2019-12-07 18:12:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:39,450 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 2575 transitions. [2019-12-07 18:12:39,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:12:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2575 transitions. [2019-12-07 18:12:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:12:39,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:39,451 INFO L410 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] [2019-12-07 18:12:39,451 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:39,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1220286072, now seen corresponding path program 2 times [2019-12-07 18:12:39,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:39,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801856957] [2019-12-07 18:12:39,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:39,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801856957] [2019-12-07 18:12:39,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:39,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:12:39,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358502751] [2019-12-07 18:12:39,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:12:39,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:12:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:12:39,609 INFO L87 Difference]: Start difference. First operand 1270 states and 2575 transitions. Second operand 10 states. [2019-12-07 18:12:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:40,007 INFO L93 Difference]: Finished difference Result 1913 states and 3761 transitions. [2019-12-07 18:12:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:12:40,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-07 18:12:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:40,008 INFO L225 Difference]: With dead ends: 1913 [2019-12-07 18:12:40,009 INFO L226 Difference]: Without dead ends: 1913 [2019-12-07 18:12:40,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:12:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-12-07 18:12:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1281. [2019-12-07 18:12:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-12-07 18:12:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 2574 transitions. [2019-12-07 18:12:40,019 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 2574 transitions. Word has length 70 [2019-12-07 18:12:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:40,020 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 2574 transitions. [2019-12-07 18:12:40,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:12:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2574 transitions. [2019-12-07 18:12:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:12:40,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:40,021 INFO L410 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] [2019-12-07 18:12:40,021 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1670334514, now seen corresponding path program 3 times [2019-12-07 18:12:40,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:40,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396949585] [2019-12-07 18:12:40,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:12:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:12:40,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396949585] [2019-12-07 18:12:40,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:12:40,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:12:40,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24362772] [2019-12-07 18:12:40,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:12:40,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:12:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:12:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:12:40,085 INFO L87 Difference]: Start difference. First operand 1281 states and 2574 transitions. Second operand 5 states. [2019-12-07 18:12:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:12:40,148 INFO L93 Difference]: Finished difference Result 1428 states and 2864 transitions. [2019-12-07 18:12:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:12:40,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 18:12:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:12:40,149 INFO L225 Difference]: With dead ends: 1428 [2019-12-07 18:12:40,149 INFO L226 Difference]: Without dead ends: 1428 [2019-12-07 18:12:40,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:12:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-07 18:12:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1217. [2019-12-07 18:12:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-07 18:12:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 2453 transitions. [2019-12-07 18:12:40,159 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 2453 transitions. Word has length 70 [2019-12-07 18:12:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:12:40,159 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 2453 transitions. [2019-12-07 18:12:40,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:12:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 2453 transitions. [2019-12-07 18:12:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 18:12:40,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:12:40,160 INFO L410 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] [2019-12-07 18:12:40,160 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:12:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:12:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 1 times [2019-12-07 18:12:40,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:12:40,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374522490] [2019-12-07 18:12:40,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:12:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:12:40,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:12:40,238 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:12:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51|) |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51| 1)) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1729~0.base_51|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1729~0.base=|v_ULTIMATE.start_main_~#t1729~0.base_51|, ~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_18|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t1729~0.offset=|v_ULTIMATE.start_main_~#t1729~0.offset_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1729~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1730~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1730~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1729~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 18:12:40,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1730~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1730~0.base_11|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11|) |v_ULTIMATE.start_main_~#t1730~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1730~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1730~0.offset, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 18:12:40,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x~0_In1097866384 ~x$mem_tmp~0_Out1097866384) (= ~x$r_buff1_thd0~0_Out1097866384 ~x$r_buff0_thd0~0_In1097866384) (= ~x$flush_delayed~0_Out1097866384 ~weak$$choice2~0_Out1097866384) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384)) (= |P0Thread1of1ForFork1_#t~nondet4_In1097866384| ~weak$$choice2~0_Out1097866384) (= 1 ~x$r_buff0_thd1~0_Out1097866384) (= ~x$r_buff1_thd2~0_Out1097866384 ~x$r_buff0_thd2~0_In1097866384) (= |P0Thread1of1ForFork1_#t~nondet3_In1097866384| ~weak$$choice0~0_Out1097866384) (= ~x$r_buff1_thd1~0_Out1097866384 ~x$r_buff0_thd1~0_In1097866384)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1097866384|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1097866384|, ~x~0=~x~0_In1097866384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1097866384, ~x$flush_delayed~0=~x$flush_delayed~0_Out1097866384, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1097866384, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1097866384, ~x$mem_tmp~0=~x$mem_tmp~0_Out1097866384, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1097866384, ~weak$$choice0~0=~weak$$choice0~0_Out1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1097866384|, ~weak$$choice2~0=~weak$$choice2~0_Out1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1097866384|, ~x~0=~x~0_In1097866384} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 18:12:40,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In607956245 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out607956245| |P0Thread1of1ForFork1_#t~ite5_Out607956245|)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In607956245 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out607956245| ~x$w_buff1~0_In607956245) .cse2) (and (not .cse0) (= ~x$w_buff0~0_In607956245 |P0Thread1of1ForFork1_#t~ite5_Out607956245|) .cse2 (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In607956245, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} OutVars{~x$w_buff0~0=~x$w_buff0~0_In607956245, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out607956245|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out607956245|, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:12:40,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 18:12:40,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2096518665 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out2096518665| ~x$mem_tmp~0_In2096518665)) (and (= ~x~0_In2096518665 |P0Thread1of1ForFork1_#t~ite25_Out2096518665|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out2096518665|, ~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:12:40,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1955837248 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x~0_In-1955837248) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x$mem_tmp~0_In-1955837248)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1955837248|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:12:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-109423356 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-109423356 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-109423356 |P1Thread1of1ForFork0_#t~ite55_Out-109423356|)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out-109423356| ~x$w_buff1~0_In-109423356) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, ~x~0=~x~0_In-109423356} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-109423356|, ~x~0=~x~0_In-109423356} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 18:12:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 18:12:40,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1128322024 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1128322024 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| ~x$w_buff0_used~0_In1128322024)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1128322024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 18:12:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1156168985 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1156168985 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1156168985 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1156168985 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite58_Out1156168985| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1156168985 |P1Thread1of1ForFork0_#t~ite58_Out1156168985|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1156168985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 18:12:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1880879688 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1880879688 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1880879688| ~x$r_buff0_thd2~0_In-1880879688) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1880879688|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1880879688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 18:12:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1059938050 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1059938050 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1059938050 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1059938050 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| ~x$r_buff1_thd2~0_In-1059938050)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1059938050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 18:12:40,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:12:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1461465425 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1461465425 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1461465425 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1461465425|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:12:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-531794613 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-531794613 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-531794613 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-531794613 256)))) (or (and (= ~x$w_buff1_used~0_In-531794613 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-531794613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:12:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-571922733 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-571922733 256) 0)) (.cse2 (= ~x$r_buff0_thd1~0_Out-571922733 ~x$r_buff0_thd1~0_In-571922733))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-571922733) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-571922733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-571922733, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-571922733|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:12:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1400188275 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1400188275 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1400188275 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1400188275 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In-1400188275 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1400188275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:12:40,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:12:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:12:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-53921203| |ULTIMATE.start_main_#t~ite63_Out-53921203|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-53921203 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-53921203 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2) (and (= ~x~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-53921203|, ~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-53921203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:12:40,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1281840366 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1281840366 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out1281840366| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1281840366 |ULTIMATE.start_main_#t~ite65_Out1281840366|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1281840366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:12:40,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-69272350 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-69272350 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-69272350 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-69272350 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| ~x$w_buff1_used~0_In-69272350)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-69272350|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:12:40,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1256109260 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1256109260 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-1256109260| ~x$r_buff0_thd0~0_In-1256109260)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-1256109260|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1256109260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:12:40,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1296962822 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1296962822 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1296962822 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1296962822 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out1296962822|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In1296962822 |ULTIMATE.start_main_#t~ite68_Out1296962822|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1296962822|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:12:40,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:12:40,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:12:40 BasicIcfg [2019-12-07 18:12:40,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:12:40,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:12:40,313 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:12:40,313 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:12:40,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:12:14" (3/4) ... [2019-12-07 18:12:40,315 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:12:40,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1729~0.base_51|) |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1729~0.base_51| 1)) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1729~0.offset_32| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1729~0.base_51|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1729~0.base=|v_ULTIMATE.start_main_~#t1729~0.base_51|, ~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_18|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t1729~0.offset=|v_ULTIMATE.start_main_~#t1729~0.offset_32|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1729~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1730~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1730~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1729~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 18:12:40,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1730~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1730~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1730~0.base_11|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1730~0.base_11|) |v_ULTIMATE.start_main_~#t1730~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1730~0.base=|v_ULTIMATE.start_main_~#t1730~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1730~0.offset=|v_ULTIMATE.start_main_~#t1730~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1730~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1730~0.offset, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 18:12:40,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x~0_In1097866384 ~x$mem_tmp~0_Out1097866384) (= ~x$r_buff1_thd0~0_Out1097866384 ~x$r_buff0_thd0~0_In1097866384) (= ~x$flush_delayed~0_Out1097866384 ~weak$$choice2~0_Out1097866384) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384)) (= |P0Thread1of1ForFork1_#t~nondet4_In1097866384| ~weak$$choice2~0_Out1097866384) (= 1 ~x$r_buff0_thd1~0_Out1097866384) (= ~x$r_buff1_thd2~0_Out1097866384 ~x$r_buff0_thd2~0_In1097866384) (= |P0Thread1of1ForFork1_#t~nondet3_In1097866384| ~weak$$choice0~0_Out1097866384) (= ~x$r_buff1_thd1~0_Out1097866384 ~x$r_buff0_thd1~0_In1097866384)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1097866384|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1097866384|, ~x~0=~x~0_In1097866384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1097866384, ~x$flush_delayed~0=~x$flush_delayed~0_Out1097866384, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1097866384, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1097866384, ~x$mem_tmp~0=~x$mem_tmp~0_Out1097866384, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1097866384, ~weak$$choice0~0=~weak$$choice0~0_Out1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1097866384|, ~weak$$choice2~0=~weak$$choice2~0_Out1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1097866384|, ~x~0=~x~0_In1097866384} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 18:12:40,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In607956245 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out607956245| |P0Thread1of1ForFork1_#t~ite5_Out607956245|)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In607956245 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out607956245| ~x$w_buff1~0_In607956245) .cse2) (and (not .cse0) (= ~x$w_buff0~0_In607956245 |P0Thread1of1ForFork1_#t~ite5_Out607956245|) .cse2 (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In607956245, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} OutVars{~x$w_buff0~0=~x$w_buff0~0_In607956245, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out607956245|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out607956245|, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:12:40,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 18:12:40,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2096518665 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out2096518665| ~x$mem_tmp~0_In2096518665)) (and (= ~x~0_In2096518665 |P0Thread1of1ForFork1_#t~ite25_Out2096518665|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out2096518665|, ~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:12:40,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1955837248 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x~0_In-1955837248) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x$mem_tmp~0_In-1955837248)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1955837248|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:12:40,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-109423356 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-109423356 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-109423356 |P1Thread1of1ForFork0_#t~ite55_Out-109423356|)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out-109423356| ~x$w_buff1~0_In-109423356) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, ~x~0=~x~0_In-109423356} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-109423356|, ~x~0=~x~0_In-109423356} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 18:12:40,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 18:12:40,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1128322024 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1128322024 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| ~x$w_buff0_used~0_In1128322024)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1128322024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 18:12:40,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1156168985 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1156168985 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1156168985 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1156168985 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite58_Out1156168985| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1156168985 |P1Thread1of1ForFork0_#t~ite58_Out1156168985|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1156168985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 18:12:40,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1880879688 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1880879688 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1880879688| ~x$r_buff0_thd2~0_In-1880879688) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1880879688|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1880879688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 18:12:40,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1059938050 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1059938050 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1059938050 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1059938050 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| ~x$r_buff1_thd2~0_In-1059938050)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1059938050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 18:12:40,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:12:40,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1461465425 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1461465425 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1461465425 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1461465425|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:12:40,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-531794613 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-531794613 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-531794613 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-531794613 256)))) (or (and (= ~x$w_buff1_used~0_In-531794613 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-531794613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:12:40,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-571922733 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-571922733 256) 0)) (.cse2 (= ~x$r_buff0_thd1~0_Out-571922733 ~x$r_buff0_thd1~0_In-571922733))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-571922733) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-571922733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-571922733, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-571922733|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:12:40,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1400188275 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1400188275 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1400188275 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1400188275 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In-1400188275 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1400188275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:12:40,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:12:40,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:12:40,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-53921203| |ULTIMATE.start_main_#t~ite63_Out-53921203|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-53921203 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-53921203 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2) (and (= ~x~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-53921203|, ~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-53921203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:12:40,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1281840366 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1281840366 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out1281840366| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1281840366 |ULTIMATE.start_main_#t~ite65_Out1281840366|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1281840366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:12:40,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-69272350 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-69272350 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-69272350 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-69272350 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| ~x$w_buff1_used~0_In-69272350)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-69272350|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:12:40,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1256109260 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1256109260 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-1256109260| ~x$r_buff0_thd0~0_In-1256109260)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-1256109260|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1256109260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:12:40,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1296962822 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1296962822 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1296962822 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1296962822 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out1296962822|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In1296962822 |ULTIMATE.start_main_#t~ite68_Out1296962822|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1296962822|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:12:40,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:12:40,393 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_43818726-5cb9-4caa-8243-31add0020389/bin/uautomizer/witness.graphml [2019-12-07 18:12:40,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:12:40,395 INFO L168 Benchmark]: Toolchain (without parser) took 26658.99 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 942.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 18:12:40,395 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:12:40,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:40,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:12:40,396 INFO L168 Benchmark]: Boogie Preprocessor took 27.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:40,396 INFO L168 Benchmark]: RCFGBuilder took 439.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.5 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:40,396 INFO L168 Benchmark]: TraceAbstraction took 25643.44 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 985.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:12:40,396 INFO L168 Benchmark]: Witness Printer took 80.42 ms. Allocated memory is still 3.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:12:40,398 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 424.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.5 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25643.44 ms. Allocated memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 985.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 80.42 ms. Allocated memory is still 3.8 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1729, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1730, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5038 SDtfs, 4590 SDslu, 9991 SDs, 0 SdLazy, 4112 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 41 SyntacticMatches, 13 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 42758 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 967 NumberOfCodeBlocks, 967 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 258201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...