./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/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 2b67a18c84ac860bf28af167cad32061179a24b6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:05:57,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:05:57,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:05:57,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:05:57,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:05:57,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:05:57,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:05:57,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:05:57,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:05:57,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:05:57,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:05:57,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:05:57,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:05:57,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:05:57,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:05:57,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:05:57,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:05:57,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:05:57,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:05:57,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:05:57,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:05:57,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:05:57,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:05:57,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:05:57,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:05:57,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:05:57,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:05:57,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:05:57,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:05:57,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:05:57,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:05:57,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:05:57,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:05:57,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:05:57,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:05:57,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:05:57,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:05:57,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:05:57,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:05:57,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:05:57,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:05:57,828 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:05:57,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:05:57,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:05:57,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:05:57,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:05:57,838 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:05:57,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:05:57,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:05:57,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:05:57,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:05:57,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:05:57,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:05:57,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:05:57,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:05:57,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:05:57,841 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:05:57,841 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_82910d50-630c-48f1-a8c6-2da39ea5b3ae/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 -> 2b67a18c84ac860bf28af167cad32061179a24b6 [2019-12-07 12:05:57,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:05:57,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:05:57,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:05:57,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:05:57,951 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:05:57,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix006_rmo.opt.i [2019-12-07 12:05:57,988 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/data/af1b1f1b6/a73d46749bd44113828ca343e707bc3a/FLAGc1a2789e5 [2019-12-07 12:05:58,395 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:05:58,396 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/sv-benchmarks/c/pthread-wmm/mix006_rmo.opt.i [2019-12-07 12:05:58,406 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/data/af1b1f1b6/a73d46749bd44113828ca343e707bc3a/FLAGc1a2789e5 [2019-12-07 12:05:58,414 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/data/af1b1f1b6/a73d46749bd44113828ca343e707bc3a [2019-12-07 12:05:58,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:05:58,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:05:58,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:05:58,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:05:58,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:05:58,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355b5b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58, skipping insertion in model container [2019-12-07 12:05:58,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:05:58,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:05:58,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:05:58,710 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:05:58,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:05:58,797 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:05:58,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58 WrapperNode [2019-12-07 12:05:58,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:05:58,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:05:58,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:05:58,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:05:58,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:05:58,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:05:58,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:05:58,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:05:58,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... [2019-12-07 12:05:58,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:05:58,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:05:58,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:05:58,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:05:58,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/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 12:05:58,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:05:58,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:05:58,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:05:58,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:05:58,912 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:05:58,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:05:58,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:05:58,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:05:58,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:05:58,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:05:58,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:05:58,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:05:58,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:05:58,913 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 12:05:59,290 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:05:59,291 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:05:59,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:05:59 BoogieIcfgContainer [2019-12-07 12:05:59,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:05:59,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:05:59,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:05:59,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:05:59,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:05:58" (1/3) ... [2019-12-07 12:05:59,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0a3016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:05:59, skipping insertion in model container [2019-12-07 12:05:59,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:58" (2/3) ... [2019-12-07 12:05:59,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0a3016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:05:59, skipping insertion in model container [2019-12-07 12:05:59,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:05:59" (3/3) ... [2019-12-07 12:05:59,296 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.opt.i [2019-12-07 12:05:59,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:05:59,303 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:05:59,307 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:05:59,308 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:05:59,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,350 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:59,378 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:05:59,392 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:05:59,392 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:05:59,392 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:05:59,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:05:59,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:05:59,392 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:05:59,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:05:59,392 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:05:59,403 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 12:05:59,404 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 12:05:59,481 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 12:05:59,482 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:05:59,497 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 12:05:59,518 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 12:05:59,553 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 12:05:59,553 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:05:59,561 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 12:05:59,585 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 12:05:59,585 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:06:02,911 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 12:06:03,018 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-07 12:06:03,018 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 12:06:03,020 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-07 12:06:05,998 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-07 12:06:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-07 12:06:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:06:06,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:06,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:06,005 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-07 12:06:06,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:06,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934213294] [2019-12-07 12:06:06,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:06,157 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 12:06:06,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934213294] [2019-12-07 12:06:06,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:06,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:06:06,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510670268] [2019-12-07 12:06:06,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:06,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:06,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:06,172 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-07 12:06:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:06,638 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-07 12:06:06,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:06,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:06:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:06,925 INFO L225 Difference]: With dead ends: 46894 [2019-12-07 12:06:06,925 INFO L226 Difference]: Without dead ends: 43674 [2019-12-07 12:06:06,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-07 12:06:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-07 12:06:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-07 12:06:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-07 12:06:08,488 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-07 12:06:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:08,489 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-07 12:06:08,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-07 12:06:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:06:08,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:08,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:08,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-07 12:06:08,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:08,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560833427] [2019-12-07 12:06:08,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:08,554 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 12:06:08,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560833427] [2019-12-07 12:06:08,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:08,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:08,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773052526] [2019-12-07 12:06:08,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:08,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:08,556 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 4 states. [2019-12-07 12:06:09,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:09,051 INFO L93 Difference]: Finished difference Result 69642 states and 274292 transitions. [2019-12-07 12:06:09,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:06:09,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:06:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:09,362 INFO L225 Difference]: With dead ends: 69642 [2019-12-07 12:06:09,362 INFO L226 Difference]: Without dead ends: 69610 [2019-12-07 12:06:09,363 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 12:06:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69610 states. [2019-12-07 12:06:11,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69610 to 67954. [2019-12-07 12:06:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67954 states. [2019-12-07 12:06:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67954 states to 67954 states and 269064 transitions. [2019-12-07 12:06:11,257 INFO L78 Accepts]: Start accepts. Automaton has 67954 states and 269064 transitions. Word has length 13 [2019-12-07 12:06:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:11,257 INFO L462 AbstractCegarLoop]: Abstraction has 67954 states and 269064 transitions. [2019-12-07 12:06:11,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 67954 states and 269064 transitions. [2019-12-07 12:06:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:06:11,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:11,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:11,262 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-07 12:06:11,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:11,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74250676] [2019-12-07 12:06:11,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:11,306 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 12:06:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74250676] [2019-12-07 12:06:11,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:11,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:11,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401489410] [2019-12-07 12:06:11,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:11,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:11,308 INFO L87 Difference]: Start difference. First operand 67954 states and 269064 transitions. Second operand 4 states. [2019-12-07 12:06:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:11,779 INFO L93 Difference]: Finished difference Result 86818 states and 338660 transitions. [2019-12-07 12:06:11,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:06:11,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:06:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:11,970 INFO L225 Difference]: With dead ends: 86818 [2019-12-07 12:06:11,970 INFO L226 Difference]: Without dead ends: 86790 [2019-12-07 12:06:11,971 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 12:06:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86790 states. [2019-12-07 12:06:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86790 to 77804. [2019-12-07 12:06:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77804 states. [2019-12-07 12:06:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77804 states to 77804 states and 306271 transitions. [2019-12-07 12:06:15,016 INFO L78 Accepts]: Start accepts. Automaton has 77804 states and 306271 transitions. Word has length 16 [2019-12-07 12:06:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:15,016 INFO L462 AbstractCegarLoop]: Abstraction has 77804 states and 306271 transitions. [2019-12-07 12:06:15,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 77804 states and 306271 transitions. [2019-12-07 12:06:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:06:15,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:15,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:15,020 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:15,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-07 12:06:15,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:15,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910773705] [2019-12-07 12:06:15,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:15,056 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 12:06:15,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910773705] [2019-12-07 12:06:15,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:15,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:15,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844942614] [2019-12-07 12:06:15,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:15,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:15,057 INFO L87 Difference]: Start difference. First operand 77804 states and 306271 transitions. Second operand 3 states. [2019-12-07 12:06:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:15,607 INFO L93 Difference]: Finished difference Result 129752 states and 490387 transitions. [2019-12-07 12:06:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:15,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:06:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:15,914 INFO L225 Difference]: With dead ends: 129752 [2019-12-07 12:06:15,914 INFO L226 Difference]: Without dead ends: 129752 [2019-12-07 12:06:15,915 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 12:06:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129752 states. [2019-12-07 12:06:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129752 to 115674. [2019-12-07 12:06:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-12-07 12:06:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 443292 transitions. [2019-12-07 12:06:19,155 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 443292 transitions. Word has length 17 [2019-12-07 12:06:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:19,156 INFO L462 AbstractCegarLoop]: Abstraction has 115674 states and 443292 transitions. [2019-12-07 12:06:19,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 443292 transitions. [2019-12-07 12:06:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:06:19,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:19,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:19,164 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1223807206, now seen corresponding path program 1 times [2019-12-07 12:06:19,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:19,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878224291] [2019-12-07 12:06:19,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:19,208 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 12:06:19,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878224291] [2019-12-07 12:06:19,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:19,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:19,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906848037] [2019-12-07 12:06:19,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:19,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:19,209 INFO L87 Difference]: Start difference. First operand 115674 states and 443292 transitions. Second operand 3 states. [2019-12-07 12:06:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:19,415 INFO L93 Difference]: Finished difference Result 63592 states and 212108 transitions. [2019-12-07 12:06:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:19,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:06:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:19,530 INFO L225 Difference]: With dead ends: 63592 [2019-12-07 12:06:19,530 INFO L226 Difference]: Without dead ends: 63592 [2019-12-07 12:06:19,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2019-12-07 12:06:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 63592. [2019-12-07 12:06:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63592 states. [2019-12-07 12:06:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63592 states to 63592 states and 212108 transitions. [2019-12-07 12:06:20,781 INFO L78 Accepts]: Start accepts. Automaton has 63592 states and 212108 transitions. Word has length 18 [2019-12-07 12:06:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:20,781 INFO L462 AbstractCegarLoop]: Abstraction has 63592 states and 212108 transitions. [2019-12-07 12:06:20,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 63592 states and 212108 transitions. [2019-12-07 12:06:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:06:20,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:20,787 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:20,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash 377507519, now seen corresponding path program 1 times [2019-12-07 12:06:20,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:20,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789167157] [2019-12-07 12:06:20,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:20,837 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 12:06:20,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789167157] [2019-12-07 12:06:20,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:20,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:20,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389133762] [2019-12-07 12:06:20,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:20,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:20,839 INFO L87 Difference]: Start difference. First operand 63592 states and 212108 transitions. Second operand 3 states. [2019-12-07 12:06:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:21,038 INFO L93 Difference]: Finished difference Result 63592 states and 209245 transitions. [2019-12-07 12:06:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:21,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:06:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:21,149 INFO L225 Difference]: With dead ends: 63592 [2019-12-07 12:06:21,149 INFO L226 Difference]: Without dead ends: 63592 [2019-12-07 12:06:21,149 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 12:06:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2019-12-07 12:06:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 62824. [2019-12-07 12:06:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62824 states. [2019-12-07 12:06:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62824 states to 62824 states and 207017 transitions. [2019-12-07 12:06:23,250 INFO L78 Accepts]: Start accepts. Automaton has 62824 states and 207017 transitions. Word has length 19 [2019-12-07 12:06:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:23,251 INFO L462 AbstractCegarLoop]: Abstraction has 62824 states and 207017 transitions. [2019-12-07 12:06:23,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 62824 states and 207017 transitions. [2019-12-07 12:06:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:06:23,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:23,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:23,254 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:23,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1584397916, now seen corresponding path program 1 times [2019-12-07 12:06:23,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:23,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133845970] [2019-12-07 12:06:23,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:23,288 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 12:06:23,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133845970] [2019-12-07 12:06:23,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:23,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:23,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65720208] [2019-12-07 12:06:23,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:23,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:23,290 INFO L87 Difference]: Start difference. First operand 62824 states and 207017 transitions. Second operand 4 states. [2019-12-07 12:06:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:23,320 INFO L93 Difference]: Finished difference Result 8983 states and 24853 transitions. [2019-12-07 12:06:23,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:23,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 12:06:23,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:23,330 INFO L225 Difference]: With dead ends: 8983 [2019-12-07 12:06:23,330 INFO L226 Difference]: Without dead ends: 8983 [2019-12-07 12:06:23,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2019-12-07 12:06:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8983. [2019-12-07 12:06:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8983 states. [2019-12-07 12:06:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8983 states to 8983 states and 24853 transitions. [2019-12-07 12:06:23,427 INFO L78 Accepts]: Start accepts. Automaton has 8983 states and 24853 transitions. Word has length 19 [2019-12-07 12:06:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:23,427 INFO L462 AbstractCegarLoop]: Abstraction has 8983 states and 24853 transitions. [2019-12-07 12:06:23,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8983 states and 24853 transitions. [2019-12-07 12:06:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:06:23,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:23,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:23,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:23,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-07 12:06:23,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:23,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016623602] [2019-12-07 12:06:23,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:23,461 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 12:06:23,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016623602] [2019-12-07 12:06:23,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:23,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:23,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678992038] [2019-12-07 12:06:23,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:23,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:23,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:23,462 INFO L87 Difference]: Start difference. First operand 8983 states and 24853 transitions. Second operand 4 states. [2019-12-07 12:06:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:23,645 INFO L93 Difference]: Finished difference Result 11447 states and 31078 transitions. [2019-12-07 12:06:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:06:23,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 12:06:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:23,656 INFO L225 Difference]: With dead ends: 11447 [2019-12-07 12:06:23,656 INFO L226 Difference]: Without dead ends: 11447 [2019-12-07 12:06:23,656 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 12:06:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11447 states. [2019-12-07 12:06:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11447 to 9009. [2019-12-07 12:06:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2019-12-07 12:06:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 24927 transitions. [2019-12-07 12:06:23,760 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 24927 transitions. Word has length 19 [2019-12-07 12:06:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:23,760 INFO L462 AbstractCegarLoop]: Abstraction has 9009 states and 24927 transitions. [2019-12-07 12:06:23,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 24927 transitions. [2019-12-07 12:06:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:06:23,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:23,765 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] [2019-12-07 12:06:23,766 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -798739535, now seen corresponding path program 1 times [2019-12-07 12:06:23,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:23,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652149537] [2019-12-07 12:06:23,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:23,804 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 12:06:23,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652149537] [2019-12-07 12:06:23,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:23,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:23,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202166063] [2019-12-07 12:06:23,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:06:23,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:06:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:23,806 INFO L87 Difference]: Start difference. First operand 9009 states and 24927 transitions. Second operand 5 states. [2019-12-07 12:06:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:24,084 INFO L93 Difference]: Finished difference Result 12078 states and 32337 transitions. [2019-12-07 12:06:24,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:06:24,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 12:06:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:24,096 INFO L225 Difference]: With dead ends: 12078 [2019-12-07 12:06:24,096 INFO L226 Difference]: Without dead ends: 12077 [2019-12-07 12:06:24,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:06:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12077 states. [2019-12-07 12:06:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12077 to 11242. [2019-12-07 12:06:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11242 states. [2019-12-07 12:06:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11242 states to 11242 states and 30517 transitions. [2019-12-07 12:06:24,226 INFO L78 Accepts]: Start accepts. Automaton has 11242 states and 30517 transitions. Word has length 31 [2019-12-07 12:06:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:24,227 INFO L462 AbstractCegarLoop]: Abstraction has 11242 states and 30517 transitions. [2019-12-07 12:06:24,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:06:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 11242 states and 30517 transitions. [2019-12-07 12:06:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 12:06:24,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:24,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] [2019-12-07 12:06:24,235 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 283122302, now seen corresponding path program 1 times [2019-12-07 12:06:24,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:24,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494256697] [2019-12-07 12:06:24,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:24,262 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 12:06:24,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494256697] [2019-12-07 12:06:24,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:24,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:24,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687693613] [2019-12-07 12:06:24,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:24,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:24,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:24,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:24,263 INFO L87 Difference]: Start difference. First operand 11242 states and 30517 transitions. Second operand 3 states. [2019-12-07 12:06:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:24,326 INFO L93 Difference]: Finished difference Result 11978 states and 30725 transitions. [2019-12-07 12:06:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:24,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 12:06:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:24,336 INFO L225 Difference]: With dead ends: 11978 [2019-12-07 12:06:24,336 INFO L226 Difference]: Without dead ends: 11978 [2019-12-07 12:06:24,337 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 12:06:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2019-12-07 12:06:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11324. [2019-12-07 12:06:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-07 12:06:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 29257 transitions. [2019-12-07 12:06:24,454 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 29257 transitions. Word has length 34 [2019-12-07 12:06:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:24,454 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 29257 transitions. [2019-12-07 12:06:24,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 29257 transitions. [2019-12-07 12:06:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:06:24,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:24,463 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] [2019-12-07 12:06:24,463 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -108911515, now seen corresponding path program 1 times [2019-12-07 12:06:24,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:24,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418328150] [2019-12-07 12:06:24,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:24,530 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 12:06:24,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418328150] [2019-12-07 12:06:24,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:24,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:24,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758251133] [2019-12-07 12:06:24,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:24,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:24,531 INFO L87 Difference]: Start difference. First operand 11324 states and 29257 transitions. Second operand 4 states. [2019-12-07 12:06:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:24,571 INFO L93 Difference]: Finished difference Result 13508 states and 33959 transitions. [2019-12-07 12:06:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:24,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 12:06:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:24,584 INFO L225 Difference]: With dead ends: 13508 [2019-12-07 12:06:24,584 INFO L226 Difference]: Without dead ends: 13296 [2019-12-07 12:06:24,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13296 states. [2019-12-07 12:06:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13296 to 13100. [2019-12-07 12:06:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13100 states. [2019-12-07 12:06:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13100 states to 13100 states and 33076 transitions. [2019-12-07 12:06:24,716 INFO L78 Accepts]: Start accepts. Automaton has 13100 states and 33076 transitions. Word has length 36 [2019-12-07 12:06:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:24,717 INFO L462 AbstractCegarLoop]: Abstraction has 13100 states and 33076 transitions. [2019-12-07 12:06:24,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 13100 states and 33076 transitions. [2019-12-07 12:06:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:06:24,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:24,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:24,727 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash -107687323, now seen corresponding path program 1 times [2019-12-07 12:06:24,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:24,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978883633] [2019-12-07 12:06:24,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:24,770 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 12:06:24,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978883633] [2019-12-07 12:06:24,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:24,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:24,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769640679] [2019-12-07 12:06:24,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:06:24,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:06:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:24,771 INFO L87 Difference]: Start difference. First operand 13100 states and 33076 transitions. Second operand 5 states. [2019-12-07 12:06:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:25,010 INFO L93 Difference]: Finished difference Result 14712 states and 36351 transitions. [2019-12-07 12:06:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:06:25,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 12:06:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:25,023 INFO L225 Difference]: With dead ends: 14712 [2019-12-07 12:06:25,023 INFO L226 Difference]: Without dead ends: 14711 [2019-12-07 12:06:25,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:06:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14711 states. [2019-12-07 12:06:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14711 to 11723. [2019-12-07 12:06:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-12-07 12:06:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 29824 transitions. [2019-12-07 12:06:25,151 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 29824 transitions. Word has length 37 [2019-12-07 12:06:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:25,151 INFO L462 AbstractCegarLoop]: Abstraction has 11723 states and 29824 transitions. [2019-12-07 12:06:25,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:06:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 29824 transitions. [2019-12-07 12:06:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:06:25,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:25,163 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] [2019-12-07 12:06:25,163 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:25,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash -540828894, now seen corresponding path program 1 times [2019-12-07 12:06:25,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:25,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701125210] [2019-12-07 12:06:25,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:25,486 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-12-07 12:06:25,506 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 12:06:25,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701125210] [2019-12-07 12:06:25,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:25,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:06:25,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096490512] [2019-12-07 12:06:25,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:06:25,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:25,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:06:25,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:06:25,508 INFO L87 Difference]: Start difference. First operand 11723 states and 29824 transitions. Second operand 9 states. [2019-12-07 12:06:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:26,614 INFO L93 Difference]: Finished difference Result 30069 states and 69895 transitions. [2019-12-07 12:06:26,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:06:26,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-12-07 12:06:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:26,639 INFO L225 Difference]: With dead ends: 30069 [2019-12-07 12:06:26,639 INFO L226 Difference]: Without dead ends: 29369 [2019-12-07 12:06:26,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:06:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29369 states. [2019-12-07 12:06:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29369 to 15522. [2019-12-07 12:06:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15522 states. [2019-12-07 12:06:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15522 states to 15522 states and 38924 transitions. [2019-12-07 12:06:26,869 INFO L78 Accepts]: Start accepts. Automaton has 15522 states and 38924 transitions. Word has length 45 [2019-12-07 12:06:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:26,869 INFO L462 AbstractCegarLoop]: Abstraction has 15522 states and 38924 transitions. [2019-12-07 12:06:26,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:06:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15522 states and 38924 transitions. [2019-12-07 12:06:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 12:06:26,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:26,886 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] [2019-12-07 12:06:26,887 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:26,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1852649929, now seen corresponding path program 1 times [2019-12-07 12:06:26,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:26,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507420224] [2019-12-07 12:06:26,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:26,927 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 12:06:26,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507420224] [2019-12-07 12:06:26,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:26,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:06:26,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674476357] [2019-12-07 12:06:26,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:06:26,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:06:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:26,929 INFO L87 Difference]: Start difference. First operand 15522 states and 38924 transitions. Second operand 5 states. [2019-12-07 12:06:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:26,969 INFO L93 Difference]: Finished difference Result 12097 states and 31514 transitions. [2019-12-07 12:06:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:06:26,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-07 12:06:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:26,979 INFO L225 Difference]: With dead ends: 12097 [2019-12-07 12:06:26,979 INFO L226 Difference]: Without dead ends: 11215 [2019-12-07 12:06:26,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11215 states. [2019-12-07 12:06:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11215 to 10632. [2019-12-07 12:06:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10632 states. [2019-12-07 12:06:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 27860 transitions. [2019-12-07 12:06:27,093 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 27860 transitions. Word has length 46 [2019-12-07 12:06:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:27,093 INFO L462 AbstractCegarLoop]: Abstraction has 10632 states and 27860 transitions. [2019-12-07 12:06:27,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:06:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 27860 transitions. [2019-12-07 12:06:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:06:27,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:27,102 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:27,103 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1486439051, now seen corresponding path program 1 times [2019-12-07 12:06:27,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:27,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100600300] [2019-12-07 12:06:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:27,184 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 12:06:27,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100600300] [2019-12-07 12:06:27,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:27,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:06:27,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942776716] [2019-12-07 12:06:27,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:27,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:27,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:27,186 INFO L87 Difference]: Start difference. First operand 10632 states and 27860 transitions. Second operand 4 states. [2019-12-07 12:06:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:27,395 INFO L93 Difference]: Finished difference Result 11426 states and 29415 transitions. [2019-12-07 12:06:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:27,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 12:06:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:27,407 INFO L225 Difference]: With dead ends: 11426 [2019-12-07 12:06:27,407 INFO L226 Difference]: Without dead ends: 11426 [2019-12-07 12:06:27,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:27,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11426 states. [2019-12-07 12:06:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11426 to 10905. [2019-12-07 12:06:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2019-12-07 12:06:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 28192 transitions. [2019-12-07 12:06:27,524 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 28192 transitions. Word has length 62 [2019-12-07 12:06:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:27,525 INFO L462 AbstractCegarLoop]: Abstraction has 10905 states and 28192 transitions. [2019-12-07 12:06:27,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 28192 transitions. [2019-12-07 12:06:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:06:27,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:27,533 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] [2019-12-07 12:06:27,534 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1066134383, now seen corresponding path program 2 times [2019-12-07 12:06:27,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:27,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18505344] [2019-12-07 12:06:27,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:27,767 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 12:06:27,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18505344] [2019-12-07 12:06:27,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:27,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:06:27,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492066043] [2019-12-07 12:06:27,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:06:27,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:06:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:06:27,769 INFO L87 Difference]: Start difference. First operand 10905 states and 28192 transitions. Second operand 10 states. [2019-12-07 12:06:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:28,777 INFO L93 Difference]: Finished difference Result 16859 states and 40620 transitions. [2019-12-07 12:06:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:06:28,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-07 12:06:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:28,795 INFO L225 Difference]: With dead ends: 16859 [2019-12-07 12:06:28,795 INFO L226 Difference]: Without dead ends: 16066 [2019-12-07 12:06:28,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:06:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16066 states. [2019-12-07 12:06:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16066 to 12360. [2019-12-07 12:06:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12360 states. [2019-12-07 12:06:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12360 states to 12360 states and 31026 transitions. [2019-12-07 12:06:28,947 INFO L78 Accepts]: Start accepts. Automaton has 12360 states and 31026 transitions. Word has length 62 [2019-12-07 12:06:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:28,947 INFO L462 AbstractCegarLoop]: Abstraction has 12360 states and 31026 transitions. [2019-12-07 12:06:28,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:06:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 12360 states and 31026 transitions. [2019-12-07 12:06:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:06:28,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:28,957 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] [2019-12-07 12:06:28,957 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:28,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1757674643, now seen corresponding path program 3 times [2019-12-07 12:06:28,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:28,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170968660] [2019-12-07 12:06:28,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:29,039 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 12:06:29,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170968660] [2019-12-07 12:06:29,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:29,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:06:29,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545532873] [2019-12-07 12:06:29,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:06:29,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:06:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:06:29,040 INFO L87 Difference]: Start difference. First operand 12360 states and 31026 transitions. Second operand 7 states. [2019-12-07 12:06:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:29,238 INFO L93 Difference]: Finished difference Result 22719 states and 55951 transitions. [2019-12-07 12:06:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:06:29,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 12:06:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:29,254 INFO L225 Difference]: With dead ends: 22719 [2019-12-07 12:06:29,254 INFO L226 Difference]: Without dead ends: 16817 [2019-12-07 12:06:29,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:06:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2019-12-07 12:06:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 12459. [2019-12-07 12:06:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-12-07 12:06:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 31173 transitions. [2019-12-07 12:06:29,414 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 31173 transitions. Word has length 62 [2019-12-07 12:06:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:29,414 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 31173 transitions. [2019-12-07 12:06:29,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:06:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 31173 transitions. [2019-12-07 12:06:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:06:29,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:29,424 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] [2019-12-07 12:06:29,425 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash 710760804, now seen corresponding path program 1 times [2019-12-07 12:06:29,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:29,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661895955] [2019-12-07 12:06:29,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:29,460 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 12:06:29,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661895955] [2019-12-07 12:06:29,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:29,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:29,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422929457] [2019-12-07 12:06:29,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:29,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:29,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:29,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:29,461 INFO L87 Difference]: Start difference. First operand 12459 states and 31173 transitions. Second operand 4 states. [2019-12-07 12:06:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:29,511 INFO L93 Difference]: Finished difference Result 13713 states and 33880 transitions. [2019-12-07 12:06:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:29,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 12:06:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:29,516 INFO L225 Difference]: With dead ends: 13713 [2019-12-07 12:06:29,516 INFO L226 Difference]: Without dead ends: 4851 [2019-12-07 12:06:29,516 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 12:06:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-12-07 12:06:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4851. [2019-12-07 12:06:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4851 states. [2019-12-07 12:06:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 11545 transitions. [2019-12-07 12:06:29,565 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 11545 transitions. Word has length 63 [2019-12-07 12:06:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:29,565 INFO L462 AbstractCegarLoop]: Abstraction has 4851 states and 11545 transitions. [2019-12-07 12:06:29,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 11545 transitions. [2019-12-07 12:06:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:06:29,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:29,571 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] [2019-12-07 12:06:29,571 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:29,571 INFO L82 PathProgramCache]: Analyzing trace with hash -942471944, now seen corresponding path program 2 times [2019-12-07 12:06:29,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:29,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285648700] [2019-12-07 12:06:29,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:29,631 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 12:06:29,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285648700] [2019-12-07 12:06:29,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:29,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:29,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898649176] [2019-12-07 12:06:29,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:29,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:29,632 INFO L87 Difference]: Start difference. First operand 4851 states and 11545 transitions. Second operand 4 states. [2019-12-07 12:06:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:29,657 INFO L93 Difference]: Finished difference Result 5317 states and 12517 transitions. [2019-12-07 12:06:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:29,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 12:06:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:29,658 INFO L225 Difference]: With dead ends: 5317 [2019-12-07 12:06:29,658 INFO L226 Difference]: Without dead ends: 562 [2019-12-07 12:06:29,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-12-07 12:06:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-12-07 12:06:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-07 12:06:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1154 transitions. [2019-12-07 12:06:29,663 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1154 transitions. Word has length 63 [2019-12-07 12:06:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:29,663 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 1154 transitions. [2019-12-07 12:06:29,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1154 transitions. [2019-12-07 12:06:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:06:29,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:29,663 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] [2019-12-07 12:06:29,664 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash 424994232, now seen corresponding path program 3 times [2019-12-07 12:06:29,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:29,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258844362] [2019-12-07 12:06:29,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:29,735 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 12:06:29,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258844362] [2019-12-07 12:06:29,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:29,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:06:29,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231079887] [2019-12-07 12:06:29,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:06:29,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:06:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:06:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:06:29,737 INFO L87 Difference]: Start difference. First operand 562 states and 1154 transitions. Second operand 7 states. [2019-12-07 12:06:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:29,928 INFO L93 Difference]: Finished difference Result 1090 states and 2238 transitions. [2019-12-07 12:06:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:06:29,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-07 12:06:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:29,929 INFO L225 Difference]: With dead ends: 1090 [2019-12-07 12:06:29,929 INFO L226 Difference]: Without dead ends: 783 [2019-12-07 12:06:29,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:06:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-12-07 12:06:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 613. [2019-12-07 12:06:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-07 12:06:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1241 transitions. [2019-12-07 12:06:29,934 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1241 transitions. Word has length 63 [2019-12-07 12:06:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:29,934 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1241 transitions. [2019-12-07 12:06:29,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:06:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1241 transitions. [2019-12-07 12:06:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:06:29,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:29,935 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] [2019-12-07 12:06:29,935 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 4 times [2019-12-07 12:06:29,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:06:29,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650159544] [2019-12-07 12:06:29,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:06:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:06:30,007 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:06:30,007 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:06:30,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t168~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t168~0.base_25|) |v_ULTIMATE.start_main_~#t168~0.offset_18| 0))) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t168~0.base_25| 1)) (= v_~y$w_buff0_used~0_960 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t168~0.base_25|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t168~0.base_25| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t168~0.base_25|) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= |v_ULTIMATE.start_main_~#t168~0.offset_18| 0) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t169~0.base=|v_ULTIMATE.start_main_~#t169~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_~#t170~0.offset=|v_ULTIMATE.start_main_~#t170~0.offset_15|, ULTIMATE.start_main_~#t168~0.offset=|v_ULTIMATE.start_main_~#t168~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ULTIMATE.start_main_~#t170~0.base=|v_ULTIMATE.start_main_~#t170~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t168~0.base=|v_ULTIMATE.start_main_~#t168~0.base_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ULTIMATE.start_main_~#t169~0.offset=|v_ULTIMATE.start_main_~#t169~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t169~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t170~0.offset, ULTIMATE.start_main_~#t168~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t170~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t168~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t169~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:06:30,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t169~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t169~0.base_13|) |v_ULTIMATE.start_main_~#t169~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t169~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t169~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t169~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t169~0.base_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t169~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t169~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t169~0.base=|v_ULTIMATE.start_main_~#t169~0.base_13|, ULTIMATE.start_main_~#t169~0.offset=|v_ULTIMATE.start_main_~#t169~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t169~0.base, ULTIMATE.start_main_~#t169~0.offset] because there is no mapped edge [2019-12-07 12:06:30,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t170~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t170~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t170~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t170~0.base_12|) |v_ULTIMATE.start_main_~#t170~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t170~0.base_12|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t170~0.base_12|) 0) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t170~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t170~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t170~0.base=|v_ULTIMATE.start_main_~#t170~0.base_12|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t170~0.offset=|v_ULTIMATE.start_main_~#t170~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t170~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t170~0.offset] because there is no mapped edge [2019-12-07 12:06:30,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 12:06:30,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2145746920 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2145746920 256) 0))) (or (and (= ~y$w_buff1~0_In-2145746920 |P2Thread1of1ForFork0_#t~ite28_Out-2145746920|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff0~0_In-2145746920 |P2Thread1of1ForFork0_#t~ite28_Out-2145746920|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145746920, ~y$w_buff1~0=~y$w_buff1~0_In-2145746920, ~y$w_buff0~0=~y$w_buff0~0_In-2145746920, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2145746920} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-2145746920|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145746920, ~y$w_buff1~0=~y$w_buff1~0_In-2145746920, ~y$w_buff0~0=~y$w_buff0~0_In-2145746920, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2145746920} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:06:30,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 12:06:30,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 12:06:30,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In702999901 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out702999901| ~y$mem_tmp~0_In702999901) (not .cse0)) (and (= ~y~0_In702999901 |P2Thread1of1ForFork0_#t~ite48_Out702999901|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In702999901, ~y$flush_delayed~0=~y$flush_delayed~0_In702999901, ~y~0=~y~0_In702999901} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out702999901|, ~y$mem_tmp~0=~y$mem_tmp~0_In702999901, ~y$flush_delayed~0=~y$flush_delayed~0_In702999901, ~y~0=~y~0_In702999901} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 12:06:30,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 12:06:30,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-645791489 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-645791489| ~y~0_In-645791489)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-645791489| ~y$mem_tmp~0_In-645791489) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-645791489, ~y$flush_delayed~0=~y$flush_delayed~0_In-645791489, ~y~0=~y~0_In-645791489} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-645791489, ~y$flush_delayed~0=~y$flush_delayed~0_In-645791489, ~y~0=~y~0_In-645791489, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-645791489|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:06:30,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:06:30,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1716615384 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1716615384 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1716615384| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-1716615384| ~y$w_buff0_used~0_In-1716615384)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716615384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1716615384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716615384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1716615384, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1716615384|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 12:06:30,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-745410913 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-745410913 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-745410913 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-745410913 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-745410913| ~y$w_buff1_used~0_In-745410913)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite52_Out-745410913| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-745410913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-745410913, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-745410913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-745410913} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-745410913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-745410913, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-745410913, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-745410913|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-745410913} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 12:06:30,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In792711045 256))) (.cse2 (= ~y$r_buff0_thd3~0_In792711045 ~y$r_buff0_thd3~0_Out792711045)) (.cse0 (= (mod ~y$w_buff0_used~0_In792711045 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out792711045 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In792711045, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In792711045} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In792711045, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out792711045, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out792711045|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 12:06:30,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1927479221 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1927479221 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1927479221 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1927479221 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1927479221|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1927479221 |P2Thread1of1ForFork0_#t~ite54_Out1927479221|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1927479221, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1927479221, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1927479221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1927479221} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1927479221, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1927479221, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1927479221|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1927479221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1927479221} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 12:06:30,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 12:06:30,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:06:30,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-262127802| |ULTIMATE.start_main_#t~ite59_Out-262127802|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-262127802 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-262127802 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-262127802| ~y~0_In-262127802)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out-262127802| ~y$w_buff1~0_In-262127802) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-262127802, ~y~0=~y~0_In-262127802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-262127802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262127802} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-262127802, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-262127802|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-262127802|, ~y~0=~y~0_In-262127802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-262127802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262127802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:06:30,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1707942787 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1707942787 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1707942787| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1707942787 |ULTIMATE.start_main_#t~ite60_Out1707942787|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1707942787, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1707942787} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1707942787|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1707942787, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1707942787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:06:30,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1074490998 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1074490998 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1074490998 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1074490998 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1074490998|)) (and (= ~y$w_buff1_used~0_In1074490998 |ULTIMATE.start_main_#t~ite61_Out1074490998|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1074490998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1074490998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1074490998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074490998} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1074490998|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074490998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1074490998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1074490998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074490998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:06:30,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1314447843 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1314447843 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1314447843|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1314447843 |ULTIMATE.start_main_#t~ite62_Out1314447843|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1314447843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1314447843} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1314447843|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1314447843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1314447843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:06:30,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-438072077 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-438072077 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-438072077 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-438072077 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out-438072077| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-438072077| ~y$r_buff1_thd0~0_In-438072077) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-438072077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438072077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-438072077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438072077} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-438072077|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438072077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438072077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-438072077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438072077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:06:30,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:06:30,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:06:30 BasicIcfg [2019-12-07 12:06:30,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:06:30,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:06:30,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:06:30,086 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:06:30,086 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:05:59" (3/4) ... [2019-12-07 12:06:30,088 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:06:30,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t168~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t168~0.base_25|) |v_ULTIMATE.start_main_~#t168~0.offset_18| 0))) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t168~0.base_25| 1)) (= v_~y$w_buff0_used~0_960 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t168~0.base_25|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t168~0.base_25| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= v_~y~0_332 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t168~0.base_25|) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~y$w_buff0~0_491) (= |v_ULTIMATE.start_main_~#t168~0.offset_18| 0) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t169~0.base=|v_ULTIMATE.start_main_~#t169~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_~#t170~0.offset=|v_ULTIMATE.start_main_~#t170~0.offset_15|, ULTIMATE.start_main_~#t168~0.offset=|v_ULTIMATE.start_main_~#t168~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ULTIMATE.start_main_~#t170~0.base=|v_ULTIMATE.start_main_~#t170~0.base_22|, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t168~0.base=|v_ULTIMATE.start_main_~#t168~0.base_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ULTIMATE.start_main_~#t169~0.offset=|v_ULTIMATE.start_main_~#t169~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t169~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t170~0.offset, ULTIMATE.start_main_~#t168~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t170~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t168~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t169~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:06:30,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t169~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t169~0.base_13|) |v_ULTIMATE.start_main_~#t169~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t169~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t169~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t169~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t169~0.base_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t169~0.base_13|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t169~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t169~0.base=|v_ULTIMATE.start_main_~#t169~0.base_13|, ULTIMATE.start_main_~#t169~0.offset=|v_ULTIMATE.start_main_~#t169~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t169~0.base, ULTIMATE.start_main_~#t169~0.offset] because there is no mapped edge [2019-12-07 12:06:30,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t170~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t170~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t170~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t170~0.base_12|) |v_ULTIMATE.start_main_~#t170~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t170~0.base_12|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t170~0.base_12|) 0) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t170~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t170~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t170~0.base=|v_ULTIMATE.start_main_~#t170~0.base_12|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t170~0.offset=|v_ULTIMATE.start_main_~#t170~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t170~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t170~0.offset] because there is no mapped edge [2019-12-07 12:06:30,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 12:06:30,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2145746920 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2145746920 256) 0))) (or (and (= ~y$w_buff1~0_In-2145746920 |P2Thread1of1ForFork0_#t~ite28_Out-2145746920|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff0~0_In-2145746920 |P2Thread1of1ForFork0_#t~ite28_Out-2145746920|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145746920, ~y$w_buff1~0=~y$w_buff1~0_In-2145746920, ~y$w_buff0~0=~y$w_buff0~0_In-2145746920, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2145746920} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-2145746920|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145746920, ~y$w_buff1~0=~y$w_buff1~0_In-2145746920, ~y$w_buff0~0=~y$w_buff0~0_In-2145746920, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2145746920} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:06:30,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 12:06:30,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 12:06:30,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In702999901 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out702999901| ~y$mem_tmp~0_In702999901) (not .cse0)) (and (= ~y~0_In702999901 |P2Thread1of1ForFork0_#t~ite48_Out702999901|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In702999901, ~y$flush_delayed~0=~y$flush_delayed~0_In702999901, ~y~0=~y~0_In702999901} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out702999901|, ~y$mem_tmp~0=~y$mem_tmp~0_In702999901, ~y$flush_delayed~0=~y$flush_delayed~0_In702999901, ~y~0=~y~0_In702999901} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 12:06:30,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 12:06:30,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-645791489 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-645791489| ~y~0_In-645791489)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out-645791489| ~y$mem_tmp~0_In-645791489) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-645791489, ~y$flush_delayed~0=~y$flush_delayed~0_In-645791489, ~y~0=~y~0_In-645791489} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-645791489, ~y$flush_delayed~0=~y$flush_delayed~0_In-645791489, ~y~0=~y~0_In-645791489, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-645791489|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:06:30,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:06:30,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1716615384 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1716615384 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1716615384| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-1716615384| ~y$w_buff0_used~0_In-1716615384)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716615384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1716615384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716615384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1716615384, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1716615384|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 12:06:30,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-745410913 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-745410913 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-745410913 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-745410913 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out-745410913| ~y$w_buff1_used~0_In-745410913)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite52_Out-745410913| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-745410913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-745410913, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-745410913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-745410913} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-745410913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-745410913, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-745410913, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-745410913|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-745410913} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 12:06:30,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In792711045 256))) (.cse2 (= ~y$r_buff0_thd3~0_In792711045 ~y$r_buff0_thd3~0_Out792711045)) (.cse0 (= (mod ~y$w_buff0_used~0_In792711045 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out792711045 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In792711045, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In792711045} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In792711045, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out792711045, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out792711045|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 12:06:30,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1927479221 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1927479221 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1927479221 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1927479221 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1927479221|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1927479221 |P2Thread1of1ForFork0_#t~ite54_Out1927479221|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1927479221, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1927479221, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1927479221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1927479221} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1927479221, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1927479221, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1927479221|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1927479221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1927479221} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 12:06:30,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 12:06:30,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:06:30,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-262127802| |ULTIMATE.start_main_#t~ite59_Out-262127802|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-262127802 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-262127802 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-262127802| ~y~0_In-262127802)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out-262127802| ~y$w_buff1~0_In-262127802) (not .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-262127802, ~y~0=~y~0_In-262127802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-262127802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262127802} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-262127802, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-262127802|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-262127802|, ~y~0=~y~0_In-262127802, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-262127802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262127802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:06:30,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1707942787 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1707942787 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out1707942787| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1707942787 |ULTIMATE.start_main_#t~ite60_Out1707942787|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1707942787, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1707942787} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1707942787|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1707942787, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1707942787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:06:30,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1074490998 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1074490998 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1074490998 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1074490998 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite61_Out1074490998|)) (and (= ~y$w_buff1_used~0_In1074490998 |ULTIMATE.start_main_#t~ite61_Out1074490998|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1074490998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1074490998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1074490998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074490998} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1074490998|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1074490998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1074490998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1074490998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1074490998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:06:30,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1314447843 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1314447843 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1314447843|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1314447843 |ULTIMATE.start_main_#t~ite62_Out1314447843|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1314447843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1314447843} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1314447843|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1314447843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1314447843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:06:30,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-438072077 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-438072077 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-438072077 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-438072077 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out-438072077| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-438072077| ~y$r_buff1_thd0~0_In-438072077) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-438072077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438072077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-438072077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438072077} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-438072077|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438072077, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438072077, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-438072077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438072077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:06:30,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:06:30,161 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_82910d50-630c-48f1-a8c6-2da39ea5b3ae/bin/uautomizer/witness.graphml [2019-12-07 12:06:30,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:06:30,162 INFO L168 Benchmark]: Toolchain (without parser) took 31745.11 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 942.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,162 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:06:30,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,163 INFO L168 Benchmark]: Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,163 INFO L168 Benchmark]: RCFGBuilder took 426.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,164 INFO L168 Benchmark]: TraceAbstraction took 30793.27 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,164 INFO L168 Benchmark]: Witness Printer took 75.57 ms. Allocated memory is still 4.6 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:06:30,165 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30793.27 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 75.57 ms. Allocated memory is still 4.6 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t168, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L835] FCALL, FORK 0 pthread_create(&t169, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L837] FCALL, FORK 0 pthread_create(&t170, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=3, weak$$choice2=1, x=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=3, weak$$choice2=1, x=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 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)) [L797] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=3, weak$$choice2=1, x=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 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)) [L798] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=3, weak$$choice2=1, x=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 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)) [L799] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=3, weak$$choice2=1, x=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 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)) [L801] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=3, weak$$choice2=1, x=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 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)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=1, x=2, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 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) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 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 [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4627 SDtfs, 5549 SDslu, 8283 SDs, 0 SdLazy, 3533 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115674occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 55784 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 222967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...