./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt.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_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/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 7ab71064d9e578e1ec2de127605cce66d54eb112 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:21:39,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:21:39,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:21:39,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:21:39,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:21:39,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:21:39,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:21:39,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:21:39,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:21:39,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:21:39,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:21:39,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:21:39,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:21:39,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:21:39,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:21:39,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:21:39,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:21:39,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:21:39,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:21:39,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:21:39,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:21:39,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:21:39,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:21:39,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:21:39,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:21:39,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:21:39,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:21:39,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:21:39,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:21:39,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:21:39,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:21:39,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:21:39,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:21:39,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:21:39,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:21:39,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:21:39,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:21:39,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:21:39,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:21:39,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:21:39,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:21:39,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:21:39,079 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:21:39,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:21:39,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:21:39,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:21:39,080 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:21:39,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:21:39,081 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:21:39,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:21:39,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:21:39,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:21:39,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:21:39,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:21:39,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:21:39,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:21:39,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:21:39,083 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:21:39,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:21:39,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:21:39,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:21:39,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:21:39,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:21:39,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:21:39,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:21:39,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:21:39,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:21:39,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:21:39,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:21:39,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:21:39,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:21:39,085 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_220114c4-1c0f-4288-80f1-1c77d5ccf250/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 -> 7ab71064d9e578e1ec2de127605cce66d54eb112 [2019-12-07 13:21:39,191 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:21:39,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:21:39,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:21:39,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:21:39,203 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:21:39,203 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt.i [2019-12-07 13:21:39,239 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/data/4ea5f4268/e2caa4894773454db6055cdb4c242433/FLAG56a3732cd [2019-12-07 13:21:39,620 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:21:39,621 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/sv-benchmarks/c/pthread-wmm/rfi000_tso.opt.i [2019-12-07 13:21:39,633 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/data/4ea5f4268/e2caa4894773454db6055cdb4c242433/FLAG56a3732cd [2019-12-07 13:21:39,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/data/4ea5f4268/e2caa4894773454db6055cdb4c242433 [2019-12-07 13:21:39,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:21:39,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:21:39,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:21:39,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:21:39,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:21:39,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:21:39" (1/1) ... [2019-12-07 13:21:39,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:39, skipping insertion in model container [2019-12-07 13:21:39,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:21:39" (1/1) ... [2019-12-07 13:21:39,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:21:39,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:21:39,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:21:39,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:21:40,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:21:40,056 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:21:40,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40 WrapperNode [2019-12-07 13:21:40,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:21:40,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:21:40,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:21:40,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:21:40,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:21:40,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:21:40,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:21:40,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:21:40,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... [2019-12-07 13:21:40,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:21:40,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:21:40,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:21:40,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:21:40,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/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 13:21:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:21:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:21:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:21:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:21:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:21:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:21:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:21:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:21:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:21:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:21:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:21:40,174 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 13:21:40,643 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:21:40,644 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:21:40,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:21:40 BoogieIcfgContainer [2019-12-07 13:21:40,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:21:40,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:21:40,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:21:40,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:21:40,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:21:39" (1/3) ... [2019-12-07 13:21:40,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43556107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:21:40, skipping insertion in model container [2019-12-07 13:21:40,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:21:40" (2/3) ... [2019-12-07 13:21:40,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43556107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:21:40, skipping insertion in model container [2019-12-07 13:21:40,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:21:40" (3/3) ... [2019-12-07 13:21:40,649 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.opt.i [2019-12-07 13:21:40,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:21:40,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:21:40,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:21:40,662 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:21:40,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:21:40,728 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:21:40,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:21:40,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:21:40,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:21:40,744 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:21:40,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:21:40,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:21:40,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:21:40,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:21:40,756 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-07 13:21:40,758 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 13:21:40,840 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 13:21:40,840 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:21:40,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1198 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 13:21:40,893 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-07 13:21:40,944 INFO L134 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-07 13:21:40,945 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:21:40,957 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1198 event pairs. 6/226 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-07 13:21:40,990 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-07 13:21:40,990 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:21:44,622 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 13:21:44,743 INFO L206 etLargeBlockEncoding]: Checked pairs total: 232725 [2019-12-07 13:21:44,743 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-07 13:21:44,745 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 184 transitions [2019-12-07 13:21:47,673 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 50078 states. [2019-12-07 13:21:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states. [2019-12-07 13:21:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:21:47,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:21:47,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:21:47,680 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:21:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1268502306, now seen corresponding path program 1 times [2019-12-07 13:21:47,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:47,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897895539] [2019-12-07 13:21:47,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:21:47,840 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 13:21:47,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897895539] [2019-12-07 13:21:47,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:21:47,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:21:47,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792089211] [2019-12-07 13:21:47,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:21:47,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:21:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:21:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:21:47,855 INFO L87 Difference]: Start difference. First operand 50078 states. Second operand 3 states. [2019-12-07 13:21:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:21:48,304 INFO L93 Difference]: Finished difference Result 50030 states and 178645 transitions. [2019-12-07 13:21:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:21:48,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:21:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:21:48,573 INFO L225 Difference]: With dead ends: 50030 [2019-12-07 13:21:48,573 INFO L226 Difference]: Without dead ends: 49055 [2019-12-07 13:21:48,574 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 13:21:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49055 states. [2019-12-07 13:21:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49055 to 49055. [2019-12-07 13:21:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49055 states. [2019-12-07 13:21:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49055 states to 49055 states and 175395 transitions. [2019-12-07 13:21:50,373 INFO L78 Accepts]: Start accepts. Automaton has 49055 states and 175395 transitions. Word has length 5 [2019-12-07 13:21:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:21:50,374 INFO L462 AbstractCegarLoop]: Abstraction has 49055 states and 175395 transitions. [2019-12-07 13:21:50,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:21:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 49055 states and 175395 transitions. [2019-12-07 13:21:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:21:50,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:21:50,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:21:50,376 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:21:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1198055303, now seen corresponding path program 1 times [2019-12-07 13:21:50,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:50,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211530744] [2019-12-07 13:21:50,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:21:50,444 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 13:21:50,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211530744] [2019-12-07 13:21:50,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:21:50,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:21:50,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486076472] [2019-12-07 13:21:50,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:21:50,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:21:50,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:21:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:21:50,446 INFO L87 Difference]: Start difference. First operand 49055 states and 175395 transitions. Second operand 4 states. [2019-12-07 13:21:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:21:50,922 INFO L93 Difference]: Finished difference Result 68649 states and 238459 transitions. [2019-12-07 13:21:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:21:50,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:21:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:21:51,137 INFO L225 Difference]: With dead ends: 68649 [2019-12-07 13:21:51,138 INFO L226 Difference]: Without dead ends: 68649 [2019-12-07 13:21:51,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 13:21:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68649 states. [2019-12-07 13:21:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68649 to 68283. [2019-12-07 13:21:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68283 states. [2019-12-07 13:21:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68283 states to 68283 states and 237431 transitions. [2019-12-07 13:21:53,142 INFO L78 Accepts]: Start accepts. Automaton has 68283 states and 237431 transitions. Word has length 11 [2019-12-07 13:21:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:21:53,143 INFO L462 AbstractCegarLoop]: Abstraction has 68283 states and 237431 transitions. [2019-12-07 13:21:53,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:21:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 68283 states and 237431 transitions. [2019-12-07 13:21:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:21:53,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:21:53,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:21:53,145 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:21:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:53,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2038106739, now seen corresponding path program 1 times [2019-12-07 13:21:53,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:53,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974948541] [2019-12-07 13:21:53,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:21:53,201 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 13:21:53,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974948541] [2019-12-07 13:21:53,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:21:53,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:21:53,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242324382] [2019-12-07 13:21:53,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:21:53,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:21:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:21:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:21:53,203 INFO L87 Difference]: Start difference. First operand 68283 states and 237431 transitions. Second operand 4 states. [2019-12-07 13:21:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:21:53,768 INFO L93 Difference]: Finished difference Result 99934 states and 337703 transitions. [2019-12-07 13:21:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:21:53,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:21:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:21:53,954 INFO L225 Difference]: With dead ends: 99934 [2019-12-07 13:21:53,954 INFO L226 Difference]: Without dead ends: 99927 [2019-12-07 13:21:53,954 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 13:21:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99927 states. [2019-12-07 13:21:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99927 to 88377. [2019-12-07 13:21:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88377 states. [2019-12-07 13:21:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88377 states to 88377 states and 301889 transitions. [2019-12-07 13:21:57,466 INFO L78 Accepts]: Start accepts. Automaton has 88377 states and 301889 transitions. Word has length 11 [2019-12-07 13:21:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:21:57,467 INFO L462 AbstractCegarLoop]: Abstraction has 88377 states and 301889 transitions. [2019-12-07 13:21:57,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:21:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 88377 states and 301889 transitions. [2019-12-07 13:21:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:21:57,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:21:57,472 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 13:21:57,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:21:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:21:57,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1380914162, now seen corresponding path program 1 times [2019-12-07 13:21:57,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:21:57,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185467463] [2019-12-07 13:21:57,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:21:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:21:57,576 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 13:21:57,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185467463] [2019-12-07 13:21:57,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:21:57,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:21:57,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990168877] [2019-12-07 13:21:57,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:21:57,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:21:57,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:21:57,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:21:57,577 INFO L87 Difference]: Start difference. First operand 88377 states and 301889 transitions. Second operand 7 states. [2019-12-07 13:21:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:21:58,963 INFO L93 Difference]: Finished difference Result 131863 states and 440470 transitions. [2019-12-07 13:21:58,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:21:58,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 13:21:58,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:21:59,207 INFO L225 Difference]: With dead ends: 131863 [2019-12-07 13:21:59,207 INFO L226 Difference]: Without dead ends: 131856 [2019-12-07 13:21:59,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:22:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131856 states. [2019-12-07 13:22:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131856 to 88554. [2019-12-07 13:22:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88554 states. [2019-12-07 13:22:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88554 states to 88554 states and 302376 transitions. [2019-12-07 13:22:01,917 INFO L78 Accepts]: Start accepts. Automaton has 88554 states and 302376 transitions. Word has length 17 [2019-12-07 13:22:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:01,917 INFO L462 AbstractCegarLoop]: Abstraction has 88554 states and 302376 transitions. [2019-12-07 13:22:01,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:22:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 88554 states and 302376 transitions. [2019-12-07 13:22:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:22:01,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:01,925 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] [2019-12-07 13:22:01,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1979028561, now seen corresponding path program 1 times [2019-12-07 13:22:01,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:01,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912217051] [2019-12-07 13:22:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:02,095 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 13:22:02,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912217051] [2019-12-07 13:22:02,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:02,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:22:02,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064651835] [2019-12-07 13:22:02,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:22:02,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:22:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:22:02,096 INFO L87 Difference]: Start difference. First operand 88554 states and 302376 transitions. Second operand 9 states. [2019-12-07 13:22:03,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:03,349 INFO L93 Difference]: Finished difference Result 113822 states and 381360 transitions. [2019-12-07 13:22:03,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:22:03,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 13:22:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:03,544 INFO L225 Difference]: With dead ends: 113822 [2019-12-07 13:22:03,545 INFO L226 Difference]: Without dead ends: 113822 [2019-12-07 13:22:03,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:22:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113822 states. [2019-12-07 13:22:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113822 to 87945. [2019-12-07 13:22:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87945 states. [2019-12-07 13:22:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87945 states to 87945 states and 300269 transitions. [2019-12-07 13:22:05,934 INFO L78 Accepts]: Start accepts. Automaton has 87945 states and 300269 transitions. Word has length 21 [2019-12-07 13:22:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:05,935 INFO L462 AbstractCegarLoop]: Abstraction has 87945 states and 300269 transitions. [2019-12-07 13:22:05,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:22:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 87945 states and 300269 transitions. [2019-12-07 13:22:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:22:05,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:05,949 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] [2019-12-07 13:22:05,950 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:05,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1904906828, now seen corresponding path program 1 times [2019-12-07 13:22:05,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:05,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369106957] [2019-12-07 13:22:05,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:05,997 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 13:22:05,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369106957] [2019-12-07 13:22:05,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:05,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:22:05,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73365451] [2019-12-07 13:22:05,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:22:05,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:22:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:22:05,999 INFO L87 Difference]: Start difference. First operand 87945 states and 300269 transitions. Second operand 4 states. [2019-12-07 13:22:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:06,048 INFO L93 Difference]: Finished difference Result 9560 states and 24272 transitions. [2019-12-07 13:22:06,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:22:06,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 13:22:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:06,056 INFO L225 Difference]: With dead ends: 9560 [2019-12-07 13:22:06,057 INFO L226 Difference]: Without dead ends: 7972 [2019-12-07 13:22:06,057 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 13:22:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7972 states. [2019-12-07 13:22:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7972 to 7972. [2019-12-07 13:22:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7972 states. [2019-12-07 13:22:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7972 states to 7972 states and 19341 transitions. [2019-12-07 13:22:06,162 INFO L78 Accepts]: Start accepts. Automaton has 7972 states and 19341 transitions. Word has length 25 [2019-12-07 13:22:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:06,162 INFO L462 AbstractCegarLoop]: Abstraction has 7972 states and 19341 transitions. [2019-12-07 13:22:06,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:22:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7972 states and 19341 transitions. [2019-12-07 13:22:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:22:06,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:06,166 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] [2019-12-07 13:22:06,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:06,166 INFO L82 PathProgramCache]: Analyzing trace with hash 551296721, now seen corresponding path program 1 times [2019-12-07 13:22:06,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:06,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919217961] [2019-12-07 13:22:06,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:06,443 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 13:22:06,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919217961] [2019-12-07 13:22:06,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:06,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:22:06,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418235854] [2019-12-07 13:22:06,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:22:06,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:22:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:22:06,444 INFO L87 Difference]: Start difference. First operand 7972 states and 19341 transitions. Second operand 8 states. [2019-12-07 13:22:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:07,929 INFO L93 Difference]: Finished difference Result 9289 states and 22308 transitions. [2019-12-07 13:22:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:22:07,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 13:22:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:07,936 INFO L225 Difference]: With dead ends: 9289 [2019-12-07 13:22:07,936 INFO L226 Difference]: Without dead ends: 9288 [2019-12-07 13:22:07,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:22:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2019-12-07 13:22:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 9043. [2019-12-07 13:22:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9043 states. [2019-12-07 13:22:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9043 states to 9043 states and 21840 transitions. [2019-12-07 13:22:08,026 INFO L78 Accepts]: Start accepts. Automaton has 9043 states and 21840 transitions. Word has length 37 [2019-12-07 13:22:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:08,026 INFO L462 AbstractCegarLoop]: Abstraction has 9043 states and 21840 transitions. [2019-12-07 13:22:08,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:22:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9043 states and 21840 transitions. [2019-12-07 13:22:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 13:22:08,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:08,030 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] [2019-12-07 13:22:08,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash -89628418, now seen corresponding path program 1 times [2019-12-07 13:22:08,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:08,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115942417] [2019-12-07 13:22:08,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:08,064 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 13:22:08,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115942417] [2019-12-07 13:22:08,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:08,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:22:08,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323479435] [2019-12-07 13:22:08,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:22:08,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:22:08,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:22:08,065 INFO L87 Difference]: Start difference. First operand 9043 states and 21840 transitions. Second operand 3 states. [2019-12-07 13:22:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:08,152 INFO L93 Difference]: Finished difference Result 13718 states and 31508 transitions. [2019-12-07 13:22:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:22:08,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-12-07 13:22:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:08,165 INFO L225 Difference]: With dead ends: 13718 [2019-12-07 13:22:08,165 INFO L226 Difference]: Without dead ends: 13718 [2019-12-07 13:22:08,165 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 13:22:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13718 states. [2019-12-07 13:22:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13718 to 12078. [2019-12-07 13:22:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12078 states. [2019-12-07 13:22:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12078 states to 12078 states and 28223 transitions. [2019-12-07 13:22:08,295 INFO L78 Accepts]: Start accepts. Automaton has 12078 states and 28223 transitions. Word has length 38 [2019-12-07 13:22:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:08,295 INFO L462 AbstractCegarLoop]: Abstraction has 12078 states and 28223 transitions. [2019-12-07 13:22:08,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:22:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 12078 states and 28223 transitions. [2019-12-07 13:22:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:22:08,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:08,300 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] [2019-12-07 13:22:08,300 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash 951471264, now seen corresponding path program 1 times [2019-12-07 13:22:08,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:08,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065459455] [2019-12-07 13:22:08,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:08,355 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 13:22:08,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065459455] [2019-12-07 13:22:08,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:08,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:22:08,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013345518] [2019-12-07 13:22:08,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:22:08,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:22:08,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:22:08,357 INFO L87 Difference]: Start difference. First operand 12078 states and 28223 transitions. Second operand 5 states. [2019-12-07 13:22:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:08,389 INFO L93 Difference]: Finished difference Result 2206 states and 4707 transitions. [2019-12-07 13:22:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:22:08,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 13:22:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:08,391 INFO L225 Difference]: With dead ends: 2206 [2019-12-07 13:22:08,391 INFO L226 Difference]: Without dead ends: 2006 [2019-12-07 13:22:08,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:22:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-07 13:22:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1873. [2019-12-07 13:22:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-07 13:22:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4026 transitions. [2019-12-07 13:22:08,406 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4026 transitions. Word has length 40 [2019-12-07 13:22:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:08,406 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 4026 transitions. [2019-12-07 13:22:08,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:22:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4026 transitions. [2019-12-07 13:22:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 13:22:08,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:08,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:08,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:08,410 INFO L82 PathProgramCache]: Analyzing trace with hash -175598507, now seen corresponding path program 1 times [2019-12-07 13:22:08,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:08,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893122564] [2019-12-07 13:22:08,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:08,463 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 13:22:08,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893122564] [2019-12-07 13:22:08,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:08,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:22:08,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416874728] [2019-12-07 13:22:08,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:22:08,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:08,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:22:08,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:22:08,465 INFO L87 Difference]: Start difference. First operand 1873 states and 4026 transitions. Second operand 3 states. [2019-12-07 13:22:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:08,476 INFO L93 Difference]: Finished difference Result 1873 states and 3936 transitions. [2019-12-07 13:22:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:22:08,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-07 13:22:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:08,478 INFO L225 Difference]: With dead ends: 1873 [2019-12-07 13:22:08,478 INFO L226 Difference]: Without dead ends: 1873 [2019-12-07 13:22:08,478 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 13:22:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-12-07 13:22:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1873. [2019-12-07 13:22:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-07 13:22:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3936 transitions. [2019-12-07 13:22:08,493 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3936 transitions. Word has length 83 [2019-12-07 13:22:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:08,493 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 3936 transitions. [2019-12-07 13:22:08,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:22:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3936 transitions. [2019-12-07 13:22:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 13:22:08,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:08,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:08,495 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2054814588, now seen corresponding path program 1 times [2019-12-07 13:22:08,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:08,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092245422] [2019-12-07 13:22:08,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:08,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 13:22:08,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092245422] [2019-12-07 13:22:08,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:08,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:22:08,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106286738] [2019-12-07 13:22:08,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:22:08,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:22:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:22:08,554 INFO L87 Difference]: Start difference. First operand 1873 states and 3936 transitions. Second operand 5 states. [2019-12-07 13:22:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:08,740 INFO L93 Difference]: Finished difference Result 2011 states and 4184 transitions. [2019-12-07 13:22:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:22:08,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-07 13:22:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:08,742 INFO L225 Difference]: With dead ends: 2011 [2019-12-07 13:22:08,742 INFO L226 Difference]: Without dead ends: 2011 [2019-12-07 13:22:08,742 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 13:22:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-12-07 13:22:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1958. [2019-12-07 13:22:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2019-12-07 13:22:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 4090 transitions. [2019-12-07 13:22:08,757 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 4090 transitions. Word has length 84 [2019-12-07 13:22:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:08,757 INFO L462 AbstractCegarLoop]: Abstraction has 1958 states and 4090 transitions. [2019-12-07 13:22:08,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:22:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 4090 transitions. [2019-12-07 13:22:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 13:22:08,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:08,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:08,759 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 588669574, now seen corresponding path program 2 times [2019-12-07 13:22:08,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:08,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050479149] [2019-12-07 13:22:08,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:08,864 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 13:22:08,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050479149] [2019-12-07 13:22:08,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:08,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:22:08,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624173736] [2019-12-07 13:22:08,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:22:08,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:22:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:22:08,865 INFO L87 Difference]: Start difference. First operand 1958 states and 4090 transitions. Second operand 9 states. [2019-12-07 13:22:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:09,005 INFO L93 Difference]: Finished difference Result 2522 states and 5092 transitions. [2019-12-07 13:22:09,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:22:09,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-12-07 13:22:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:09,007 INFO L225 Difference]: With dead ends: 2522 [2019-12-07 13:22:09,007 INFO L226 Difference]: Without dead ends: 2484 [2019-12-07 13:22:09,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:22:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-12-07 13:22:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2333. [2019-12-07 13:22:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-12-07 13:22:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 4803 transitions. [2019-12-07 13:22:09,026 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 4803 transitions. Word has length 84 [2019-12-07 13:22:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 2333 states and 4803 transitions. [2019-12-07 13:22:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:22:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 4803 transitions. [2019-12-07 13:22:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 13:22:09,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:09,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:09,029 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1761939513, now seen corresponding path program 1 times [2019-12-07 13:22:09,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:09,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065019576] [2019-12-07 13:22:09,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:09,191 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 13:22:09,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065019576] [2019-12-07 13:22:09,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:09,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:22:09,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876779875] [2019-12-07 13:22:09,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:22:09,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:22:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:22:09,193 INFO L87 Difference]: Start difference. First operand 2333 states and 4803 transitions. Second operand 10 states. [2019-12-07 13:22:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:09,766 INFO L93 Difference]: Finished difference Result 3598 states and 7370 transitions. [2019-12-07 13:22:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:22:09,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-12-07 13:22:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:09,768 INFO L225 Difference]: With dead ends: 3598 [2019-12-07 13:22:09,768 INFO L226 Difference]: Without dead ends: 3598 [2019-12-07 13:22:09,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:22:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2019-12-07 13:22:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3058. [2019-12-07 13:22:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2019-12-07 13:22:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 6290 transitions. [2019-12-07 13:22:09,793 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 6290 transitions. Word has length 85 [2019-12-07 13:22:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:09,793 INFO L462 AbstractCegarLoop]: Abstraction has 3058 states and 6290 transitions. [2019-12-07 13:22:09,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:22:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 6290 transitions. [2019-12-07 13:22:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 13:22:09,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:09,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:09,797 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1576799289, now seen corresponding path program 2 times [2019-12-07 13:22:09,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:09,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460758527] [2019-12-07 13:22:09,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:09,950 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 13:22:09,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460758527] [2019-12-07 13:22:09,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:22:09,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540549830] [2019-12-07 13:22:09,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:22:09,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:22:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:22:09,951 INFO L87 Difference]: Start difference. First operand 3058 states and 6290 transitions. Second operand 10 states. [2019-12-07 13:22:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:10,715 INFO L93 Difference]: Finished difference Result 4252 states and 8718 transitions. [2019-12-07 13:22:10,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:22:10,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-12-07 13:22:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:10,718 INFO L225 Difference]: With dead ends: 4252 [2019-12-07 13:22:10,718 INFO L226 Difference]: Without dead ends: 4252 [2019-12-07 13:22:10,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:22:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2019-12-07 13:22:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 2954. [2019-12-07 13:22:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-12-07 13:22:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 6048 transitions. [2019-12-07 13:22:10,744 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 6048 transitions. Word has length 85 [2019-12-07 13:22:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:10,745 INFO L462 AbstractCegarLoop]: Abstraction has 2954 states and 6048 transitions. [2019-12-07 13:22:10,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:22:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 6048 transitions. [2019-12-07 13:22:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 13:22:10,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:10,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:10,748 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1802883163, now seen corresponding path program 3 times [2019-12-07 13:22:10,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:10,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196220788] [2019-12-07 13:22:10,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:10,902 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 13:22:10,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196220788] [2019-12-07 13:22:10,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:10,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:22:10,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336569544] [2019-12-07 13:22:10,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:22:10,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:22:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:22:10,903 INFO L87 Difference]: Start difference. First operand 2954 states and 6048 transitions. Second operand 10 states. [2019-12-07 13:22:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:11,851 INFO L93 Difference]: Finished difference Result 3928 states and 7984 transitions. [2019-12-07 13:22:11,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:22:11,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-12-07 13:22:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:11,860 INFO L225 Difference]: With dead ends: 3928 [2019-12-07 13:22:11,860 INFO L226 Difference]: Without dead ends: 3928 [2019-12-07 13:22:11,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:22:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2019-12-07 13:22:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 2909. [2019-12-07 13:22:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2019-12-07 13:22:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 5952 transitions. [2019-12-07 13:22:11,903 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 5952 transitions. Word has length 85 [2019-12-07 13:22:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:11,903 INFO L462 AbstractCegarLoop]: Abstraction has 2909 states and 5952 transitions. [2019-12-07 13:22:11,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:22:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 5952 transitions. [2019-12-07 13:22:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 13:22:11,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:11,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:11,906 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:11,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1707217253, now seen corresponding path program 4 times [2019-12-07 13:22:11,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:11,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248757718] [2019-12-07 13:22:11,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:12,017 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 13:22:12,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248757718] [2019-12-07 13:22:12,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:12,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:22:12,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75686432] [2019-12-07 13:22:12,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:22:12,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:22:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:22:12,019 INFO L87 Difference]: Start difference. First operand 2909 states and 5952 transitions. Second operand 10 states. [2019-12-07 13:22:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:12,229 INFO L93 Difference]: Finished difference Result 6568 states and 13490 transitions. [2019-12-07 13:22:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:22:12,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-12-07 13:22:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:12,232 INFO L225 Difference]: With dead ends: 6568 [2019-12-07 13:22:12,232 INFO L226 Difference]: Without dead ends: 4587 [2019-12-07 13:22:12,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:22:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-12-07 13:22:12,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 3035. [2019-12-07 13:22:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-12-07 13:22:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 6189 transitions. [2019-12-07 13:22:12,260 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 6189 transitions. Word has length 85 [2019-12-07 13:22:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:12,260 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 6189 transitions. [2019-12-07 13:22:12,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:22:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 6189 transitions. [2019-12-07 13:22:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 13:22:12,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:12,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:12,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1095684210, now seen corresponding path program 1 times [2019-12-07 13:22:12,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:12,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320600164] [2019-12-07 13:22:12,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:12,418 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 13:22:12,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320600164] [2019-12-07 13:22:12,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:12,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:22:12,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496564703] [2019-12-07 13:22:12,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:22:12,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:12,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:22:12,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:22:12,419 INFO L87 Difference]: Start difference. First operand 3035 states and 6189 transitions. Second operand 14 states. [2019-12-07 13:22:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:12,790 INFO L93 Difference]: Finished difference Result 4474 states and 8870 transitions. [2019-12-07 13:22:12,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 13:22:12,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2019-12-07 13:22:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:12,793 INFO L225 Difference]: With dead ends: 4474 [2019-12-07 13:22:12,793 INFO L226 Difference]: Without dead ends: 4367 [2019-12-07 13:22:12,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:22:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2019-12-07 13:22:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 3894. [2019-12-07 13:22:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3894 states. [2019-12-07 13:22:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 7883 transitions. [2019-12-07 13:22:12,835 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 7883 transitions. Word has length 86 [2019-12-07 13:22:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:12,835 INFO L462 AbstractCegarLoop]: Abstraction has 3894 states and 7883 transitions. [2019-12-07 13:22:12,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:22:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 7883 transitions. [2019-12-07 13:22:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:22:12,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:12,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:12,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash -239347405, now seen corresponding path program 1 times [2019-12-07 13:22:12,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:12,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378216988] [2019-12-07 13:22:12,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:12,903 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 13:22:12,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378216988] [2019-12-07 13:22:12,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:12,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:22:12,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425420730] [2019-12-07 13:22:12,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:22:12,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:22:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:22:12,904 INFO L87 Difference]: Start difference. First operand 3894 states and 7883 transitions. Second operand 5 states. [2019-12-07 13:22:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:13,093 INFO L93 Difference]: Finished difference Result 3927 states and 7918 transitions. [2019-12-07 13:22:13,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:22:13,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-12-07 13:22:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:13,096 INFO L225 Difference]: With dead ends: 3927 [2019-12-07 13:22:13,096 INFO L226 Difference]: Without dead ends: 3917 [2019-12-07 13:22:13,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 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 13:22:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2019-12-07 13:22:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3744. [2019-12-07 13:22:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2019-12-07 13:22:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 7614 transitions. [2019-12-07 13:22:13,129 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 7614 transitions. Word has length 87 [2019-12-07 13:22:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:13,129 INFO L462 AbstractCegarLoop]: Abstraction has 3744 states and 7614 transitions. [2019-12-07 13:22:13,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:22:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 7614 transitions. [2019-12-07 13:22:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:22:13,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:13,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:13,134 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:13,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1151333618, now seen corresponding path program 1 times [2019-12-07 13:22:13,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:13,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586527599] [2019-12-07 13:22:13,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:22:13,300 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 13:22:13,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586527599] [2019-12-07 13:22:13,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:22:13,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:22:13,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773212644] [2019-12-07 13:22:13,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:22:13,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:22:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:22:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:22:13,301 INFO L87 Difference]: Start difference. First operand 3744 states and 7614 transitions. Second operand 15 states. [2019-12-07 13:22:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:22:15,738 INFO L93 Difference]: Finished difference Result 7070 states and 14261 transitions. [2019-12-07 13:22:15,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 13:22:15,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-12-07 13:22:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:22:15,743 INFO L225 Difference]: With dead ends: 7070 [2019-12-07 13:22:15,743 INFO L226 Difference]: Without dead ends: 7032 [2019-12-07 13:22:15,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:22:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2019-12-07 13:22:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 3898. [2019-12-07 13:22:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2019-12-07 13:22:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 7910 transitions. [2019-12-07 13:22:15,783 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 7910 transitions. Word has length 87 [2019-12-07 13:22:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:22:15,783 INFO L462 AbstractCegarLoop]: Abstraction has 3898 states and 7910 transitions. [2019-12-07 13:22:15,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:22:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 7910 transitions. [2019-12-07 13:22:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 13:22:15,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:22:15,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:22:15,787 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:22:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:22:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -766393236, now seen corresponding path program 2 times [2019-12-07 13:22:15,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:22:15,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663255504] [2019-12-07 13:22:15,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:22:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:22:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:22:15,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:22:15,870 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:22:15,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~__unbuffered_p1_EAX~0_80) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1599~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1599~0.base_28|) |v_ULTIMATE.start_main_~#t1599~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1599~0.base_28| 1) |v_#valid_50|) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1599~0.base_28| 4)) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1599~0.base_28|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1599~0.base_28|)) (= 0 |v_ULTIMATE.start_main_~#t1599~0.offset_20|) (= v_~weak$$choice2~0_358 0) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1600~0.offset=|v_ULTIMATE.start_main_~#t1600~0.offset_15|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1599~0.base=|v_ULTIMATE.start_main_~#t1599~0.base_28|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1599~0.offset=|v_ULTIMATE.start_main_~#t1599~0.offset_20|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1600~0.base=|v_ULTIMATE.start_main_~#t1600~0.base_18|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_~#t1600~0.offset, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1599~0.base, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_~#t1599~0.offset, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1600~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:22:15,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1600~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1600~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1600~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1600~0.offset_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1600~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1600~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1600~0.base_13|) |v_ULTIMATE.start_main_~#t1600~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1600~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1600~0.offset=|v_ULTIMATE.start_main_~#t1600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1600~0.base=|v_ULTIMATE.start_main_~#t1600~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1600~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1600~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 13:22:15,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_6|) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4 0)) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_6|)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_6|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_6|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-07 13:22:15,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1586458856 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1586458856 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1586458856| ~y$w_buff1~0_In1586458856) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1586458856| ~y$w_buff0~0_In1586458856)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1586458856, ~y$w_buff1~0=~y$w_buff1~0_In1586458856, ~y$w_buff0~0=~y$w_buff0~0_In1586458856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1586458856} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1586458856, ~y$w_buff1~0=~y$w_buff1~0_In1586458856, ~y$w_buff0~0=~y$w_buff0~0_In1586458856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1586458856, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1586458856|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:22:15,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_11|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-07 13:22:15,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:22:15,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1923032308 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1923032308| ~y$mem_tmp~0_In-1923032308) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1923032308| ~y~0_In-1923032308) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1923032308, ~y$flush_delayed~0=~y$flush_delayed~0_In-1923032308, ~y~0=~y~0_In-1923032308} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1923032308, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1923032308|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1923032308, ~y~0=~y~0_In-1923032308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:22:15,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-83167153 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-83167153 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-83167153| |P0Thread1of1ForFork0_#t~ite3_Out-83167153|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-83167153| ~y$w_buff1~0_In-83167153) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-83167153| ~y~0_In-83167153) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-83167153, ~y$w_buff1~0=~y$w_buff1~0_In-83167153, ~y~0=~y~0_In-83167153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83167153} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-83167153, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-83167153|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-83167153|, ~y$w_buff1~0=~y$w_buff1~0_In-83167153, ~y~0=~y~0_In-83167153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83167153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 13:22:15,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1854268009 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1854268009 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1854268009| ~y$w_buff0~0_In-1854268009) (not .cse0) (not .cse1)) (and (= ~y$w_buff1~0_In-1854268009 |P1Thread1of1ForFork1_#t~ite34_Out-1854268009|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854268009, ~y$w_buff1~0=~y$w_buff1~0_In-1854268009, ~y$w_buff0~0=~y$w_buff0~0_In-1854268009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1854268009} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854268009, ~y$w_buff1~0=~y$w_buff1~0_In-1854268009, ~y$w_buff0~0=~y$w_buff0~0_In-1854268009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1854268009, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1854268009|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:22:15,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_6|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_6|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_5|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_5|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-07 13:22:15,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_9|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_6|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 13:22:15,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1383967952 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite54_Out-1383967952| ~y$mem_tmp~0_In-1383967952)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-1383967952| ~y~0_In-1383967952)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1383967952, ~y$flush_delayed~0=~y$flush_delayed~0_In-1383967952, ~y~0=~y~0_In-1383967952} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1383967952, ~y$flush_delayed~0=~y$flush_delayed~0_In-1383967952, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1383967952|, ~y~0=~y~0_In-1383967952} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 13:22:15,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In734818660 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In734818660 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In734818660 |P0Thread1of1ForFork0_#t~ite5_Out734818660|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out734818660|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In734818660, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In734818660} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out734818660|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In734818660, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In734818660} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:22:15,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1921501966 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1921501966 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1921501966 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1921501966 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1921501966| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1921501966| ~y$w_buff1_used~0_In-1921501966)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1921501966, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1921501966, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1921501966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1921501966} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1921501966|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1921501966, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1921501966, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1921501966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1921501966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:22:15,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1097460738 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1097460738 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1097460738| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In1097460738 |P0Thread1of1ForFork0_#t~ite7_Out1097460738|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1097460738, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1097460738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1097460738, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1097460738|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1097460738} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 13:22:15,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In999500794 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In999500794 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In999500794 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In999500794 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out999500794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out999500794| ~y$r_buff1_thd1~0_In999500794) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In999500794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999500794, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In999500794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999500794} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In999500794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999500794, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out999500794|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In999500794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999500794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:22:15,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_30|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:22:15,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-668593414 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-668593414 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-668593414| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-668593414| ~y$w_buff0_used~0_In-668593414)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-668593414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-668593414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-668593414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-668593414, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-668593414|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 13:22:15,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2120596785 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2120596785 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2120596785 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2120596785 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite58_Out-2120596785| ~y$w_buff1_used~0_In-2120596785)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-2120596785|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120596785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120596785, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120596785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120596785} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120596785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120596785, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120596785, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-2120596785|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120596785} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 13:22:15,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out1694831989 ~y$r_buff0_thd2~0_In1694831989)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1694831989 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1694831989 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= ~y$r_buff0_thd2~0_Out1694831989 0) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1694831989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1694831989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1694831989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1694831989, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1694831989|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 13:22:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In190553775 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In190553775 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In190553775 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In190553775 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out190553775|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In190553775 |P1Thread1of1ForFork1_#t~ite60_Out190553775|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In190553775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In190553775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190553775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In190553775} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In190553775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In190553775, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out190553775|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190553775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In190553775} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 13:22:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:22:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:22:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-914550624 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-914550624 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-914550624| ~y$w_buff1~0_In-914550624) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-914550624 |ULTIMATE.start_main_#t~ite63_Out-914550624|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-914550624, ~y~0=~y~0_In-914550624, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-914550624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914550624} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-914550624|, ~y$w_buff1~0=~y$w_buff1~0_In-914550624, ~y~0=~y~0_In-914550624, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-914550624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914550624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:22:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:22:15,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1143856492 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1143856492 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite65_Out1143856492|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1143856492 |ULTIMATE.start_main_#t~ite65_Out1143856492|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1143856492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1143856492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1143856492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1143856492, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1143856492|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 13:22:15,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In857443629 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In857443629 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In857443629 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In857443629 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In857443629 |ULTIMATE.start_main_#t~ite66_Out857443629|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite66_Out857443629|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In857443629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In857443629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In857443629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In857443629} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In857443629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In857443629, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out857443629|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In857443629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In857443629} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 13:22:15,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1202520871 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1202520871 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out1202520871|)) (and (= ~y$r_buff0_thd0~0_In1202520871 |ULTIMATE.start_main_#t~ite67_Out1202520871|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1202520871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1202520871} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1202520871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1202520871, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1202520871|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 13:22:15,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-358025917 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-358025917 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-358025917 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-358025917 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out-358025917| 0)) (and (= |ULTIMATE.start_main_#t~ite68_Out-358025917| ~y$r_buff1_thd0~0_In-358025917) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-358025917, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-358025917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-358025917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-358025917} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-358025917, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-358025917, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-358025917|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-358025917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-358025917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 13:22:15,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In590632447 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out590632447| ~y$mem_tmp~0_In590632447)) (and (= ~y~0_In590632447 |ULTIMATE.start_main_#t~ite91_Out590632447|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In590632447, ~y$flush_delayed~0=~y$flush_delayed~0_In590632447, ~y~0=~y~0_In590632447} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In590632447, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out590632447|, ~y$flush_delayed~0=~y$flush_delayed~0_In590632447, ~y~0=~y~0_In590632447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 13:22:15,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:22:15,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:22:15 BasicIcfg [2019-12-07 13:22:15,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:22:15,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:22:15,952 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:22:15,952 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:22:15,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:21:40" (3/4) ... [2019-12-07 13:22:15,953 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:22:15,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~__unbuffered_p1_EAX~0_80) (= v_~y$r_buff1_thd1~0_174 0) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1599~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1599~0.base_28|) |v_ULTIMATE.start_main_~#t1599~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1599~0.base_28| 1) |v_#valid_50|) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1599~0.base_28| 4)) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1599~0.base_28|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1599~0.base_28|)) (= 0 |v_ULTIMATE.start_main_~#t1599~0.offset_20|) (= v_~weak$$choice2~0_358 0) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1600~0.offset=|v_ULTIMATE.start_main_~#t1600~0.offset_15|, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_~#t1599~0.base=|v_ULTIMATE.start_main_~#t1599~0.base_28|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1599~0.offset=|v_ULTIMATE.start_main_~#t1599~0.offset_20|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1600~0.base=|v_ULTIMATE.start_main_~#t1600~0.base_18|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_~#t1600~0.offset, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1599~0.base, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_~#t1599~0.offset, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1600~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:22:15,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1600~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1600~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1600~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1600~0.offset_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1600~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1600~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1600~0.base_13|) |v_ULTIMATE.start_main_~#t1600~0.offset_11| 1))) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1600~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1600~0.offset=|v_ULTIMATE.start_main_~#t1600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1600~0.base=|v_ULTIMATE.start_main_~#t1600~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1600~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1600~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 13:22:15,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_6|) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4 0)) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_6|)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_6|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_6|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_4, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-07 13:22:15,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1586458856 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1586458856 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1586458856| ~y$w_buff1~0_In1586458856) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1586458856| ~y$w_buff0~0_In1586458856)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1586458856, ~y$w_buff1~0=~y$w_buff1~0_In1586458856, ~y$w_buff0~0=~y$w_buff0~0_In1586458856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1586458856} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1586458856, ~y$w_buff1~0=~y$w_buff1~0_In1586458856, ~y$w_buff0~0=~y$w_buff0~0_In1586458856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1586458856, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1586458856|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:22:15,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_11|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-07 13:22:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:22:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1923032308 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1923032308| ~y$mem_tmp~0_In-1923032308) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite31_Out-1923032308| ~y~0_In-1923032308) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1923032308, ~y$flush_delayed~0=~y$flush_delayed~0_In-1923032308, ~y~0=~y~0_In-1923032308} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1923032308, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1923032308|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1923032308, ~y~0=~y~0_In-1923032308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:22:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-83167153 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-83167153 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-83167153| |P0Thread1of1ForFork0_#t~ite3_Out-83167153|))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-83167153| ~y$w_buff1~0_In-83167153) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-83167153| ~y~0_In-83167153) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-83167153, ~y$w_buff1~0=~y$w_buff1~0_In-83167153, ~y~0=~y~0_In-83167153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83167153} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-83167153, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-83167153|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-83167153|, ~y$w_buff1~0=~y$w_buff1~0_In-83167153, ~y~0=~y~0_In-83167153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83167153} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 13:22:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1854268009 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1854268009 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1854268009| ~y$w_buff0~0_In-1854268009) (not .cse0) (not .cse1)) (and (= ~y$w_buff1~0_In-1854268009 |P1Thread1of1ForFork1_#t~ite34_Out-1854268009|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854268009, ~y$w_buff1~0=~y$w_buff1~0_In-1854268009, ~y$w_buff0~0=~y$w_buff0~0_In-1854268009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1854268009} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854268009, ~y$w_buff1~0=~y$w_buff1~0_In-1854268009, ~y$w_buff0~0=~y$w_buff0~0_In-1854268009, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1854268009, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1854268009|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:22:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_6|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_6|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_5|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_5|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-07 13:22:15,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_9|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_6|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 13:22:15,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1383967952 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite54_Out-1383967952| ~y$mem_tmp~0_In-1383967952)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-1383967952| ~y~0_In-1383967952)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1383967952, ~y$flush_delayed~0=~y$flush_delayed~0_In-1383967952, ~y~0=~y~0_In-1383967952} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1383967952, ~y$flush_delayed~0=~y$flush_delayed~0_In-1383967952, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1383967952|, ~y~0=~y~0_In-1383967952} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 13:22:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In734818660 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In734818660 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In734818660 |P0Thread1of1ForFork0_#t~ite5_Out734818660|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out734818660|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In734818660, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In734818660} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out734818660|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In734818660, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In734818660} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:22:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1921501966 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1921501966 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1921501966 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1921501966 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1921501966| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1921501966| ~y$w_buff1_used~0_In-1921501966)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1921501966, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1921501966, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1921501966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1921501966} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1921501966|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1921501966, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1921501966, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1921501966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1921501966} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:22:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1097460738 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1097460738 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out1097460738| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In1097460738 |P0Thread1of1ForFork0_#t~ite7_Out1097460738|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1097460738, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1097460738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1097460738, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1097460738|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1097460738} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 13:22:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In999500794 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In999500794 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In999500794 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In999500794 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out999500794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out999500794| ~y$r_buff1_thd1~0_In999500794) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In999500794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999500794, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In999500794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999500794} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In999500794, ~y$w_buff0_used~0=~y$w_buff0_used~0_In999500794, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out999500794|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In999500794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In999500794} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:22:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_30|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:22:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-668593414 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-668593414 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-668593414| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite57_Out-668593414| ~y$w_buff0_used~0_In-668593414)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-668593414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-668593414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-668593414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-668593414, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-668593414|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-07 13:22:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2120596785 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2120596785 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2120596785 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2120596785 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite58_Out-2120596785| ~y$w_buff1_used~0_In-2120596785)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-2120596785|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120596785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120596785, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120596785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120596785} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120596785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120596785, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120596785, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-2120596785|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120596785} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-07 13:22:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out1694831989 ~y$r_buff0_thd2~0_In1694831989)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1694831989 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1694831989 256)))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= ~y$r_buff0_thd2~0_Out1694831989 0) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1694831989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1694831989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1694831989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1694831989, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1694831989|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-07 13:22:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In190553775 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In190553775 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In190553775 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In190553775 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite60_Out190553775|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In190553775 |P1Thread1of1ForFork1_#t~ite60_Out190553775|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In190553775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In190553775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190553775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In190553775} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In190553775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In190553775, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out190553775|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In190553775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In190553775} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 13:22:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:22:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:22:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-914550624 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-914550624 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-914550624| ~y$w_buff1~0_In-914550624) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-914550624 |ULTIMATE.start_main_#t~ite63_Out-914550624|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-914550624, ~y~0=~y~0_In-914550624, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-914550624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914550624} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-914550624|, ~y$w_buff1~0=~y$w_buff1~0_In-914550624, ~y~0=~y~0_In-914550624, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-914550624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914550624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:22:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:22:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1143856492 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1143856492 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite65_Out1143856492|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1143856492 |ULTIMATE.start_main_#t~ite65_Out1143856492|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1143856492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1143856492} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1143856492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1143856492, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1143856492|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 13:22:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In857443629 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In857443629 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In857443629 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In857443629 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In857443629 |ULTIMATE.start_main_#t~ite66_Out857443629|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite66_Out857443629|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In857443629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In857443629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In857443629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In857443629} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In857443629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In857443629, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out857443629|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In857443629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In857443629} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 13:22:15,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1202520871 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1202520871 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out1202520871|)) (and (= ~y$r_buff0_thd0~0_In1202520871 |ULTIMATE.start_main_#t~ite67_Out1202520871|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1202520871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1202520871} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1202520871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1202520871, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1202520871|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 13:22:15,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-358025917 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-358025917 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-358025917 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-358025917 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out-358025917| 0)) (and (= |ULTIMATE.start_main_#t~ite68_Out-358025917| ~y$r_buff1_thd0~0_In-358025917) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-358025917, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-358025917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-358025917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-358025917} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-358025917, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-358025917, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-358025917|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-358025917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-358025917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 13:22:15,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In590632447 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out590632447| ~y$mem_tmp~0_In590632447)) (and (= ~y~0_In590632447 |ULTIMATE.start_main_#t~ite91_Out590632447|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In590632447, ~y$flush_delayed~0=~y$flush_delayed~0_In590632447, ~y~0=~y~0_In590632447} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In590632447, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out590632447|, ~y$flush_delayed~0=~y$flush_delayed~0_In590632447, ~y~0=~y~0_In590632447} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 13:22:15,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:22:16,031 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_220114c4-1c0f-4288-80f1-1c77d5ccf250/bin/uautomizer/witness.graphml [2019-12-07 13:22:16,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:22:16,033 INFO L168 Benchmark]: Toolchain (without parser) took 36387.58 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 937.1 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 13:22:16,033 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:22:16,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:22:16,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:22:16,033 INFO L168 Benchmark]: Boogie Preprocessor took 29.41 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 13:22:16,034 INFO L168 Benchmark]: RCFGBuilder took 514.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.1 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:22:16,034 INFO L168 Benchmark]: TraceAbstraction took 35305.99 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 995.1 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:22:16,034 INFO L168 Benchmark]: Witness Printer took 80.23 ms. Allocated memory is still 4.2 GB. Free memory was 2.9 GB in the beginning and 2.8 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:22:16,035 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -135.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.41 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. * RCFGBuilder took 514.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.1 MB in the end (delta: 72.4 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35305.99 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 995.1 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 80.23 ms. Allocated memory is still 4.2 GB. Free memory was 2.9 GB in the beginning and 2.8 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 231 ProgramPointsBefore, 147 ProgramPointsAfterwards, 307 TransitionsBefore, 184 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 42 ChoiceCompositions, 15276 VarBasedMoverChecksPositive, 410 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 446 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 232725 CheckedPairsTotal, 139 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6219 SDtfs, 7240 SDslu, 21820 SDs, 0 SdLazy, 8946 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 34 SyntacticMatches, 18 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88554occurred 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: 13.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 91506 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1143 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1037 ConstructedInterpolants, 0 QuantifiedInterpolants, 344495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...