./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/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 4bbc7adf3b1587df42287a10f9978222d81bf8ed ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:14:43,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:14:43,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:14:43,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:14:43,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:14:43,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:14:43,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:14:43,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:14:43,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:14:43,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:14:43,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:14:43,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:14:43,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:14:43,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:14:43,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:14:43,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:14:43,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:14:43,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:14:43,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:14:43,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:14:43,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:14:43,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:14:43,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:14:43,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:14:43,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:14:43,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:14:43,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:14:43,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:14:43,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:14:43,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:14:43,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:14:43,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:14:43,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:14:43,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:14:43,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:14:43,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:14:43,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:14:43,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:14:43,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:14:43,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:14:43,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:14:43,381 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:14:43,391 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:14:43,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:14:43,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:14:43,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:14:43,392 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:14:43,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:14:43,392 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:14:43,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:14:43,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:14:43,394 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:14:43,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:14:43,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:14:43,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:14:43,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:14:43,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:14:43,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:14:43,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:14:43,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:14:43,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:14:43,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:14:43,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:14:43,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:14:43,395 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:14:43,395 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_a09ffb8b-7f9f-45b1-acc3-443507197b8b/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 -> 4bbc7adf3b1587df42287a10f9978222d81bf8ed [2019-12-07 18:14:43,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:14:43,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:14:43,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:14:43,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:14:43,511 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:14:43,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2019-12-07 18:14:43,555 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/data/241e8b8a2/bac350743c694124b367432a3f795df9/FLAGc08ed8819 [2019-12-07 18:14:43,977 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:14:43,978 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2019-12-07 18:14:43,991 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/data/241e8b8a2/bac350743c694124b367432a3f795df9/FLAGc08ed8819 [2019-12-07 18:14:44,341 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/data/241e8b8a2/bac350743c694124b367432a3f795df9 [2019-12-07 18:14:44,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:14:44,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:14:44,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:14:44,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:14:44,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:14:44,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296938c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44, skipping insertion in model container [2019-12-07 18:14:44,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:14:44,395 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:14:44,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:14:44,670 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:14:44,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:14:44,759 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:14:44,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44 WrapperNode [2019-12-07 18:14:44,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:14:44,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:14:44,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:14:44,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:14:44,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:14:44,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:14:44,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:14:44,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:14:44,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... [2019-12-07 18:14:44,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:14:44,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:14:44,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:14:44,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:14:44,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:14:44,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:14:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:14:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:14:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:14:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:14:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:14:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:14:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 18:14:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:14:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:14:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:14:44,875 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:14:45,326 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:14:45,326 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 18:14:45,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:14:45 BoogieIcfgContainer [2019-12-07 18:14:45,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:14:45,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:14:45,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:14:45,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:14:45,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:14:44" (1/3) ... [2019-12-07 18:14:45,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62be1624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:14:45, skipping insertion in model container [2019-12-07 18:14:45,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:14:44" (2/3) ... [2019-12-07 18:14:45,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62be1624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:14:45, skipping insertion in model container [2019-12-07 18:14:45,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:14:45" (3/3) ... [2019-12-07 18:14:45,332 INFO L109 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2019-12-07 18:14:45,338 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:14:45,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:14:45,343 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:14:45,344 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:14:45,427 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:14:45,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:14:45,444 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:14:45,444 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:14:45,444 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:14:45,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:14:45,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:14:45,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:14:45,445 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:14:45,459 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 330 transitions [2019-12-07 18:14:45,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 267 places, 330 transitions [2019-12-07 18:14:45,552 INFO L134 PetriNetUnfolder]: 76/326 cut-off events. [2019-12-07 18:14:45,552 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:14:45,572 INFO L76 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 326 events. 76/326 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1501 event pairs. 12/261 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2019-12-07 18:14:45,621 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 267 places, 330 transitions [2019-12-07 18:14:45,682 INFO L134 PetriNetUnfolder]: 76/326 cut-off events. [2019-12-07 18:14:45,682 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:14:45,698 INFO L76 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 326 events. 76/326 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1501 event pairs. 12/261 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2019-12-07 18:14:45,745 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 47706 [2019-12-07 18:14:45,746 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:14:50,703 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 142 [2019-12-07 18:14:50,873 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-12-07 18:14:50,918 INFO L206 etLargeBlockEncoding]: Checked pairs total: 272029 [2019-12-07 18:14:50,918 INFO L214 etLargeBlockEncoding]: Total number of compositions: 201 [2019-12-07 18:14:50,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 163 transitions [2019-12-07 18:20:52,176 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 672692 states. [2019-12-07 18:20:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 672692 states. [2019-12-07 18:20:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:20:52,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:52,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:52,259 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:52,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1910361877, now seen corresponding path program 1 times [2019-12-07 18:20:52,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:52,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946709601] [2019-12-07 18:20:52,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:52,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946709601] [2019-12-07 18:20:52,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:52,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:52,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235521651] [2019-12-07 18:20:52,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:52,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:52,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:52,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:52,490 INFO L87 Difference]: Start difference. First operand 672692 states. Second operand 4 states. [2019-12-07 18:20:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:55,677 INFO L93 Difference]: Finished difference Result 439060 states and 2144914 transitions. [2019-12-07 18:20:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:55,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 18:20:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:57,130 INFO L225 Difference]: With dead ends: 439060 [2019-12-07 18:20:57,130 INFO L226 Difference]: Without dead ends: 377774 [2019-12-07 18:20:57,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377774 states. [2019-12-07 18:21:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377774 to 377774. [2019-12-07 18:21:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377774 states. [2019-12-07 18:21:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377774 states to 377774 states and 1850263 transitions. [2019-12-07 18:21:47,251 INFO L78 Accepts]: Start accepts. Automaton has 377774 states and 1850263 transitions. Word has length 20 [2019-12-07 18:21:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:47,252 INFO L462 AbstractCegarLoop]: Abstraction has 377774 states and 1850263 transitions. [2019-12-07 18:21:47,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 377774 states and 1850263 transitions. [2019-12-07 18:21:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:21:47,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:47,317 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 18:21:47,317 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:47,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1771493563, now seen corresponding path program 1 times [2019-12-07 18:21:47,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:47,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497225650] [2019-12-07 18:21:47,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:21:47,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497225650] [2019-12-07 18:21:47,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:47,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:47,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859086482] [2019-12-07 18:21:47,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:47,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:47,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:47,401 INFO L87 Difference]: Start difference. First operand 377774 states and 1850263 transitions. Second operand 3 states. [2019-12-07 18:21:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:54,113 INFO L93 Difference]: Finished difference Result 358294 states and 1744382 transitions. [2019-12-07 18:21:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:54,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 18:21:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:55,643 INFO L225 Difference]: With dead ends: 358294 [2019-12-07 18:21:55,643 INFO L226 Difference]: Without dead ends: 358294 [2019-12-07 18:21:55,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358294 states. [2019-12-07 18:22:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358294 to 358294. [2019-12-07 18:22:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358294 states. [2019-12-07 18:22:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358294 states to 358294 states and 1744382 transitions. [2019-12-07 18:22:33,504 INFO L78 Accepts]: Start accepts. Automaton has 358294 states and 1744382 transitions. Word has length 21 [2019-12-07 18:22:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:33,505 INFO L462 AbstractCegarLoop]: Abstraction has 358294 states and 1744382 transitions. [2019-12-07 18:22:33,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 358294 states and 1744382 transitions. [2019-12-07 18:22:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:22:33,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:33,522 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] [2019-12-07 18:22:33,523 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1355205387, now seen corresponding path program 1 times [2019-12-07 18:22:33,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:33,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011313464] [2019-12-07 18:22:33,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:33,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011313464] [2019-12-07 18:22:33,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:33,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:33,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358834056] [2019-12-07 18:22:33,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:33,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:33,605 INFO L87 Difference]: Start difference. First operand 358294 states and 1744382 transitions. Second operand 5 states. [2019-12-07 18:22:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:34,105 INFO L93 Difference]: Finished difference Result 98151 states and 410754 transitions. [2019-12-07 18:22:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:34,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:22:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:34,358 INFO L225 Difference]: With dead ends: 98151 [2019-12-07 18:22:34,358 INFO L226 Difference]: Without dead ends: 78559 [2019-12-07 18:22:34,359 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 18:22:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78559 states. [2019-12-07 18:22:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78559 to 78559. [2019-12-07 18:22:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78559 states. [2019-12-07 18:22:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78559 states to 78559 states and 319765 transitions. [2019-12-07 18:22:41,007 INFO L78 Accepts]: Start accepts. Automaton has 78559 states and 319765 transitions. Word has length 22 [2019-12-07 18:22:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:41,008 INFO L462 AbstractCegarLoop]: Abstraction has 78559 states and 319765 transitions. [2019-12-07 18:22:41,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 78559 states and 319765 transitions. [2019-12-07 18:22:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:22:41,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:41,066 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] [2019-12-07 18:22:41,066 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 491881377, now seen corresponding path program 1 times [2019-12-07 18:22:41,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:41,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211048384] [2019-12-07 18:22:41,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:41,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211048384] [2019-12-07 18:22:41,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:41,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:41,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37091816] [2019-12-07 18:22:41,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:41,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:41,132 INFO L87 Difference]: Start difference. First operand 78559 states and 319765 transitions. Second operand 4 states. [2019-12-07 18:22:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:41,961 INFO L93 Difference]: Finished difference Result 99929 states and 387500 transitions. [2019-12-07 18:22:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:41,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-07 18:22:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:42,199 INFO L225 Difference]: With dead ends: 99929 [2019-12-07 18:22:42,199 INFO L226 Difference]: Without dead ends: 99929 [2019-12-07 18:22:42,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99929 states. [2019-12-07 18:22:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99929 to 98311. [2019-12-07 18:22:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98311 states. [2019-12-07 18:22:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98311 states to 98311 states and 382954 transitions. [2019-12-07 18:22:44,860 INFO L78 Accepts]: Start accepts. Automaton has 98311 states and 382954 transitions. Word has length 32 [2019-12-07 18:22:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:44,860 INFO L462 AbstractCegarLoop]: Abstraction has 98311 states and 382954 transitions. [2019-12-07 18:22:44,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 98311 states and 382954 transitions. [2019-12-07 18:22:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:22:44,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:44,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:44,910 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1494615505, now seen corresponding path program 1 times [2019-12-07 18:22:44,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:44,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688346901] [2019-12-07 18:22:44,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688346901] [2019-12-07 18:22:45,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:45,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:45,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997901432] [2019-12-07 18:22:45,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:45,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:45,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:45,001 INFO L87 Difference]: Start difference. First operand 98311 states and 382954 transitions. Second operand 6 states. [2019-12-07 18:22:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:45,319 INFO L93 Difference]: Finished difference Result 54304 states and 216626 transitions. [2019-12-07 18:22:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:45,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 18:22:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:45,435 INFO L225 Difference]: With dead ends: 54304 [2019-12-07 18:22:45,435 INFO L226 Difference]: Without dead ends: 50475 [2019-12-07 18:22:45,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50475 states. [2019-12-07 18:22:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50475 to 50475. [2019-12-07 18:22:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50475 states. [2019-12-07 18:22:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50475 states to 50475 states and 203464 transitions. [2019-12-07 18:22:46,926 INFO L78 Accepts]: Start accepts. Automaton has 50475 states and 203464 transitions. Word has length 33 [2019-12-07 18:22:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:46,926 INFO L462 AbstractCegarLoop]: Abstraction has 50475 states and 203464 transitions. [2019-12-07 18:22:46,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 50475 states and 203464 transitions. [2019-12-07 18:22:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:22:47,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:47,004 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] [2019-12-07 18:22:47,005 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:47,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 50018067, now seen corresponding path program 1 times [2019-12-07 18:22:47,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:47,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429282352] [2019-12-07 18:22:47,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:47,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429282352] [2019-12-07 18:22:47,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:47,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:47,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355088225] [2019-12-07 18:22:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:47,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:47,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:47,093 INFO L87 Difference]: Start difference. First operand 50475 states and 203464 transitions. Second operand 3 states. [2019-12-07 18:22:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:47,315 INFO L93 Difference]: Finished difference Result 50475 states and 201363 transitions. [2019-12-07 18:22:47,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:47,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-07 18:22:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:47,428 INFO L225 Difference]: With dead ends: 50475 [2019-12-07 18:22:47,428 INFO L226 Difference]: Without dead ends: 50475 [2019-12-07 18:22:47,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50475 states. [2019-12-07 18:22:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50475 to 50475. [2019-12-07 18:22:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50475 states. [2019-12-07 18:22:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50475 states to 50475 states and 201363 transitions. [2019-12-07 18:22:48,614 INFO L78 Accepts]: Start accepts. Automaton has 50475 states and 201363 transitions. Word has length 47 [2019-12-07 18:22:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:48,614 INFO L462 AbstractCegarLoop]: Abstraction has 50475 states and 201363 transitions. [2019-12-07 18:22:48,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50475 states and 201363 transitions. [2019-12-07 18:22:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:22:48,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:48,691 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] [2019-12-07 18:22:48,691 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1324699336, now seen corresponding path program 1 times [2019-12-07 18:22:48,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:48,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843006017] [2019-12-07 18:22:48,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:48,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843006017] [2019-12-07 18:22:48,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:48,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:48,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060033910] [2019-12-07 18:22:48,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:48,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:48,763 INFO L87 Difference]: Start difference. First operand 50475 states and 201363 transitions. Second operand 3 states. [2019-12-07 18:22:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:49,157 INFO L93 Difference]: Finished difference Result 50475 states and 201268 transitions. [2019-12-07 18:22:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:49,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 18:22:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:49,274 INFO L225 Difference]: With dead ends: 50475 [2019-12-07 18:22:49,275 INFO L226 Difference]: Without dead ends: 50475 [2019-12-07 18:22:49,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50475 states. [2019-12-07 18:22:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50475 to 49770. [2019-12-07 18:22:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49770 states. [2019-12-07 18:22:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49770 states to 49770 states and 199118 transitions. [2019-12-07 18:22:50,475 INFO L78 Accepts]: Start accepts. Automaton has 49770 states and 199118 transitions. Word has length 48 [2019-12-07 18:22:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:50,475 INFO L462 AbstractCegarLoop]: Abstraction has 49770 states and 199118 transitions. [2019-12-07 18:22:50,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 49770 states and 199118 transitions. [2019-12-07 18:22:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:22:50,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:50,543 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] [2019-12-07 18:22:50,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1447062552, now seen corresponding path program 1 times [2019-12-07 18:22:50,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:50,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223268767] [2019-12-07 18:22:50,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:50,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223268767] [2019-12-07 18:22:50,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:50,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:50,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829539967] [2019-12-07 18:22:50,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:50,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:50,592 INFO L87 Difference]: Start difference. First operand 49770 states and 199118 transitions. Second operand 3 states. [2019-12-07 18:22:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:50,801 INFO L93 Difference]: Finished difference Result 49727 states and 198974 transitions. [2019-12-07 18:22:50,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:50,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-07 18:22:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:50,912 INFO L225 Difference]: With dead ends: 49727 [2019-12-07 18:22:50,912 INFO L226 Difference]: Without dead ends: 49727 [2019-12-07 18:22:50,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49727 states. [2019-12-07 18:22:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49727 to 49727. [2019-12-07 18:22:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49727 states. [2019-12-07 18:22:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49727 states to 49727 states and 198974 transitions. [2019-12-07 18:22:52,167 INFO L78 Accepts]: Start accepts. Automaton has 49727 states and 198974 transitions. Word has length 49 [2019-12-07 18:22:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,167 INFO L462 AbstractCegarLoop]: Abstraction has 49727 states and 198974 transitions. [2019-12-07 18:22:52,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49727 states and 198974 transitions. [2019-12-07 18:22:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:22:52,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,234 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] [2019-12-07 18:22:52,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1480611640, now seen corresponding path program 1 times [2019-12-07 18:22:52,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:52,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487188913] [2019-12-07 18:22:52,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:52,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487188913] [2019-12-07 18:22:52,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:52,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881816099] [2019-12-07 18:22:52,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:22:52,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:52,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:22:52,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:52,309 INFO L87 Difference]: Start difference. First operand 49727 states and 198974 transitions. Second operand 7 states. [2019-12-07 18:22:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:52,576 INFO L93 Difference]: Finished difference Result 48196 states and 195209 transitions. [2019-12-07 18:22:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:52,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 18:22:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:52,677 INFO L225 Difference]: With dead ends: 48196 [2019-12-07 18:22:52,677 INFO L226 Difference]: Without dead ends: 48034 [2019-12-07 18:22:52,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48034 states. [2019-12-07 18:22:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48034 to 48034. [2019-12-07 18:22:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 18:22:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 194835 transitions. [2019-12-07 18:22:53,784 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 194835 transitions. Word has length 49 [2019-12-07 18:22:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:53,785 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 194835 transitions. [2019-12-07 18:22:53,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:22:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 194835 transitions. [2019-12-07 18:22:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:22:53,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:53,849 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] [2019-12-07 18:22:53,849 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:53,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1315204172, now seen corresponding path program 1 times [2019-12-07 18:22:53,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:53,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801480918] [2019-12-07 18:22:53,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:54,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801480918] [2019-12-07 18:22:54,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:54,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:22:54,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572278829] [2019-12-07 18:22:54,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:22:54,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:22:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:54,241 INFO L87 Difference]: Start difference. First operand 48034 states and 194835 transitions. Second operand 13 states. [2019-12-07 18:22:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:56,198 INFO L93 Difference]: Finished difference Result 89422 states and 350033 transitions. [2019-12-07 18:22:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:22:56,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 18:22:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:56,384 INFO L225 Difference]: With dead ends: 89422 [2019-12-07 18:22:56,384 INFO L226 Difference]: Without dead ends: 89160 [2019-12-07 18:22:56,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:22:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89160 states. [2019-12-07 18:22:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89160 to 54809. [2019-12-07 18:22:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54809 states. [2019-12-07 18:22:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54809 states to 54809 states and 225597 transitions. [2019-12-07 18:22:58,183 INFO L78 Accepts]: Start accepts. Automaton has 54809 states and 225597 transitions. Word has length 66 [2019-12-07 18:22:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:58,184 INFO L462 AbstractCegarLoop]: Abstraction has 54809 states and 225597 transitions. [2019-12-07 18:22:58,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:22:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 54809 states and 225597 transitions. [2019-12-07 18:22:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:22:58,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:58,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] [2019-12-07 18:22:58,264 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:58,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash 355750782, now seen corresponding path program 2 times [2019-12-07 18:22:58,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:58,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734486962] [2019-12-07 18:22:58,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:58,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734486962] [2019-12-07 18:22:58,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:58,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:22:58,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498825905] [2019-12-07 18:22:58,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:22:58,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:22:58,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:58,465 INFO L87 Difference]: Start difference. First operand 54809 states and 225597 transitions. Second operand 13 states. [2019-12-07 18:23:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:00,979 INFO L93 Difference]: Finished difference Result 112987 states and 435364 transitions. [2019-12-07 18:23:00,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:23:00,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 18:23:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:01,230 INFO L225 Difference]: With dead ends: 112987 [2019-12-07 18:23:01,230 INFO L226 Difference]: Without dead ends: 112862 [2019-12-07 18:23:01,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:23:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112862 states. [2019-12-07 18:23:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112862 to 54813. [2019-12-07 18:23:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54813 states. [2019-12-07 18:23:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54813 states to 54813 states and 225604 transitions. [2019-12-07 18:23:03,129 INFO L78 Accepts]: Start accepts. Automaton has 54813 states and 225604 transitions. Word has length 66 [2019-12-07 18:23:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:03,129 INFO L462 AbstractCegarLoop]: Abstraction has 54813 states and 225604 transitions. [2019-12-07 18:23:03,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:23:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 54813 states and 225604 transitions. [2019-12-07 18:23:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:03,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:03,214 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] [2019-12-07 18:23:03,214 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:03,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2097942006, now seen corresponding path program 3 times [2019-12-07 18:23:03,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:03,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985561936] [2019-12-07 18:23:03,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:03,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985561936] [2019-12-07 18:23:03,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:03,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:03,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126730615] [2019-12-07 18:23:03,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:23:03,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:23:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:23:03,442 INFO L87 Difference]: Start difference. First operand 54813 states and 225604 transitions. Second operand 12 states. [2019-12-07 18:23:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:04,316 INFO L93 Difference]: Finished difference Result 93952 states and 367881 transitions. [2019-12-07 18:23:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:23:04,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 18:23:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:04,511 INFO L225 Difference]: With dead ends: 93952 [2019-12-07 18:23:04,511 INFO L226 Difference]: Without dead ends: 93915 [2019-12-07 18:23:04,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:23:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93915 states. [2019-12-07 18:23:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93915 to 55049. [2019-12-07 18:23:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55049 states. [2019-12-07 18:23:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55049 states to 55049 states and 226143 transitions. [2019-12-07 18:23:06,294 INFO L78 Accepts]: Start accepts. Automaton has 55049 states and 226143 transitions. Word has length 66 [2019-12-07 18:23:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:06,294 INFO L462 AbstractCegarLoop]: Abstraction has 55049 states and 226143 transitions. [2019-12-07 18:23:06,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:23:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 55049 states and 226143 transitions. [2019-12-07 18:23:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:06,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:06,378 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] [2019-12-07 18:23:06,378 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:06,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:06,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1768941228, now seen corresponding path program 4 times [2019-12-07 18:23:06,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:06,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466525388] [2019-12-07 18:23:06,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:06,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466525388] [2019-12-07 18:23:06,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:06,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:06,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751900866] [2019-12-07 18:23:06,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:23:06,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:06,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:23:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:23:06,572 INFO L87 Difference]: Start difference. First operand 55049 states and 226143 transitions. Second operand 12 states. [2019-12-07 18:23:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:07,583 INFO L93 Difference]: Finished difference Result 96058 states and 373382 transitions. [2019-12-07 18:23:07,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:23:07,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 18:23:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:07,780 INFO L225 Difference]: With dead ends: 96058 [2019-12-07 18:23:07,780 INFO L226 Difference]: Without dead ends: 95825 [2019-12-07 18:23:07,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:23:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95825 states. [2019-12-07 18:23:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95825 to 54856. [2019-12-07 18:23:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54856 states. [2019-12-07 18:23:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54856 states to 54856 states and 225677 transitions. [2019-12-07 18:23:09,672 INFO L78 Accepts]: Start accepts. Automaton has 54856 states and 225677 transitions. Word has length 66 [2019-12-07 18:23:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:09,672 INFO L462 AbstractCegarLoop]: Abstraction has 54856 states and 225677 transitions. [2019-12-07 18:23:09,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:23:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 54856 states and 225677 transitions. [2019-12-07 18:23:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:09,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:09,758 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] [2019-12-07 18:23:09,758 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1492823552, now seen corresponding path program 5 times [2019-12-07 18:23:09,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:09,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030866527] [2019-12-07 18:23:09,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:09,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030866527] [2019-12-07 18:23:09,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:09,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:09,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494180786] [2019-12-07 18:23:09,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:23:09,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:09,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:23:09,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:23:09,967 INFO L87 Difference]: Start difference. First operand 54856 states and 225677 transitions. Second operand 12 states. [2019-12-07 18:23:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:11,196 INFO L93 Difference]: Finished difference Result 84183 states and 331906 transitions. [2019-12-07 18:23:11,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:23:11,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 18:23:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:11,372 INFO L225 Difference]: With dead ends: 84183 [2019-12-07 18:23:11,372 INFO L226 Difference]: Without dead ends: 84065 [2019-12-07 18:23:11,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:23:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84065 states. [2019-12-07 18:23:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84065 to 55090. [2019-12-07 18:23:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55090 states. [2019-12-07 18:23:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55090 states to 55090 states and 226236 transitions. [2019-12-07 18:23:12,920 INFO L78 Accepts]: Start accepts. Automaton has 55090 states and 226236 transitions. Word has length 66 [2019-12-07 18:23:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:12,920 INFO L462 AbstractCegarLoop]: Abstraction has 55090 states and 226236 transitions. [2019-12-07 18:23:12,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:23:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55090 states and 226236 transitions. [2019-12-07 18:23:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:13,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:13,005 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] [2019-12-07 18:23:13,005 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1064739490, now seen corresponding path program 6 times [2019-12-07 18:23:13,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:13,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913765859] [2019-12-07 18:23:13,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:13,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913765859] [2019-12-07 18:23:13,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:13,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:13,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915289200] [2019-12-07 18:23:13,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:23:13,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:13,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:23:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:23:13,187 INFO L87 Difference]: Start difference. First operand 55090 states and 226236 transitions. Second operand 12 states. [2019-12-07 18:23:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:14,413 INFO L93 Difference]: Finished difference Result 86225 states and 337286 transitions. [2019-12-07 18:23:14,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:23:14,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 18:23:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:14,591 INFO L225 Difference]: With dead ends: 86225 [2019-12-07 18:23:14,591 INFO L226 Difference]: Without dead ends: 85892 [2019-12-07 18:23:14,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:23:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85892 states. [2019-12-07 18:23:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85892 to 54797. [2019-12-07 18:23:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54797 states. [2019-12-07 18:23:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54797 states to 54797 states and 225546 transitions. [2019-12-07 18:23:16,151 INFO L78 Accepts]: Start accepts. Automaton has 54797 states and 225546 transitions. Word has length 66 [2019-12-07 18:23:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:16,151 INFO L462 AbstractCegarLoop]: Abstraction has 54797 states and 225546 transitions. [2019-12-07 18:23:16,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:23:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 54797 states and 225546 transitions. [2019-12-07 18:23:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:16,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:16,235 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] [2019-12-07 18:23:16,235 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1042002470, now seen corresponding path program 7 times [2019-12-07 18:23:16,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:16,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687523274] [2019-12-07 18:23:16,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:16,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687523274] [2019-12-07 18:23:16,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:16,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:23:16,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569188030] [2019-12-07 18:23:16,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:23:16,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:23:16,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:23:16,401 INFO L87 Difference]: Start difference. First operand 54797 states and 225546 transitions. Second operand 13 states. [2019-12-07 18:23:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:18,247 INFO L93 Difference]: Finished difference Result 92613 states and 361193 transitions. [2019-12-07 18:23:18,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:23:18,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-07 18:23:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:18,430 INFO L225 Difference]: With dead ends: 92613 [2019-12-07 18:23:18,430 INFO L226 Difference]: Without dead ends: 92351 [2019-12-07 18:23:18,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:23:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92351 states. [2019-12-07 18:23:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92351 to 54964. [2019-12-07 18:23:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54964 states. [2019-12-07 18:23:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54964 states to 54964 states and 225906 transitions. [2019-12-07 18:23:20,043 INFO L78 Accepts]: Start accepts. Automaton has 54964 states and 225906 transitions. Word has length 66 [2019-12-07 18:23:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:20,043 INFO L462 AbstractCegarLoop]: Abstraction has 54964 states and 225906 transitions. [2019-12-07 18:23:20,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:23:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 54964 states and 225906 transitions. [2019-12-07 18:23:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:20,134 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:20,134 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] [2019-12-07 18:23:20,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1389004454, now seen corresponding path program 8 times [2019-12-07 18:23:20,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:20,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100995726] [2019-12-07 18:23:20,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:20,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100995726] [2019-12-07 18:23:20,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:20,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:23:20,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363875967] [2019-12-07 18:23:20,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:23:20,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:23:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:23:20,326 INFO L87 Difference]: Start difference. First operand 54964 states and 225906 transitions. Second operand 14 states. [2019-12-07 18:23:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:23,538 INFO L93 Difference]: Finished difference Result 97115 states and 381247 transitions. [2019-12-07 18:23:23,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:23:23,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-07 18:23:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:23,728 INFO L225 Difference]: With dead ends: 97115 [2019-12-07 18:23:23,728 INFO L226 Difference]: Without dead ends: 96973 [2019-12-07 18:23:23,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:23:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96973 states. [2019-12-07 18:23:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96973 to 54959. [2019-12-07 18:23:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54959 states. [2019-12-07 18:23:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54959 states to 54959 states and 225903 transitions. [2019-12-07 18:23:25,343 INFO L78 Accepts]: Start accepts. Automaton has 54959 states and 225903 transitions. Word has length 66 [2019-12-07 18:23:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:25,343 INFO L462 AbstractCegarLoop]: Abstraction has 54959 states and 225903 transitions. [2019-12-07 18:23:25,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:23:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 54959 states and 225903 transitions. [2019-12-07 18:23:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:25,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:25,427 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] [2019-12-07 18:23:25,427 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -843750588, now seen corresponding path program 9 times [2019-12-07 18:23:25,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:25,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952344115] [2019-12-07 18:23:25,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:25,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952344115] [2019-12-07 18:23:25,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:25,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:23:25,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674891788] [2019-12-07 18:23:25,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:23:25,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:25,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:23:25,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:23:25,592 INFO L87 Difference]: Start difference. First operand 54959 states and 225903 transitions. Second operand 12 states. [2019-12-07 18:23:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:26,606 INFO L93 Difference]: Finished difference Result 103664 states and 403027 transitions. [2019-12-07 18:23:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:23:26,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 18:23:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:26,834 INFO L225 Difference]: With dead ends: 103664 [2019-12-07 18:23:26,834 INFO L226 Difference]: Without dead ends: 103610 [2019-12-07 18:23:26,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:23:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103610 states. [2019-12-07 18:23:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103610 to 55315. [2019-12-07 18:23:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55315 states. [2019-12-07 18:23:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55315 states to 55315 states and 226756 transitions. [2019-12-07 18:23:28,648 INFO L78 Accepts]: Start accepts. Automaton has 55315 states and 226756 transitions. Word has length 66 [2019-12-07 18:23:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:28,649 INFO L462 AbstractCegarLoop]: Abstraction has 55315 states and 226756 transitions. [2019-12-07 18:23:28,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:23:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 55315 states and 226756 transitions. [2019-12-07 18:23:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:28,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:28,734 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] [2019-12-07 18:23:28,734 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:28,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1271834650, now seen corresponding path program 10 times [2019-12-07 18:23:28,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:28,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070594297] [2019-12-07 18:23:28,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:29,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070594297] [2019-12-07 18:23:29,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:29,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 18:23:29,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347716678] [2019-12-07 18:23:29,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:23:29,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:23:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:23:29,506 INFO L87 Difference]: Start difference. First operand 55315 states and 226756 transitions. Second operand 21 states. [2019-12-07 18:23:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:33,223 INFO L93 Difference]: Finished difference Result 78077 states and 328416 transitions. [2019-12-07 18:23:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:23:33,223 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-07 18:23:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:33,398 INFO L225 Difference]: With dead ends: 78077 [2019-12-07 18:23:33,398 INFO L226 Difference]: Without dead ends: 77657 [2019-12-07 18:23:33,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:23:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77657 states. [2019-12-07 18:23:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77657 to 56220. [2019-12-07 18:23:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56220 states. [2019-12-07 18:23:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56220 states to 56220 states and 229968 transitions. [2019-12-07 18:23:35,072 INFO L78 Accepts]: Start accepts. Automaton has 56220 states and 229968 transitions. Word has length 66 [2019-12-07 18:23:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:35,072 INFO L462 AbstractCegarLoop]: Abstraction has 56220 states and 229968 transitions. [2019-12-07 18:23:35,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:23:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56220 states and 229968 transitions. [2019-12-07 18:23:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:35,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:35,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:35,160 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1338581292, now seen corresponding path program 11 times [2019-12-07 18:23:35,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:35,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105485537] [2019-12-07 18:23:35,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:35,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105485537] [2019-12-07 18:23:35,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:35,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 18:23:35,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915861544] [2019-12-07 18:23:35,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 18:23:35,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:35,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 18:23:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:23:35,644 INFO L87 Difference]: Start difference. First operand 56220 states and 229968 transitions. Second operand 20 states. [2019-12-07 18:23:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:39,497 INFO L93 Difference]: Finished difference Result 79986 states and 335863 transitions. [2019-12-07 18:23:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:23:39,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-07 18:23:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:39,677 INFO L225 Difference]: With dead ends: 79986 [2019-12-07 18:23:39,677 INFO L226 Difference]: Without dead ends: 79929 [2019-12-07 18:23:39,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:23:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79929 states. [2019-12-07 18:23:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79929 to 56653. [2019-12-07 18:23:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56653 states. [2019-12-07 18:23:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56653 states to 56653 states and 231508 transitions. [2019-12-07 18:23:41,455 INFO L78 Accepts]: Start accepts. Automaton has 56653 states and 231508 transitions. Word has length 66 [2019-12-07 18:23:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:41,455 INFO L462 AbstractCegarLoop]: Abstraction has 56653 states and 231508 transitions. [2019-12-07 18:23:41,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 18:23:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 56653 states and 231508 transitions. [2019-12-07 18:23:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:41,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:41,539 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] [2019-12-07 18:23:41,540 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1674746120, now seen corresponding path program 12 times [2019-12-07 18:23:41,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:41,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988925615] [2019-12-07 18:23:41,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:41,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988925615] [2019-12-07 18:23:41,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:41,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 18:23:41,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269653409] [2019-12-07 18:23:41,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:23:41,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:41,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:23:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:23:41,995 INFO L87 Difference]: Start difference. First operand 56653 states and 231508 transitions. Second operand 21 states. [2019-12-07 18:23:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:45,346 INFO L93 Difference]: Finished difference Result 71030 states and 293540 transitions. [2019-12-07 18:23:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:23:45,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-07 18:23:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:45,503 INFO L225 Difference]: With dead ends: 71030 [2019-12-07 18:23:45,503 INFO L226 Difference]: Without dead ends: 70973 [2019-12-07 18:23:45,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:23:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70973 states. [2019-12-07 18:23:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70973 to 56762. [2019-12-07 18:23:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56762 states. [2019-12-07 18:23:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56762 states to 56762 states and 231784 transitions. [2019-12-07 18:23:46,985 INFO L78 Accepts]: Start accepts. Automaton has 56762 states and 231784 transitions. Word has length 66 [2019-12-07 18:23:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:46,985 INFO L462 AbstractCegarLoop]: Abstraction has 56762 states and 231784 transitions. [2019-12-07 18:23:46,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:23:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56762 states and 231784 transitions. [2019-12-07 18:23:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:47,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:47,072 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] [2019-12-07 18:23:47,073 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:47,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:47,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1729354056, now seen corresponding path program 13 times [2019-12-07 18:23:47,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:47,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797693968] [2019-12-07 18:23:47,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:47,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797693968] [2019-12-07 18:23:47,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:47,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 18:23:47,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655183804] [2019-12-07 18:23:47,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 18:23:47,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 18:23:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:23:47,786 INFO L87 Difference]: Start difference. First operand 56762 states and 231784 transitions. Second operand 22 states. [2019-12-07 18:23:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:53,703 INFO L93 Difference]: Finished difference Result 71414 states and 294347 transitions. [2019-12-07 18:23:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 18:23:53,705 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-07 18:23:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:53,880 INFO L225 Difference]: With dead ends: 71414 [2019-12-07 18:23:53,880 INFO L226 Difference]: Without dead ends: 71095 [2019-12-07 18:23:53,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=288, Invalid=1874, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 18:23:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71095 states. [2019-12-07 18:23:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71095 to 57406. [2019-12-07 18:23:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57406 states. [2019-12-07 18:23:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57406 states to 57406 states and 233804 transitions. [2019-12-07 18:23:55,373 INFO L78 Accepts]: Start accepts. Automaton has 57406 states and 233804 transitions. Word has length 66 [2019-12-07 18:23:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:55,373 INFO L462 AbstractCegarLoop]: Abstraction has 57406 states and 233804 transitions. [2019-12-07 18:23:55,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 18:23:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 57406 states and 233804 transitions. [2019-12-07 18:23:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:55,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:55,462 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] [2019-12-07 18:23:55,462 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash 300010866, now seen corresponding path program 14 times [2019-12-07 18:23:55,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:55,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467988318] [2019-12-07 18:23:55,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:56,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467988318] [2019-12-07 18:23:56,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:56,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-07 18:23:56,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708734492] [2019-12-07 18:23:56,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 18:23:56,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 18:23:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2019-12-07 18:23:56,881 INFO L87 Difference]: Start difference. First operand 57406 states and 233804 transitions. Second operand 28 states. [2019-12-07 18:24:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:04,542 INFO L93 Difference]: Finished difference Result 70330 states and 289977 transitions. [2019-12-07 18:24:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:24:04,542 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2019-12-07 18:24:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:04,698 INFO L225 Difference]: With dead ends: 70330 [2019-12-07 18:24:04,698 INFO L226 Difference]: Without dead ends: 70309 [2019-12-07 18:24:04,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=183, Invalid=1797, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:24:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70309 states. [2019-12-07 18:24:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70309 to 57660. [2019-12-07 18:24:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57660 states. [2019-12-07 18:24:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57660 states to 57660 states and 234321 transitions. [2019-12-07 18:24:06,181 INFO L78 Accepts]: Start accepts. Automaton has 57660 states and 234321 transitions. Word has length 66 [2019-12-07 18:24:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:06,181 INFO L462 AbstractCegarLoop]: Abstraction has 57660 states and 234321 transitions. [2019-12-07 18:24:06,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 18:24:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 57660 states and 234321 transitions. [2019-12-07 18:24:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:24:06,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:06,431 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] [2019-12-07 18:24:06,431 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash -504691764, now seen corresponding path program 15 times [2019-12-07 18:24:06,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:06,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301927372] [2019-12-07 18:24:06,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:07,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301927372] [2019-12-07 18:24:07,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:07,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-07 18:24:07,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012379189] [2019-12-07 18:24:07,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 18:24:07,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:07,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 18:24:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2019-12-07 18:24:07,980 INFO L87 Difference]: Start difference. First operand 57660 states and 234321 transitions. Second operand 29 states. [2019-12-07 18:24:16,628 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-07 18:24:17,129 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-12-07 18:24:17,564 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 18:24:18,469 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-07 18:24:19,035 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-12-07 18:24:19,288 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-07 18:24:20,040 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 18:24:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:20,510 INFO L93 Difference]: Finished difference Result 70446 states and 290225 transitions. [2019-12-07 18:24:20,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 18:24:20,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2019-12-07 18:24:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:20,677 INFO L225 Difference]: With dead ends: 70446 [2019-12-07 18:24:20,677 INFO L226 Difference]: Without dead ends: 70420 [2019-12-07 18:24:20,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=274, Invalid=2588, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:24:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70420 states. [2019-12-07 18:24:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70420 to 57671. [2019-12-07 18:24:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57671 states. [2019-12-07 18:24:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57671 states to 57671 states and 234340 transitions. [2019-12-07 18:24:22,259 INFO L78 Accepts]: Start accepts. Automaton has 57671 states and 234340 transitions. Word has length 66 [2019-12-07 18:24:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:22,259 INFO L462 AbstractCegarLoop]: Abstraction has 57671 states and 234340 transitions. [2019-12-07 18:24:22,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 18:24:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 57671 states and 234340 transitions. [2019-12-07 18:24:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:24:22,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:22,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:22,348 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1607175844, now seen corresponding path program 16 times [2019-12-07 18:24:22,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:22,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848791418] [2019-12-07 18:24:22,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:24,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848791418] [2019-12-07 18:24:24,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:24,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-12-07 18:24:24,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467790012] [2019-12-07 18:24:24,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:24:24,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:24:24,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:24:24,140 INFO L87 Difference]: Start difference. First operand 57671 states and 234340 transitions. Second operand 31 states. [2019-12-07 18:24:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:34,007 INFO L93 Difference]: Finished difference Result 70723 states and 289768 transitions. [2019-12-07 18:24:34,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 18:24:34,007 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2019-12-07 18:24:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:34,153 INFO L225 Difference]: With dead ends: 70723 [2019-12-07 18:24:34,153 INFO L226 Difference]: Without dead ends: 70689 [2019-12-07 18:24:34,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=228, Invalid=2424, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 18:24:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70689 states. [2019-12-07 18:24:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70689 to 58268. [2019-12-07 18:24:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58268 states. [2019-12-07 18:24:35,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58268 states to 58268 states and 235731 transitions. [2019-12-07 18:24:35,603 INFO L78 Accepts]: Start accepts. Automaton has 58268 states and 235731 transitions. Word has length 66 [2019-12-07 18:24:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:35,604 INFO L462 AbstractCegarLoop]: Abstraction has 58268 states and 235731 transitions. [2019-12-07 18:24:35,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:24:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 58268 states and 235731 transitions. [2019-12-07 18:24:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:24:35,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:35,693 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] [2019-12-07 18:24:35,693 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1847718292, now seen corresponding path program 17 times [2019-12-07 18:24:35,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:35,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609502912] [2019-12-07 18:24:35,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:36,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609502912] [2019-12-07 18:24:36,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:36,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-07 18:24:36,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405470010] [2019-12-07 18:24:36,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 18:24:36,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:36,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 18:24:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:24:36,627 INFO L87 Difference]: Start difference. First operand 58268 states and 235731 transitions. Second operand 25 states. [2019-12-07 18:24:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:42,160 INFO L93 Difference]: Finished difference Result 72169 states and 296063 transitions. [2019-12-07 18:24:42,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:24:42,161 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2019-12-07 18:24:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:42,457 INFO L225 Difference]: With dead ends: 72169 [2019-12-07 18:24:42,457 INFO L226 Difference]: Without dead ends: 72139 [2019-12-07 18:24:42,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:24:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72139 states. [2019-12-07 18:24:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72139 to 58276. [2019-12-07 18:24:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58276 states. [2019-12-07 18:24:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58276 states to 58276 states and 235743 transitions. [2019-12-07 18:24:43,917 INFO L78 Accepts]: Start accepts. Automaton has 58276 states and 235743 transitions. Word has length 66 [2019-12-07 18:24:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:43,918 INFO L462 AbstractCegarLoop]: Abstraction has 58276 states and 235743 transitions. [2019-12-07 18:24:43,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 18:24:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 58276 states and 235743 transitions. [2019-12-07 18:24:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:24:44,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:44,006 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] [2019-12-07 18:24:44,007 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:44,007 INFO L82 PathProgramCache]: Analyzing trace with hash -227174948, now seen corresponding path program 18 times [2019-12-07 18:24:44,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:44,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174269398] [2019-12-07 18:24:44,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:24:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:24:44,107 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:24:44,107 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:24:44,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1415] [1415] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse1 (store |v_#valid_102| 0 0))) (let ((.cse0 (store .cse1 |v_~#y~0.base_280| 1))) (and (= |v_#length_52| (store (store |v_#length_53| |v_~#y~0.base_280| 4) |v_ULTIMATE.start_main_~#t2417~0.base_25| 4)) (= 0 v_~__unbuffered_p0_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd4~0_7) (= v_~y$mem_tmp~0_153 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff1_thd2~0_5 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd3~0_7) (= 0 v_~__unbuffered_p0_EAX$read_delayed~0_73) (= v_~y$flush_delayed~0_193 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd1~0_5) (= |v_#NULL.offset_6| 0) (= 0 v_~y$r_buff1_thd4~0_59) (= (store |v_#memory_int_391| |v_ULTIMATE.start_main_~#t2417~0.base_25| (store (select |v_#memory_int_391| |v_ULTIMATE.start_main_~#t2417~0.base_25|) |v_ULTIMATE.start_main_~#t2417~0.offset_18| 0)) |v_#memory_int_390|) (< 0 |v_#StackHeapBarrier_32|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2417~0.base_25|)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2417~0.base_25|) (< |v_#StackHeapBarrier_32| |v_~#y~0.base_280|) (= v_~main$tmp_guard0~0_28 0) (= v_~y$r_buff0_thd0~0_69 0) (= 0 v_~y$w_buff0~0_208) (= 0 v_~__unbuffered_p0_EAX$w_buff1_used~0_7) (= 0 v_~y$r_buff0_thd3~0_246) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd0~0_7) (= 0 v_~weak$$choice0~0_216) (= 0 v_~weak$$choice1~0_86) (= 0 v_~__unbuffered_p0_EAX$w_buff0~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd2~0_7) (= v_~y$w_buff1_used~0_539 0) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd4~0_7) (= 0 v_~x~0_154) (= v_~__unbuffered_p0_EAX$mem_tmp~0_7 0) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57 0) (= v_~y$w_buff0_used~0_963 0) (= 0 v_~y$r_buff1_thd0~0_71) (= 0 (select .cse1 |v_~#y~0.base_280|)) (= |v_ULTIMATE.start_main_~#t2417~0.offset_18| 0) (= 0 v_~__unbuffered_p2_EAX~0_130) (= v_~__unbuffered_p0_EAX$flush_delayed~0_7 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_317 0) (= 0 (select (select |v_#memory_int_391| |v_~#y~0.base_280|) |v_~#y~0.offset_280|)) (= v_~y$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$w_buff1~0_170 0) (= 0 v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd3~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd0~0_7) (= v_~y$r_buff0_thd1~0_376 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#valid_100| (store .cse0 |v_ULTIMATE.start_main_~#t2417~0.base_25| 1)) (= 0 v_~__unbuffered_p0_EAX$w_buff1~0_7) (= v_~__unbuffered_cnt~0_130 0) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd1~0_6) (= v_~y$r_buff0_thd4~0_67 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd2~0_7) (= 0 |v_~#y~0.offset_280|) (= 0 v_~y$r_buff1_thd3~0_123) (= v_~weak$$choice2~0_197 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_391|, #length=|v_#length_53|} OutVars{ULTIMATE.start_main_#t~nondet97=|v_ULTIMATE.start_main_#t~nondet97_51|, ULTIMATE.start_main_~#t2419~0.offset=|v_ULTIMATE.start_main_~#t2419~0.offset_20|, ~__unbuffered_p0_EAX$r_buff0_thd1~0=v_~__unbuffered_p0_EAX$r_buff0_thd1~0_6, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2418~0.base=|v_ULTIMATE.start_main_~#t2418~0.base_22|, ~__unbuffered_p0_EAX$r_buff1_thd3~0=v_~__unbuffered_p0_EAX$r_buff1_thd3~0_7, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_61|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_39|, ~weak$$choice1~0=v_~weak$$choice1~0_86, ~y$mem_tmp~0=v_~y$mem_tmp~0_153, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_34|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_376, ~__unbuffered_p0_EAX$r_buff0_thd4~0=v_~__unbuffered_p0_EAX$r_buff0_thd4~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_193, #length=|v_#length_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ULTIMATE.start_main_#t~nondet87=|v_ULTIMATE.start_main_#t~nondet87_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~nondet89=|v_ULTIMATE.start_main_#t~nondet89_16|, ULTIMATE.start_main_~#t2419~0.base=|v_ULTIMATE.start_main_~#t2419~0.base_24|, ~__unbuffered_p0_EAX$w_buff1~0=v_~__unbuffered_p0_EAX$w_buff1~0_7, ~__unbuffered_p0_EAX$r_buff0_thd0~0=v_~__unbuffered_p0_EAX$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX$r_buff1_thd2~0=v_~__unbuffered_p0_EAX$r_buff1_thd2~0_7, ~__unbuffered_p0_EAX$w_buff1_used~0=v_~__unbuffered_p0_EAX$w_buff1_used~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_216, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_59, ~y$w_buff1~0=v_~y$w_buff1~0_170, ~__unbuffered_p0_EAX$mem_tmp~0=v_~__unbuffered_p0_EAX$mem_tmp~0_7, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~__unbuffered_p0_EAX$r_buff0_thd3~0=v_~__unbuffered_p0_EAX$r_buff0_thd3~0_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_71, ~x~0=v_~x~0_154, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~#y~0.offset=|v_~#y~0.offset_280|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_963, ~__unbuffered_p0_EAX$w_buff0~0=v_~__unbuffered_p0_EAX$w_buff0~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~#y~0.base=|v_~#y~0.base_280|, ULTIMATE.start_main_~#t2420~0.base=|v_ULTIMATE.start_main_~#t2420~0.base_21|, ~__unbuffered_p0_EAX$r_buff1_thd1~0=v_~__unbuffered_p0_EAX$r_buff1_thd1~0_5, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_317, ~__unbuffered_p0_EAX$r_buff1_thd4~0=v_~__unbuffered_p0_EAX$r_buff1_thd4~0_7, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_51|, ULTIMATE.start_main_#t~mem90=|v_ULTIMATE.start_main_#t~mem90_38|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_33|, ~y$w_buff0~0=v_~y$w_buff0~0_208, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_246, ULTIMATE.start_main_~#t2417~0.base=|v_ULTIMATE.start_main_~#t2417~0.base_25|, ~__unbuffered_p0_EAX$flush_delayed~0=v_~__unbuffered_p0_EAX$flush_delayed~0_7, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_73, ULTIMATE.start_main_#t~mem98=|v_ULTIMATE.start_main_#t~mem98_31|, ULTIMATE.start_main_#t~nondet86=|v_ULTIMATE.start_main_#t~nondet86_10|, ULTIMATE.start_main_#t~nondet88=|v_ULTIMATE.start_main_#t~nondet88_10|, ~__unbuffered_p0_EAX$w_buff0_used~0=v_~__unbuffered_p0_EAX$w_buff0_used~0_7, ~__unbuffered_p0_EAX$r_buff0_thd2~0=v_~__unbuffered_p0_EAX$r_buff0_thd2~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2417~0.offset=|v_ULTIMATE.start_main_~#t2417~0.offset_18|, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_36|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57, #NULL.base=|v_#NULL.base_6|, ~__unbuffered_p0_EAX$r_buff1_thd0~0=v_~__unbuffered_p0_EAX$r_buff1_thd0~0_7, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_5, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_67, ULTIMATE.start_main_~#t2420~0.offset=|v_ULTIMATE.start_main_~#t2420~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_69, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_390|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57, ~weak$$choice2~0=v_~weak$$choice2~0_197, ULTIMATE.start_main_~#t2418~0.offset=|v_ULTIMATE.start_main_~#t2418~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_539} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet97, ULTIMATE.start_main_~#t2419~0.offset, ~__unbuffered_p0_EAX$r_buff0_thd1~0, #NULL.offset, ULTIMATE.start_main_~#t2418~0.base, ~__unbuffered_p0_EAX$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite94, ~weak$$choice1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ~y$r_buff0_thd1~0, ~__unbuffered_p0_EAX$r_buff0_thd4~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet87, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet89, ULTIMATE.start_main_~#t2419~0.base, ~__unbuffered_p0_EAX$w_buff1~0, ~__unbuffered_p0_EAX$r_buff0_thd0~0, ~__unbuffered_p0_EAX$r_buff1_thd2~0, ~__unbuffered_p0_EAX$w_buff1_used~0, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~__unbuffered_p0_EAX$mem_tmp~0, ~y$read_delayed_var~0.base, ~__unbuffered_p0_EAX$r_buff0_thd3~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ~__unbuffered_p0_EAX$w_buff0~0, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_~#t2420~0.base, ~__unbuffered_p0_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~mem90, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2417~0.base, ~__unbuffered_p0_EAX$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, ULTIMATE.start_main_#t~mem98, ULTIMATE.start_main_#t~nondet86, ULTIMATE.start_main_#t~nondet88, ~__unbuffered_p0_EAX$w_buff0_used~0, ~__unbuffered_p0_EAX$r_buff0_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2417~0.offset, ULTIMATE.start_main_#t~ite99, ~__unbuffered_p0_EAX$read_delayed_var~0.base, #NULL.base, ~__unbuffered_p0_EAX$r_buff1_thd0~0, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t2420~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, ~weak$$choice2~0, ULTIMATE.start_main_~#t2418~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:24:44,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1195] [1195] L764-->L765: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~y$r_buff0_thd1~0_62 v_~y$r_buff0_thd1~0_61)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P0Thread1of1ForFork2_#t~ite38=|v_P0Thread1of1ForFork2_#t~ite38_5|, P0Thread1of1ForFork2_#t~ite39=|v_P0Thread1of1ForFork2_#t~ite39_5|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_37, P0Thread1of1ForFork2_#t~ite40=|v_P0Thread1of1ForFork2_#t~ite40_5|, P0Thread1of1ForFork2_#t~ite41=|v_P0Thread1of1ForFork2_#t~ite41_7|, P0Thread1of1ForFork2_#t~ite42=|v_P0Thread1of1ForFork2_#t~ite42_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite38, P0Thread1of1ForFork2_#t~ite39, ~y$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite40, P0Thread1of1ForFork2_#t~ite41, P0Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 18:24:44,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In570945183 256)))) (or (and (= |P0Thread1of1ForFork2_#t~mem50_Out570945183| |P0Thread1of1ForFork2_#t~ite51_Out570945183|) (= |P0Thread1of1ForFork2_#t~mem50_Out570945183| (select (select |#memory_int_In570945183| |~#y~0.base_In570945183|) |~#y~0.offset_In570945183|)) .cse0) (and (= |P0Thread1of1ForFork2_#t~mem50_In570945183| |P0Thread1of1ForFork2_#t~mem50_Out570945183|) (not .cse0) (= ~y$mem_tmp~0_In570945183 |P0Thread1of1ForFork2_#t~ite51_Out570945183|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In570945183, ~#y~0.offset=|~#y~0.offset_In570945183|, P0Thread1of1ForFork2_#t~mem50=|P0Thread1of1ForFork2_#t~mem50_In570945183|, ~y$flush_delayed~0=~y$flush_delayed~0_In570945183, #memory_int=|#memory_int_In570945183|, ~#y~0.base=|~#y~0.base_In570945183|} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In570945183, ~#y~0.offset=|~#y~0.offset_In570945183|, P0Thread1of1ForFork2_#t~mem50=|P0Thread1of1ForFork2_#t~mem50_Out570945183|, ~y$flush_delayed~0=~y$flush_delayed~0_In570945183, #memory_int=|#memory_int_In570945183|, ~#y~0.base=|~#y~0.base_In570945183|, P0Thread1of1ForFork2_#t~ite51=|P0Thread1of1ForFork2_#t~ite51_Out570945183|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~mem50, P0Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:24:44,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1366] [1366] L769-2-->P0EXIT: Formula: (and (= (store |v_#memory_int_264| |v_~#y~0.base_197| (store (select |v_#memory_int_264| |v_~#y~0.base_197|) |v_~#y~0.offset_197| |v_P0Thread1of1ForFork2_#t~ite51_52|)) |v_#memory_int_263|) (= v_~__unbuffered_p0_EBX~0_28 v_~x~0_111) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~y$flush_delayed~0_148 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~#y~0.offset=|v_~#y~0.offset_197|, #memory_int=|v_#memory_int_264|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, ~#y~0.base=|v_~#y~0.base_197|, P0Thread1of1ForFork2_#t~ite51=|v_P0Thread1of1ForFork2_#t~ite51_52|, ~x~0=v_~x~0_111} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~#y~0.offset=|v_~#y~0.offset_197|, P0Thread1of1ForFork2_#t~mem50=|v_P0Thread1of1ForFork2_#t~mem50_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_148, #memory_int=|v_#memory_int_263|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~#y~0.base=|v_~#y~0.base_197|, P0Thread1of1ForFork2_#t~ite51=|v_P0Thread1of1ForFork2_#t~ite51_51|, ~x~0=v_~x~0_111} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, P0Thread1of1ForFork2_#t~mem50, ~y$flush_delayed~0, #memory_int, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:24:44,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1374] [1374] L851-1-->L853: Formula: (and (= |v_#valid_53| (store |v_#valid_54| |v_ULTIMATE.start_main_~#t2418~0.base_11| 1)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2418~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2418~0.base_11|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_main_~#t2418~0.base_11| (store (select |v_#memory_int_275| |v_ULTIMATE.start_main_~#t2418~0.base_11|) |v_ULTIMATE.start_main_~#t2418~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t2418~0.offset_10| 0) (= 0 (select |v_#valid_54| |v_ULTIMATE.start_main_~#t2418~0.base_11|)) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t2418~0.base_11| 4) |v_#length_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_275|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet86=|v_ULTIMATE.start_main_#t~nondet86_5|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_274|, #length=|v_#length_27|, ULTIMATE.start_main_~#t2418~0.base=|v_ULTIMATE.start_main_~#t2418~0.base_11|, ULTIMATE.start_main_~#t2418~0.offset=|v_ULTIMATE.start_main_~#t2418~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet86, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2418~0.base, ULTIMATE.start_main_~#t2418~0.offset] because there is no mapped edge [2019-12-07 18:24:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1364] [1364] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= 1 v_~x~0_106) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_P1Thread1of1ForFork3_~arg.offset_8 |v_P1Thread1of1ForFork3_#in~arg.offset_10|) (= v_P1Thread1of1ForFork3_~arg.base_8 |v_P1Thread1of1ForFork3_#in~arg.base_10|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_10|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_8, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_10|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_8, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_10|, ~x~0=v_~x~0_106} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 18:24:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1343] [1343] L853-1-->L855: Formula: (and (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t2419~0.base_9| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t2419~0.base_9|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2419~0.base_9|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2419~0.base_9| 4)) (= (store |v_#memory_int_230| |v_ULTIMATE.start_main_~#t2419~0.base_9| (store (select |v_#memory_int_230| |v_ULTIMATE.start_main_~#t2419~0.base_9|) |v_ULTIMATE.start_main_~#t2419~0.offset_8| 2)) |v_#memory_int_229|) (= |v_ULTIMATE.start_main_~#t2419~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t2419~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_230|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet87=|v_ULTIMATE.start_main_#t~nondet87_5|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t2419~0.base=|v_ULTIMATE.start_main_~#t2419~0.base_9|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_229|, ULTIMATE.start_main_~#t2419~0.offset=|v_ULTIMATE.start_main_~#t2419~0.offset_8|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet87, ULTIMATE.start_main_~#t2419~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2419~0.offset, #length] because there is no mapped edge [2019-12-07 18:24:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1370] [1370] L855-1-->L857: Formula: (and (= |v_#valid_51| (store |v_#valid_52| |v_ULTIMATE.start_main_~#t2420~0.base_12| 1)) (= (store |v_#memory_int_272| |v_ULTIMATE.start_main_~#t2420~0.base_12| (store (select |v_#memory_int_272| |v_ULTIMATE.start_main_~#t2420~0.base_12|) |v_ULTIMATE.start_main_~#t2420~0.offset_10| 3)) |v_#memory_int_271|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2420~0.base_12|) (= (select |v_#valid_52| |v_ULTIMATE.start_main_~#t2420~0.base_12|) 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2420~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t2420~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2420~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_272|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2420~0.offset=|v_ULTIMATE.start_main_~#t2420~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_51|, ULTIMATE.start_main_#t~nondet88=|v_ULTIMATE.start_main_#t~nondet88_5|, #memory_int=|v_#memory_int_271|, #length=|v_#length_25|, ULTIMATE.start_main_~#t2420~0.base=|v_ULTIMATE.start_main_~#t2420~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2420~0.offset, #valid, ULTIMATE.start_main_#t~nondet88, #memory_int, #length, ULTIMATE.start_main_~#t2420~0.base] because there is no mapped edge [2019-12-07 18:24:44,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L828-2-->L828-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork1_#t~ite81_Out-1103113295| |P3Thread1of1ForFork1_#t~ite80_Out-1103113295|)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1103113295 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1103113295 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite80_Out-1103113295| ~y$w_buff1~0_In-1103113295) (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork1_#t~mem79_In-1103113295| |P3Thread1of1ForFork1_#t~mem79_Out-1103113295|)) (and .cse1 (or .cse0 .cse2) (= |P3Thread1of1ForFork1_#t~mem79_Out-1103113295| (select (select |#memory_int_In-1103113295| |~#y~0.base_In-1103113295|) |~#y~0.offset_In-1103113295|)) (= |P3Thread1of1ForFork1_#t~ite80_Out-1103113295| |P3Thread1of1ForFork1_#t~mem79_Out-1103113295|)))) InVars {P3Thread1of1ForFork1_#t~mem79=|P3Thread1of1ForFork1_#t~mem79_In-1103113295|, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1103113295, ~#y~0.offset=|~#y~0.offset_In-1103113295|, ~y$w_buff1~0=~y$w_buff1~0_In-1103113295, #memory_int=|#memory_int_In-1103113295|, ~#y~0.base=|~#y~0.base_In-1103113295|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1103113295} OutVars{P3Thread1of1ForFork1_#t~mem79=|P3Thread1of1ForFork1_#t~mem79_Out-1103113295|, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1103113295, ~#y~0.offset=|~#y~0.offset_In-1103113295|, ~y$w_buff1~0=~y$w_buff1~0_In-1103113295, #memory_int=|#memory_int_In-1103113295|, P3Thread1of1ForFork1_#t~ite80=|P3Thread1of1ForFork1_#t~ite80_Out-1103113295|, ~#y~0.base=|~#y~0.base_In-1103113295|, P3Thread1of1ForFork1_#t~ite81=|P3Thread1of1ForFork1_#t~ite81_Out-1103113295|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1103113295} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~mem79, P3Thread1of1ForFork1_#t~ite80, P3Thread1of1ForFork1_#t~ite81] because there is no mapped edge [2019-12-07 18:24:44,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1281] [1281] L809-->L810: Formula: (and (not (= (mod v_~weak$$choice2~0_124 256) 0)) (= v_~y$r_buff0_thd3~0_118 v_~y$r_buff0_thd3~0_117)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_124} OutVars{~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, P2Thread1of1ForFork0_#t~ite72=|v_P2Thread1of1ForFork0_#t~ite72_7|, P2Thread1of1ForFork0_#t~ite70=|v_P2Thread1of1ForFork0_#t~ite70_11|, ~weak$$choice2~0=v_~weak$$choice2~0_124, P2Thread1of1ForFork0_#t~ite71=|v_P2Thread1of1ForFork0_#t~ite71_9|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite72, P2Thread1of1ForFork0_#t~ite70, P2Thread1of1ForFork0_#t~ite71] because there is no mapped edge [2019-12-07 18:24:44,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1303] [1303] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1820204081 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~mem77_Out1820204081| (select (select |#memory_int_In1820204081| |~#y~0.base_In1820204081|) |~#y~0.offset_In1820204081|)) (= |P2Thread1of1ForFork0_#t~mem77_Out1820204081| |P2Thread1of1ForFork0_#t~ite78_Out1820204081|)) (and (= ~y$mem_tmp~0_In1820204081 |P2Thread1of1ForFork0_#t~ite78_Out1820204081|) (not .cse0) (= |P2Thread1of1ForFork0_#t~mem77_In1820204081| |P2Thread1of1ForFork0_#t~mem77_Out1820204081|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1820204081, ~#y~0.offset=|~#y~0.offset_In1820204081|, P2Thread1of1ForFork0_#t~mem77=|P2Thread1of1ForFork0_#t~mem77_In1820204081|, ~y$flush_delayed~0=~y$flush_delayed~0_In1820204081, #memory_int=|#memory_int_In1820204081|, ~#y~0.base=|~#y~0.base_In1820204081|} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1820204081, ~#y~0.offset=|~#y~0.offset_In1820204081|, P2Thread1of1ForFork0_#t~mem77=|P2Thread1of1ForFork0_#t~mem77_Out1820204081|, P2Thread1of1ForFork0_#t~ite78=|P2Thread1of1ForFork0_#t~ite78_Out1820204081|, ~y$flush_delayed~0=~y$flush_delayed~0_In1820204081, #memory_int=|#memory_int_In1820204081|, ~#y~0.base=|~#y~0.base_In1820204081|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~mem77, P2Thread1of1ForFork0_#t~ite78] because there is no mapped edge [2019-12-07 18:24:44,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1356] [1356] L812-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_#memory_int_251| (store |v_#memory_int_252| |v_~#y~0.base_188| (store (select |v_#memory_int_252| |v_~#y~0.base_188|) |v_~#y~0.offset_188| |v_P2Thread1of1ForFork0_#t~ite78_28|))) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= v_~y$flush_delayed~0_143 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~#y~0.offset=|v_~#y~0.offset_188|, P2Thread1of1ForFork0_#t~ite78=|v_P2Thread1of1ForFork0_#t~ite78_28|, #memory_int=|v_#memory_int_252|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~#y~0.base=|v_~#y~0.base_188|} OutVars{~#y~0.offset=|v_~#y~0.offset_188|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~mem77=|v_P2Thread1of1ForFork0_#t~mem77_17|, P2Thread1of1ForFork0_#t~ite78=|v_P2Thread1of1ForFork0_#t~ite78_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, #memory_int=|v_#memory_int_251|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~#y~0.base=|v_~#y~0.base_188|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~mem77, P2Thread1of1ForFork0_#t~ite78, ~y$flush_delayed~0, #memory_int, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:24:44,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In2134186145 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2134186145 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork1_#t~ite82_Out2134186145|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2134186145 |P3Thread1of1ForFork1_#t~ite82_Out2134186145|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2134186145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2134186145} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2134186145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2134186145, P3Thread1of1ForFork1_#t~ite82=|P3Thread1of1ForFork1_#t~ite82_Out2134186145|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite82] because there is no mapped edge [2019-12-07 18:24:44,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In663574679 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In663574679 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In663574679 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In663574679 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite83_Out663574679| ~y$w_buff1_used~0_In663574679) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite83_Out663574679| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In663574679, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In663574679, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663574679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663574679} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In663574679, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In663574679, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663574679, P3Thread1of1ForFork1_#t~ite83=|P3Thread1of1ForFork1_#t~ite83_Out663574679|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663574679} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite83] because there is no mapped edge [2019-12-07 18:24:44,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L831-->L832: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1837591593 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In-1837591593 256) 0)) (.cse1 (= ~y$r_buff0_thd4~0_Out-1837591593 ~y$r_buff0_thd4~0_In-1837591593))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd4~0_Out-1837591593 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1837591593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837591593} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_Out-1837591593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837591593, P3Thread1of1ForFork1_#t~ite84=|P3Thread1of1ForFork1_#t~ite84_Out-1837591593|} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite84] because there is no mapped edge [2019-12-07 18:24:44,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1319] [1319] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1044296069 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In-1044296069 256))) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-1044296069 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1044296069 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd4~0_In-1044296069 |P3Thread1of1ForFork1_#t~ite85_Out-1044296069|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork1_#t~ite85_Out-1044296069|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1044296069, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1044296069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1044296069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1044296069} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1044296069, P3Thread1of1ForFork1_#t~ite85=|P3Thread1of1ForFork1_#t~ite85_Out-1044296069|, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1044296069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1044296069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1044296069} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite85] because there is no mapped edge [2019-12-07 18:24:44,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1339] [1339] L832-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#t~ite85_42| v_~y$r_buff1_thd4~0_40) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {P3Thread1of1ForFork1_#t~ite85=|v_P3Thread1of1ForFork1_#t~ite85_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork1_#t~ite85=|v_P3Thread1of1ForFork1_#t~ite85_41|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_40, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite85, ~y$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:24:44,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L861-->L863-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_188 256)) (= (mod v_~y$r_buff0_thd0~0_13 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:24:44,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1299] [1299] L863-2-->L863-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In850566802 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In850566802 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite92_Out850566802| |ULTIMATE.start_main_#t~ite91_Out850566802|))) (or (and (= |ULTIMATE.start_main_#t~mem90_In850566802| |ULTIMATE.start_main_#t~mem90_Out850566802|) (not .cse0) (= ~y$w_buff1~0_In850566802 |ULTIMATE.start_main_#t~ite91_Out850566802|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~mem90_Out850566802| |ULTIMATE.start_main_#t~ite91_Out850566802|) (= (select (select |#memory_int_In850566802| |~#y~0.base_In850566802|) |~#y~0.offset_In850566802|) |ULTIMATE.start_main_#t~mem90_Out850566802|) .cse2))) InVars {~#y~0.offset=|~#y~0.offset_In850566802|, ~y$w_buff1~0=~y$w_buff1~0_In850566802, ULTIMATE.start_main_#t~mem90=|ULTIMATE.start_main_#t~mem90_In850566802|, #memory_int=|#memory_int_In850566802|, ~#y~0.base=|~#y~0.base_In850566802|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850566802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850566802} OutVars{~#y~0.offset=|~#y~0.offset_In850566802|, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out850566802|, ~y$w_buff1~0=~y$w_buff1~0_In850566802, ULTIMATE.start_main_#t~mem90=|ULTIMATE.start_main_#t~mem90_Out850566802|, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out850566802|, #memory_int=|#memory_int_In850566802|, ~#y~0.base=|~#y~0.base_In850566802|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850566802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850566802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~mem90, ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 18:24:44,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-557560605 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-557560605 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite93_Out-557560605| 0)) (and (= |ULTIMATE.start_main_#t~ite93_Out-557560605| ~y$w_buff0_used~0_In-557560605) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-557560605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-557560605} OutVars{ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out-557560605|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-557560605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-557560605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite93] because there is no mapped edge [2019-12-07 18:24:44,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1309] [1309] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1603300159 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1603300159 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1603300159 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1603300159 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite94_Out1603300159| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite94_Out1603300159| ~y$w_buff1_used~0_In1603300159) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1603300159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1603300159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1603300159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603300159} OutVars{ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out1603300159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1603300159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1603300159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1603300159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603300159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite94] because there is no mapped edge [2019-12-07 18:24:44,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L866-->L867: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In748603529 256))) (.cse0 (= ~y$r_buff0_thd0~0_In748603529 ~y$r_buff0_thd0~0_Out748603529)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In748603529 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~y$r_buff0_thd0~0_Out748603529) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In748603529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In748603529} OutVars{ULTIMATE.start_main_#t~ite95=|ULTIMATE.start_main_#t~ite95_Out748603529|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In748603529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out748603529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite95, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-07 18:24:44,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1318] [1318] L867-->L867-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-838314969 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-838314969 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-838314969 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-838314969 256)))) (or (and (= |ULTIMATE.start_main_#t~ite96_Out-838314969| ~y$r_buff1_thd0~0_In-838314969) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite96_Out-838314969| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-838314969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-838314969, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-838314969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-838314969} OutVars{ULTIMATE.start_main_#t~ite96=|ULTIMATE.start_main_#t~ite96_Out-838314969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-838314969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-838314969, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-838314969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-838314969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite96] because there is no mapped edge [2019-12-07 18:24:44,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1307] [1307] L871-->L871-3: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice1~0_In1624286074 256))) (.cse0 (not (= (mod ~__unbuffered_p0_EAX$read_delayed~0_In1624286074 256) 0)))) (or (and (= |ULTIMATE.start_main_#t~mem98_Out1624286074| |ULTIMATE.start_main_#t~ite99_Out1624286074|) (= (select (select |#memory_int_In1624286074| ~__unbuffered_p0_EAX$read_delayed_var~0.base_In1624286074) ~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1624286074) |ULTIMATE.start_main_#t~mem98_Out1624286074|) .cse0 (not .cse1)) (and .cse1 (= ~__unbuffered_p0_EAX~0_In1624286074 |ULTIMATE.start_main_#t~ite99_Out1624286074|) .cse0 (= |ULTIMATE.start_main_#t~mem98_In1624286074| |ULTIMATE.start_main_#t~mem98_Out1624286074|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1624286074, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_In1624286074, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1624286074, #memory_int=|#memory_int_In1624286074|, ~__unbuffered_p0_EAX$read_delayed~0=~__unbuffered_p0_EAX$read_delayed~0_In1624286074, ULTIMATE.start_main_#t~mem98=|ULTIMATE.start_main_#t~mem98_In1624286074|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=~__unbuffered_p0_EAX$read_delayed_var~0.base_In1624286074} OutVars{~weak$$choice1~0=~weak$$choice1~0_In1624286074, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_In1624286074, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1624286074, #memory_int=|#memory_int_In1624286074|, ~__unbuffered_p0_EAX$read_delayed~0=~__unbuffered_p0_EAX$read_delayed~0_In1624286074, ULTIMATE.start_main_#t~mem98=|ULTIMATE.start_main_#t~mem98_Out1624286074|, ULTIMATE.start_main_#t~ite99=|ULTIMATE.start_main_#t~ite99_Out1624286074|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=~__unbuffered_p0_EAX$read_delayed_var~0.base_In1624286074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem98, ULTIMATE.start_main_#t~ite99] because there is no mapped edge [2019-12-07 18:24:44,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1368] [1368] L871-3-->L874-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_11 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_11 1)) (.cse0 (= 1 v_~__unbuffered_p0_EAX~0_47)) (.cse5 (= v_~__unbuffered_p0_EBX~0_31 0)) (.cse3 (= v_~__unbuffered_p2_EBX~0_12 0)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite99_22| v_~__unbuffered_p0_EAX~0_47)) (.cse4 (= 1 v_~__unbuffered_p2_EAX~0_88))) (or (and (not .cse0) .cse1 .cse2) (and .cse1 .cse2 (not .cse3)) (and (not .cse4) .cse1 .cse2) (and .cse1 (not .cse5) .cse2) (and .cse0 .cse5 .cse3 .cse1 .cse4 (= v_~main$tmp_guard1~0_11 0))))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_22|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ULTIMATE.start_main_#t~mem98=|v_ULTIMATE.start_main_#t~mem98_19|, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite100, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem98, ULTIMATE.start_main_#t~ite99, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:24:44,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1349] [1349] L874-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:24:44,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:24:44 BasicIcfg [2019-12-07 18:24:44,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:24:44,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:24:44,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:24:44,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:24:44,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:14:45" (3/4) ... [2019-12-07 18:24:44,211 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:24:44,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1415] [1415] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse1 (store |v_#valid_102| 0 0))) (let ((.cse0 (store .cse1 |v_~#y~0.base_280| 1))) (and (= |v_#length_52| (store (store |v_#length_53| |v_~#y~0.base_280| 4) |v_ULTIMATE.start_main_~#t2417~0.base_25| 4)) (= 0 v_~__unbuffered_p0_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd4~0_7) (= v_~y$mem_tmp~0_153 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff1_thd2~0_5 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd3~0_7) (= 0 v_~__unbuffered_p0_EAX$read_delayed~0_73) (= v_~y$flush_delayed~0_193 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd1~0_5) (= |v_#NULL.offset_6| 0) (= 0 v_~y$r_buff1_thd4~0_59) (= (store |v_#memory_int_391| |v_ULTIMATE.start_main_~#t2417~0.base_25| (store (select |v_#memory_int_391| |v_ULTIMATE.start_main_~#t2417~0.base_25|) |v_ULTIMATE.start_main_~#t2417~0.offset_18| 0)) |v_#memory_int_390|) (< 0 |v_#StackHeapBarrier_32|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2417~0.base_25|)) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2417~0.base_25|) (< |v_#StackHeapBarrier_32| |v_~#y~0.base_280|) (= v_~main$tmp_guard0~0_28 0) (= v_~y$r_buff0_thd0~0_69 0) (= 0 v_~y$w_buff0~0_208) (= 0 v_~__unbuffered_p0_EAX$w_buff1_used~0_7) (= 0 v_~y$r_buff0_thd3~0_246) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd0~0_7) (= 0 v_~weak$$choice0~0_216) (= 0 v_~weak$$choice1~0_86) (= 0 v_~__unbuffered_p0_EAX$w_buff0~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd2~0_7) (= v_~y$w_buff1_used~0_539 0) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd4~0_7) (= 0 v_~x~0_154) (= v_~__unbuffered_p0_EAX$mem_tmp~0_7 0) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57 0) (= v_~y$w_buff0_used~0_963 0) (= 0 v_~y$r_buff1_thd0~0_71) (= 0 (select .cse1 |v_~#y~0.base_280|)) (= |v_ULTIMATE.start_main_~#t2417~0.offset_18| 0) (= 0 v_~__unbuffered_p2_EAX~0_130) (= v_~__unbuffered_p0_EAX$flush_delayed~0_7 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_317 0) (= 0 (select (select |v_#memory_int_391| |v_~#y~0.base_280|) |v_~#y~0.offset_280|)) (= v_~y$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$w_buff1~0_170 0) (= 0 v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd3~0_7) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd0~0_7) (= v_~y$r_buff0_thd1~0_376 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#valid_100| (store .cse0 |v_ULTIMATE.start_main_~#t2417~0.base_25| 1)) (= 0 v_~__unbuffered_p0_EAX$w_buff1~0_7) (= v_~__unbuffered_cnt~0_130 0) (= 0 v_~__unbuffered_p0_EAX$r_buff0_thd1~0_6) (= v_~y$r_buff0_thd4~0_67 0) (= 0 v_~__unbuffered_p0_EAX$r_buff1_thd2~0_7) (= 0 |v_~#y~0.offset_280|) (= 0 v_~y$r_buff1_thd3~0_123) (= v_~weak$$choice2~0_197 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_391|, #length=|v_#length_53|} OutVars{ULTIMATE.start_main_#t~nondet97=|v_ULTIMATE.start_main_#t~nondet97_51|, ULTIMATE.start_main_~#t2419~0.offset=|v_ULTIMATE.start_main_~#t2419~0.offset_20|, ~__unbuffered_p0_EAX$r_buff0_thd1~0=v_~__unbuffered_p0_EAX$r_buff0_thd1~0_6, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2418~0.base=|v_ULTIMATE.start_main_~#t2418~0.base_22|, ~__unbuffered_p0_EAX$r_buff1_thd3~0=v_~__unbuffered_p0_EAX$r_buff1_thd3~0_7, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_61|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_39|, ~weak$$choice1~0=v_~weak$$choice1~0_86, ~y$mem_tmp~0=v_~y$mem_tmp~0_153, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_34|, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_376, ~__unbuffered_p0_EAX$r_buff0_thd4~0=v_~__unbuffered_p0_EAX$r_buff0_thd4~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_193, #length=|v_#length_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ULTIMATE.start_main_#t~nondet87=|v_ULTIMATE.start_main_#t~nondet87_14|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~nondet89=|v_ULTIMATE.start_main_#t~nondet89_16|, ULTIMATE.start_main_~#t2419~0.base=|v_ULTIMATE.start_main_~#t2419~0.base_24|, ~__unbuffered_p0_EAX$w_buff1~0=v_~__unbuffered_p0_EAX$w_buff1~0_7, ~__unbuffered_p0_EAX$r_buff0_thd0~0=v_~__unbuffered_p0_EAX$r_buff0_thd0~0_7, ~__unbuffered_p0_EAX$r_buff1_thd2~0=v_~__unbuffered_p0_EAX$r_buff1_thd2~0_7, ~__unbuffered_p0_EAX$w_buff1_used~0=v_~__unbuffered_p0_EAX$w_buff1_used~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_216, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_59, ~y$w_buff1~0=v_~y$w_buff1~0_170, ~__unbuffered_p0_EAX$mem_tmp~0=v_~__unbuffered_p0_EAX$mem_tmp~0_7, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~__unbuffered_p0_EAX$r_buff0_thd3~0=v_~__unbuffered_p0_EAX$r_buff0_thd3~0_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_71, ~x~0=v_~x~0_154, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~#y~0.offset=|v_~#y~0.offset_280|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_963, ~__unbuffered_p0_EAX$w_buff0~0=v_~__unbuffered_p0_EAX$w_buff0~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~#y~0.base=|v_~#y~0.base_280|, ULTIMATE.start_main_~#t2420~0.base=|v_ULTIMATE.start_main_~#t2420~0.base_21|, ~__unbuffered_p0_EAX$r_buff1_thd1~0=v_~__unbuffered_p0_EAX$r_buff1_thd1~0_5, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_317, ~__unbuffered_p0_EAX$r_buff1_thd4~0=v_~__unbuffered_p0_EAX$r_buff1_thd4~0_7, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_51|, ULTIMATE.start_main_#t~mem90=|v_ULTIMATE.start_main_#t~mem90_38|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_33|, ~y$w_buff0~0=v_~y$w_buff0~0_208, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_246, ULTIMATE.start_main_~#t2417~0.base=|v_ULTIMATE.start_main_~#t2417~0.base_25|, ~__unbuffered_p0_EAX$flush_delayed~0=v_~__unbuffered_p0_EAX$flush_delayed~0_7, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_73, ULTIMATE.start_main_#t~mem98=|v_ULTIMATE.start_main_#t~mem98_31|, ULTIMATE.start_main_#t~nondet86=|v_ULTIMATE.start_main_#t~nondet86_10|, ULTIMATE.start_main_#t~nondet88=|v_ULTIMATE.start_main_#t~nondet88_10|, ~__unbuffered_p0_EAX$w_buff0_used~0=v_~__unbuffered_p0_EAX$w_buff0_used~0_7, ~__unbuffered_p0_EAX$r_buff0_thd2~0=v_~__unbuffered_p0_EAX$r_buff0_thd2~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2417~0.offset=|v_ULTIMATE.start_main_~#t2417~0.offset_18|, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_36|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57, #NULL.base=|v_#NULL.base_6|, ~__unbuffered_p0_EAX$r_buff1_thd0~0=v_~__unbuffered_p0_EAX$r_buff1_thd0~0_7, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_5, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_67, ULTIMATE.start_main_~#t2420~0.offset=|v_ULTIMATE.start_main_~#t2420~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_69, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_390|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57, ~weak$$choice2~0=v_~weak$$choice2~0_197, ULTIMATE.start_main_~#t2418~0.offset=|v_ULTIMATE.start_main_~#t2418~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_539} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet97, ULTIMATE.start_main_~#t2419~0.offset, ~__unbuffered_p0_EAX$r_buff0_thd1~0, #NULL.offset, ULTIMATE.start_main_~#t2418~0.base, ~__unbuffered_p0_EAX$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite94, ~weak$$choice1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite100, ~y$r_buff0_thd1~0, ~__unbuffered_p0_EAX$r_buff0_thd4~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet87, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet89, ULTIMATE.start_main_~#t2419~0.base, ~__unbuffered_p0_EAX$w_buff1~0, ~__unbuffered_p0_EAX$r_buff0_thd0~0, ~__unbuffered_p0_EAX$r_buff1_thd2~0, ~__unbuffered_p0_EAX$w_buff1_used~0, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~__unbuffered_p0_EAX$mem_tmp~0, ~y$read_delayed_var~0.base, ~__unbuffered_p0_EAX$r_buff0_thd3~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ~__unbuffered_p0_EAX$w_buff0~0, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_~#t2420~0.base, ~__unbuffered_p0_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~mem90, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2417~0.base, ~__unbuffered_p0_EAX$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, ULTIMATE.start_main_#t~mem98, ULTIMATE.start_main_#t~nondet86, ULTIMATE.start_main_#t~nondet88, ~__unbuffered_p0_EAX$w_buff0_used~0, ~__unbuffered_p0_EAX$r_buff0_thd2~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2417~0.offset, ULTIMATE.start_main_#t~ite99, ~__unbuffered_p0_EAX$read_delayed_var~0.base, #NULL.base, ~__unbuffered_p0_EAX$r_buff1_thd0~0, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t2420~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, ~weak$$choice2~0, ULTIMATE.start_main_~#t2418~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:24:44,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1195] [1195] L764-->L765: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~y$r_buff0_thd1~0_62 v_~y$r_buff0_thd1~0_61)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P0Thread1of1ForFork2_#t~ite38=|v_P0Thread1of1ForFork2_#t~ite38_5|, P0Thread1of1ForFork2_#t~ite39=|v_P0Thread1of1ForFork2_#t~ite39_5|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_37, P0Thread1of1ForFork2_#t~ite40=|v_P0Thread1of1ForFork2_#t~ite40_5|, P0Thread1of1ForFork2_#t~ite41=|v_P0Thread1of1ForFork2_#t~ite41_7|, P0Thread1of1ForFork2_#t~ite42=|v_P0Thread1of1ForFork2_#t~ite42_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite38, P0Thread1of1ForFork2_#t~ite39, ~y$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite40, P0Thread1of1ForFork2_#t~ite41, P0Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 18:24:44,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In570945183 256)))) (or (and (= |P0Thread1of1ForFork2_#t~mem50_Out570945183| |P0Thread1of1ForFork2_#t~ite51_Out570945183|) (= |P0Thread1of1ForFork2_#t~mem50_Out570945183| (select (select |#memory_int_In570945183| |~#y~0.base_In570945183|) |~#y~0.offset_In570945183|)) .cse0) (and (= |P0Thread1of1ForFork2_#t~mem50_In570945183| |P0Thread1of1ForFork2_#t~mem50_Out570945183|) (not .cse0) (= ~y$mem_tmp~0_In570945183 |P0Thread1of1ForFork2_#t~ite51_Out570945183|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In570945183, ~#y~0.offset=|~#y~0.offset_In570945183|, P0Thread1of1ForFork2_#t~mem50=|P0Thread1of1ForFork2_#t~mem50_In570945183|, ~y$flush_delayed~0=~y$flush_delayed~0_In570945183, #memory_int=|#memory_int_In570945183|, ~#y~0.base=|~#y~0.base_In570945183|} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In570945183, ~#y~0.offset=|~#y~0.offset_In570945183|, P0Thread1of1ForFork2_#t~mem50=|P0Thread1of1ForFork2_#t~mem50_Out570945183|, ~y$flush_delayed~0=~y$flush_delayed~0_In570945183, #memory_int=|#memory_int_In570945183|, ~#y~0.base=|~#y~0.base_In570945183|, P0Thread1of1ForFork2_#t~ite51=|P0Thread1of1ForFork2_#t~ite51_Out570945183|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~mem50, P0Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:24:44,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1366] [1366] L769-2-->P0EXIT: Formula: (and (= (store |v_#memory_int_264| |v_~#y~0.base_197| (store (select |v_#memory_int_264| |v_~#y~0.base_197|) |v_~#y~0.offset_197| |v_P0Thread1of1ForFork2_#t~ite51_52|)) |v_#memory_int_263|) (= v_~__unbuffered_p0_EBX~0_28 v_~x~0_111) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~y$flush_delayed~0_148 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~#y~0.offset=|v_~#y~0.offset_197|, #memory_int=|v_#memory_int_264|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, ~#y~0.base=|v_~#y~0.base_197|, P0Thread1of1ForFork2_#t~ite51=|v_P0Thread1of1ForFork2_#t~ite51_52|, ~x~0=v_~x~0_111} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~#y~0.offset=|v_~#y~0.offset_197|, P0Thread1of1ForFork2_#t~mem50=|v_P0Thread1of1ForFork2_#t~mem50_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_148, #memory_int=|v_#memory_int_263|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~#y~0.base=|v_~#y~0.base_197|, P0Thread1of1ForFork2_#t~ite51=|v_P0Thread1of1ForFork2_#t~ite51_51|, ~x~0=v_~x~0_111} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, P0Thread1of1ForFork2_#t~mem50, ~y$flush_delayed~0, #memory_int, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:24:44,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1374] [1374] L851-1-->L853: Formula: (and (= |v_#valid_53| (store |v_#valid_54| |v_ULTIMATE.start_main_~#t2418~0.base_11| 1)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2418~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2418~0.base_11|)) (= |v_#memory_int_274| (store |v_#memory_int_275| |v_ULTIMATE.start_main_~#t2418~0.base_11| (store (select |v_#memory_int_275| |v_ULTIMATE.start_main_~#t2418~0.base_11|) |v_ULTIMATE.start_main_~#t2418~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t2418~0.offset_10| 0) (= 0 (select |v_#valid_54| |v_ULTIMATE.start_main_~#t2418~0.base_11|)) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t2418~0.base_11| 4) |v_#length_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_275|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet86=|v_ULTIMATE.start_main_#t~nondet86_5|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_274|, #length=|v_#length_27|, ULTIMATE.start_main_~#t2418~0.base=|v_ULTIMATE.start_main_~#t2418~0.base_11|, ULTIMATE.start_main_~#t2418~0.offset=|v_ULTIMATE.start_main_~#t2418~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet86, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2418~0.base, ULTIMATE.start_main_~#t2418~0.offset] because there is no mapped edge [2019-12-07 18:24:44,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1364] [1364] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= 1 v_~x~0_106) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_P1Thread1of1ForFork3_~arg.offset_8 |v_P1Thread1of1ForFork3_#in~arg.offset_10|) (= v_P1Thread1of1ForFork3_~arg.base_8 |v_P1Thread1of1ForFork3_#in~arg.base_10|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_10|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_8, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_10|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_8, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_10|, ~x~0=v_~x~0_106} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 18:24:44,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1343] [1343] L853-1-->L855: Formula: (and (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t2419~0.base_9| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t2419~0.base_9|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2419~0.base_9|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2419~0.base_9| 4)) (= (store |v_#memory_int_230| |v_ULTIMATE.start_main_~#t2419~0.base_9| (store (select |v_#memory_int_230| |v_ULTIMATE.start_main_~#t2419~0.base_9|) |v_ULTIMATE.start_main_~#t2419~0.offset_8| 2)) |v_#memory_int_229|) (= |v_ULTIMATE.start_main_~#t2419~0.offset_8| 0) (not (= |v_ULTIMATE.start_main_~#t2419~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_230|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet87=|v_ULTIMATE.start_main_#t~nondet87_5|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t2419~0.base=|v_ULTIMATE.start_main_~#t2419~0.base_9|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_229|, ULTIMATE.start_main_~#t2419~0.offset=|v_ULTIMATE.start_main_~#t2419~0.offset_8|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet87, ULTIMATE.start_main_~#t2419~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2419~0.offset, #length] because there is no mapped edge [2019-12-07 18:24:44,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1370] [1370] L855-1-->L857: Formula: (and (= |v_#valid_51| (store |v_#valid_52| |v_ULTIMATE.start_main_~#t2420~0.base_12| 1)) (= (store |v_#memory_int_272| |v_ULTIMATE.start_main_~#t2420~0.base_12| (store (select |v_#memory_int_272| |v_ULTIMATE.start_main_~#t2420~0.base_12|) |v_ULTIMATE.start_main_~#t2420~0.offset_10| 3)) |v_#memory_int_271|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2420~0.base_12|) (= (select |v_#valid_52| |v_ULTIMATE.start_main_~#t2420~0.base_12|) 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2420~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t2420~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2420~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_272|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2420~0.offset=|v_ULTIMATE.start_main_~#t2420~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_51|, ULTIMATE.start_main_#t~nondet88=|v_ULTIMATE.start_main_#t~nondet88_5|, #memory_int=|v_#memory_int_271|, #length=|v_#length_25|, ULTIMATE.start_main_~#t2420~0.base=|v_ULTIMATE.start_main_~#t2420~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2420~0.offset, #valid, ULTIMATE.start_main_#t~nondet88, #memory_int, #length, ULTIMATE.start_main_~#t2420~0.base] because there is no mapped edge [2019-12-07 18:24:44,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L828-2-->L828-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork1_#t~ite81_Out-1103113295| |P3Thread1of1ForFork1_#t~ite80_Out-1103113295|)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1103113295 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1103113295 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite80_Out-1103113295| ~y$w_buff1~0_In-1103113295) (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork1_#t~mem79_In-1103113295| |P3Thread1of1ForFork1_#t~mem79_Out-1103113295|)) (and .cse1 (or .cse0 .cse2) (= |P3Thread1of1ForFork1_#t~mem79_Out-1103113295| (select (select |#memory_int_In-1103113295| |~#y~0.base_In-1103113295|) |~#y~0.offset_In-1103113295|)) (= |P3Thread1of1ForFork1_#t~ite80_Out-1103113295| |P3Thread1of1ForFork1_#t~mem79_Out-1103113295|)))) InVars {P3Thread1of1ForFork1_#t~mem79=|P3Thread1of1ForFork1_#t~mem79_In-1103113295|, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1103113295, ~#y~0.offset=|~#y~0.offset_In-1103113295|, ~y$w_buff1~0=~y$w_buff1~0_In-1103113295, #memory_int=|#memory_int_In-1103113295|, ~#y~0.base=|~#y~0.base_In-1103113295|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1103113295} OutVars{P3Thread1of1ForFork1_#t~mem79=|P3Thread1of1ForFork1_#t~mem79_Out-1103113295|, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1103113295, ~#y~0.offset=|~#y~0.offset_In-1103113295|, ~y$w_buff1~0=~y$w_buff1~0_In-1103113295, #memory_int=|#memory_int_In-1103113295|, P3Thread1of1ForFork1_#t~ite80=|P3Thread1of1ForFork1_#t~ite80_Out-1103113295|, ~#y~0.base=|~#y~0.base_In-1103113295|, P3Thread1of1ForFork1_#t~ite81=|P3Thread1of1ForFork1_#t~ite81_Out-1103113295|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1103113295} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~mem79, P3Thread1of1ForFork1_#t~ite80, P3Thread1of1ForFork1_#t~ite81] because there is no mapped edge [2019-12-07 18:24:44,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1281] [1281] L809-->L810: Formula: (and (not (= (mod v_~weak$$choice2~0_124 256) 0)) (= v_~y$r_buff0_thd3~0_118 v_~y$r_buff0_thd3~0_117)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_124} OutVars{~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_117, P2Thread1of1ForFork0_#t~ite72=|v_P2Thread1of1ForFork0_#t~ite72_7|, P2Thread1of1ForFork0_#t~ite70=|v_P2Thread1of1ForFork0_#t~ite70_11|, ~weak$$choice2~0=v_~weak$$choice2~0_124, P2Thread1of1ForFork0_#t~ite71=|v_P2Thread1of1ForFork0_#t~ite71_9|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite72, P2Thread1of1ForFork0_#t~ite70, P2Thread1of1ForFork0_#t~ite71] because there is no mapped edge [2019-12-07 18:24:44,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1303] [1303] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1820204081 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~mem77_Out1820204081| (select (select |#memory_int_In1820204081| |~#y~0.base_In1820204081|) |~#y~0.offset_In1820204081|)) (= |P2Thread1of1ForFork0_#t~mem77_Out1820204081| |P2Thread1of1ForFork0_#t~ite78_Out1820204081|)) (and (= ~y$mem_tmp~0_In1820204081 |P2Thread1of1ForFork0_#t~ite78_Out1820204081|) (not .cse0) (= |P2Thread1of1ForFork0_#t~mem77_In1820204081| |P2Thread1of1ForFork0_#t~mem77_Out1820204081|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1820204081, ~#y~0.offset=|~#y~0.offset_In1820204081|, P2Thread1of1ForFork0_#t~mem77=|P2Thread1of1ForFork0_#t~mem77_In1820204081|, ~y$flush_delayed~0=~y$flush_delayed~0_In1820204081, #memory_int=|#memory_int_In1820204081|, ~#y~0.base=|~#y~0.base_In1820204081|} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1820204081, ~#y~0.offset=|~#y~0.offset_In1820204081|, P2Thread1of1ForFork0_#t~mem77=|P2Thread1of1ForFork0_#t~mem77_Out1820204081|, P2Thread1of1ForFork0_#t~ite78=|P2Thread1of1ForFork0_#t~ite78_Out1820204081|, ~y$flush_delayed~0=~y$flush_delayed~0_In1820204081, #memory_int=|#memory_int_In1820204081|, ~#y~0.base=|~#y~0.base_In1820204081|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~mem77, P2Thread1of1ForFork0_#t~ite78] because there is no mapped edge [2019-12-07 18:24:44,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1356] [1356] L812-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_#memory_int_251| (store |v_#memory_int_252| |v_~#y~0.base_188| (store (select |v_#memory_int_252| |v_~#y~0.base_188|) |v_~#y~0.offset_188| |v_P2Thread1of1ForFork0_#t~ite78_28|))) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= v_~y$flush_delayed~0_143 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~#y~0.offset=|v_~#y~0.offset_188|, P2Thread1of1ForFork0_#t~ite78=|v_P2Thread1of1ForFork0_#t~ite78_28|, #memory_int=|v_#memory_int_252|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~#y~0.base=|v_~#y~0.base_188|} OutVars{~#y~0.offset=|v_~#y~0.offset_188|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~mem77=|v_P2Thread1of1ForFork0_#t~mem77_17|, P2Thread1of1ForFork0_#t~ite78=|v_P2Thread1of1ForFork0_#t~ite78_27|, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, #memory_int=|v_#memory_int_251|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~#y~0.base=|v_~#y~0.base_188|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~mem77, P2Thread1of1ForFork0_#t~ite78, ~y$flush_delayed~0, #memory_int, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:24:44,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In2134186145 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2134186145 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork1_#t~ite82_Out2134186145|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2134186145 |P3Thread1of1ForFork1_#t~ite82_Out2134186145|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2134186145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2134186145} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2134186145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2134186145, P3Thread1of1ForFork1_#t~ite82=|P3Thread1of1ForFork1_#t~ite82_Out2134186145|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite82] because there is no mapped edge [2019-12-07 18:24:44,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In663574679 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In663574679 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In663574679 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In663574679 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite83_Out663574679| ~y$w_buff1_used~0_In663574679) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite83_Out663574679| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In663574679, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In663574679, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663574679, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663574679} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In663574679, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In663574679, ~y$w_buff0_used~0=~y$w_buff0_used~0_In663574679, P3Thread1of1ForFork1_#t~ite83=|P3Thread1of1ForFork1_#t~ite83_Out663574679|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In663574679} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite83] because there is no mapped edge [2019-12-07 18:24:44,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L831-->L832: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1837591593 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In-1837591593 256) 0)) (.cse1 (= ~y$r_buff0_thd4~0_Out-1837591593 ~y$r_buff0_thd4~0_In-1837591593))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd4~0_Out-1837591593 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1837591593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837591593} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_Out-1837591593, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1837591593, P3Thread1of1ForFork1_#t~ite84=|P3Thread1of1ForFork1_#t~ite84_Out-1837591593|} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite84] because there is no mapped edge [2019-12-07 18:24:44,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1319] [1319] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1044296069 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In-1044296069 256))) (.cse1 (= (mod ~y$r_buff1_thd4~0_In-1044296069 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1044296069 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd4~0_In-1044296069 |P3Thread1of1ForFork1_#t~ite85_Out-1044296069|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork1_#t~ite85_Out-1044296069|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1044296069, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1044296069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1044296069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1044296069} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1044296069, P3Thread1of1ForFork1_#t~ite85=|P3Thread1of1ForFork1_#t~ite85_Out-1044296069|, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1044296069, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1044296069, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1044296069} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite85] because there is no mapped edge [2019-12-07 18:24:44,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1339] [1339] L832-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#t~ite85_42| v_~y$r_buff1_thd4~0_40) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {P3Thread1of1ForFork1_#t~ite85=|v_P3Thread1of1ForFork1_#t~ite85_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork1_#t~ite85=|v_P3Thread1of1ForFork1_#t~ite85_41|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_40, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite85, ~y$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:24:44,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1200] [1200] L861-->L863-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_188 256)) (= (mod v_~y$r_buff0_thd0~0_13 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_188, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:24:44,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1299] [1299] L863-2-->L863-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In850566802 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In850566802 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite92_Out850566802| |ULTIMATE.start_main_#t~ite91_Out850566802|))) (or (and (= |ULTIMATE.start_main_#t~mem90_In850566802| |ULTIMATE.start_main_#t~mem90_Out850566802|) (not .cse0) (= ~y$w_buff1~0_In850566802 |ULTIMATE.start_main_#t~ite91_Out850566802|) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~mem90_Out850566802| |ULTIMATE.start_main_#t~ite91_Out850566802|) (= (select (select |#memory_int_In850566802| |~#y~0.base_In850566802|) |~#y~0.offset_In850566802|) |ULTIMATE.start_main_#t~mem90_Out850566802|) .cse2))) InVars {~#y~0.offset=|~#y~0.offset_In850566802|, ~y$w_buff1~0=~y$w_buff1~0_In850566802, ULTIMATE.start_main_#t~mem90=|ULTIMATE.start_main_#t~mem90_In850566802|, #memory_int=|#memory_int_In850566802|, ~#y~0.base=|~#y~0.base_In850566802|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850566802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850566802} OutVars{~#y~0.offset=|~#y~0.offset_In850566802|, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out850566802|, ~y$w_buff1~0=~y$w_buff1~0_In850566802, ULTIMATE.start_main_#t~mem90=|ULTIMATE.start_main_#t~mem90_Out850566802|, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out850566802|, #memory_int=|#memory_int_In850566802|, ~#y~0.base=|~#y~0.base_In850566802|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850566802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850566802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~mem90, ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-07 18:24:44,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-557560605 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-557560605 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite93_Out-557560605| 0)) (and (= |ULTIMATE.start_main_#t~ite93_Out-557560605| ~y$w_buff0_used~0_In-557560605) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-557560605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-557560605} OutVars{ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out-557560605|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-557560605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-557560605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite93] because there is no mapped edge [2019-12-07 18:24:44,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1309] [1309] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1603300159 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1603300159 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1603300159 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1603300159 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite94_Out1603300159| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite94_Out1603300159| ~y$w_buff1_used~0_In1603300159) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1603300159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1603300159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1603300159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603300159} OutVars{ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out1603300159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1603300159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1603300159, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1603300159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1603300159} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite94] because there is no mapped edge [2019-12-07 18:24:44,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L866-->L867: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In748603529 256))) (.cse0 (= ~y$r_buff0_thd0~0_In748603529 ~y$r_buff0_thd0~0_Out748603529)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In748603529 256)))) (or (and .cse0 .cse1) (and (not .cse1) (= 0 ~y$r_buff0_thd0~0_Out748603529) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In748603529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In748603529} OutVars{ULTIMATE.start_main_#t~ite95=|ULTIMATE.start_main_#t~ite95_Out748603529|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In748603529, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out748603529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite95, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-07 18:24:44,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1318] [1318] L867-->L867-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-838314969 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-838314969 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-838314969 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-838314969 256)))) (or (and (= |ULTIMATE.start_main_#t~ite96_Out-838314969| ~y$r_buff1_thd0~0_In-838314969) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite96_Out-838314969| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-838314969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-838314969, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-838314969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-838314969} OutVars{ULTIMATE.start_main_#t~ite96=|ULTIMATE.start_main_#t~ite96_Out-838314969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-838314969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-838314969, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-838314969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-838314969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite96] because there is no mapped edge [2019-12-07 18:24:44,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1307] [1307] L871-->L871-3: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice1~0_In1624286074 256))) (.cse0 (not (= (mod ~__unbuffered_p0_EAX$read_delayed~0_In1624286074 256) 0)))) (or (and (= |ULTIMATE.start_main_#t~mem98_Out1624286074| |ULTIMATE.start_main_#t~ite99_Out1624286074|) (= (select (select |#memory_int_In1624286074| ~__unbuffered_p0_EAX$read_delayed_var~0.base_In1624286074) ~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1624286074) |ULTIMATE.start_main_#t~mem98_Out1624286074|) .cse0 (not .cse1)) (and .cse1 (= ~__unbuffered_p0_EAX~0_In1624286074 |ULTIMATE.start_main_#t~ite99_Out1624286074|) .cse0 (= |ULTIMATE.start_main_#t~mem98_In1624286074| |ULTIMATE.start_main_#t~mem98_Out1624286074|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1624286074, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_In1624286074, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1624286074, #memory_int=|#memory_int_In1624286074|, ~__unbuffered_p0_EAX$read_delayed~0=~__unbuffered_p0_EAX$read_delayed~0_In1624286074, ULTIMATE.start_main_#t~mem98=|ULTIMATE.start_main_#t~mem98_In1624286074|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=~__unbuffered_p0_EAX$read_delayed_var~0.base_In1624286074} OutVars{~weak$$choice1~0=~weak$$choice1~0_In1624286074, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_In1624286074, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=~__unbuffered_p0_EAX$read_delayed_var~0.offset_In1624286074, #memory_int=|#memory_int_In1624286074|, ~__unbuffered_p0_EAX$read_delayed~0=~__unbuffered_p0_EAX$read_delayed~0_In1624286074, ULTIMATE.start_main_#t~mem98=|ULTIMATE.start_main_#t~mem98_Out1624286074|, ULTIMATE.start_main_#t~ite99=|ULTIMATE.start_main_#t~ite99_Out1624286074|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=~__unbuffered_p0_EAX$read_delayed_var~0.base_In1624286074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem98, ULTIMATE.start_main_#t~ite99] because there is no mapped edge [2019-12-07 18:24:44,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1368] [1368] L871-3-->L874-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_11 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_11 1)) (.cse0 (= 1 v_~__unbuffered_p0_EAX~0_47)) (.cse5 (= v_~__unbuffered_p0_EBX~0_31 0)) (.cse3 (= v_~__unbuffered_p2_EBX~0_12 0)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite99_22| v_~__unbuffered_p0_EAX~0_47)) (.cse4 (= 1 v_~__unbuffered_p2_EAX~0_88))) (or (and (not .cse0) .cse1 .cse2) (and .cse1 .cse2 (not .cse3)) (and (not .cse4) .cse1 .cse2) (and .cse1 (not .cse5) .cse2) (and .cse0 .cse5 .cse3 .cse1 .cse4 (= v_~main$tmp_guard1~0_11 0))))) InVars {~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_22|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ULTIMATE.start_main_#t~ite100=|v_ULTIMATE.start_main_#t~ite100_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ULTIMATE.start_main_#t~mem98=|v_ULTIMATE.start_main_#t~mem98_19|, ULTIMATE.start_main_#t~ite99=|v_ULTIMATE.start_main_#t~ite99_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite100, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem98, ULTIMATE.start_main_#t~ite99, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:24:44,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1349] [1349] L874-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:24:44,309 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a09ffb8b-7f9f-45b1-acc3-443507197b8b/bin/uautomizer/witness.graphml [2019-12-07 18:24:44,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:24:44,310 INFO L168 Benchmark]: Toolchain (without parser) took 599961.51 ms. Allocated memory was 1.0 GB in the beginning and 10.0 GB in the end (delta: 9.0 GB). Free memory was 943.5 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 6.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:24:44,310 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:24:44,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:44,310 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:24:44,310 INFO L168 Benchmark]: Boogie Preprocessor took 31.52 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 18:24:44,311 INFO L168 Benchmark]: RCFGBuilder took 496.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 984.3 MB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:44,311 INFO L168 Benchmark]: TraceAbstraction took 598881.30 ms. Allocated memory was 1.1 GB in the beginning and 10.0 GB in the end (delta: 8.9 GB). Free memory was 984.3 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 6.4 GB. Max. memory is 11.5 GB. [2019-12-07 18:24:44,311 INFO L168 Benchmark]: Witness Printer took 99.75 ms. Allocated memory is still 10.0 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:44,312 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.52 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. * RCFGBuilder took 496.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 984.3 MB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 598881.30 ms. Allocated memory was 1.1 GB in the beginning and 10.0 GB in the end (delta: 8.9 GB). Free memory was 984.3 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 6.4 GB. Max. memory is 11.5 GB. * Witness Printer took 99.75 ms. Allocated memory is still 10.0 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 267 ProgramPointsBefore, 129 ProgramPointsAfterwards, 330 TransitionsBefore, 163 TransitionsAfterwards, 47706 CoEnabledTransitionPairs, 8 FixpointIterations, 55 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 99 ConcurrentYvCompositions, 34 ChoiceCompositions, 21396 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 401 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 272029 CheckedPairsTotal, 201 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) VAL [!y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))=0, \read(y)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L853] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, x=0, y={6: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L855] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, x=1, y={6: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L857] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=4, weak$$choice2=1, x=1, y={6: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L797] 3 __unbuffered_p2_EAX = x [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(y) [L803] 3 y$mem_tmp = y [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L804] EXPR 3 \read(y) [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, \read(y)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L825] 4 y = 1 VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, \read(y)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, \read(y)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [\read(y)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=0, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y=1] [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [\read(y)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))=0, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y=1] [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [\read(y)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y=1] [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\read(y)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y=1] [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\read(y)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y={6:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y=1] [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 3 \read(y) [L811] 3 __unbuffered_p2_EBX = y [L828] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=4, weak$$choice2=1, x=1, y={6: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 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 [L867] 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 [L870] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 255 locations, 1 error locations. Result: UNSAFE, OverallTime: 598.6s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 87.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11365 SDtfs, 23067 SDslu, 92062 SDs, 0 SdLazy, 63239 SolverSat, 919 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 53 SyntacticMatches, 21 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3406 ImplicationChecksByTransitivity, 17.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=672692occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 131.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 486619 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1509 NumberOfCodeBlocks, 1509 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 1381039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...