./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/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 6502699b0636f14dc84962f4c9a7dd4684a89e27 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:34:12,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:34:12,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:34:12,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:34:12,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:34:12,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:34:12,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:34:12,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:34:12,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:34:12,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:34:12,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:34:12,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:34:12,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:34:12,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:34:12,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:34:12,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:34:12,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:34:12,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:34:12,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:34:12,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:34:12,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:34:12,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:34:12,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:34:12,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:34:12,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:34:12,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:34:12,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:34:12,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:34:12,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:34:12,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:34:12,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:34:12,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:34:12,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:34:12,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:34:12,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:34:12,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:34:12,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:34:12,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:34:12,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:34:12,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:34:12,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:34:12,707 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:34:12,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:34:12,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:34:12,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:34:12,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:34:12,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:34:12,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:34:12,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:34:12,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:34:12,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:34:12,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:34:12,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:34:12,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:34:12,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:34:12,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:34:12,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:34:12,719 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_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/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 -> 6502699b0636f14dc84962f4c9a7dd4684a89e27 [2019-12-07 13:34:12,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:34:12,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:34:12,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:34:12,835 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:34:12,835 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:34:12,835 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc.i [2019-12-07 13:34:12,882 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/data/0a979f604/156fa5fee46341babbb904e6fe7a6546/FLAG001f63e3f [2019-12-07 13:34:13,246 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:34:13,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/sv-benchmarks/c/pthread-wmm/safe034_rmo.oepc.i [2019-12-07 13:34:13,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/data/0a979f604/156fa5fee46341babbb904e6fe7a6546/FLAG001f63e3f [2019-12-07 13:34:13,268 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/data/0a979f604/156fa5fee46341babbb904e6fe7a6546 [2019-12-07 13:34:13,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:34:13,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:34:13,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:34:13,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:34:13,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:34:13,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13, skipping insertion in model container [2019-12-07 13:34:13,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:34:13,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:34:13,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:34:13,559 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:34:13,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:34:13,646 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:34:13,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13 WrapperNode [2019-12-07 13:34:13,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:34:13,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:34:13,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:34:13,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:34:13,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:34:13,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:34:13,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:34:13,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:34:13,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... [2019-12-07 13:34:13,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:34:13,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:34:13,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:34:13,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:34:13,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:34:13,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:34:13,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:34:13,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:34:13,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:34:13,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:34:13,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:34:13,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:34:13,760 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:34:14,104 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:34:14,105 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:34:14,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:34:14 BoogieIcfgContainer [2019-12-07 13:34:14,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:34:14,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:34:14,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:34:14,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:34:14,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:34:13" (1/3) ... [2019-12-07 13:34:14,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c05e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:34:14, skipping insertion in model container [2019-12-07 13:34:14,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:13" (2/3) ... [2019-12-07 13:34:14,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c05e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:34:14, skipping insertion in model container [2019-12-07 13:34:14,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:34:14" (3/3) ... [2019-12-07 13:34:14,110 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_rmo.oepc.i [2019-12-07 13:34:14,116 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:34:14,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:34:14,121 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:34:14,121 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:34:14,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,144 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:34:14,180 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:34:14,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:34:14,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:34:14,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:34:14,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:34:14,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:34:14,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:34:14,195 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:34:14,195 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:34:14,205 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-07 13:34:14,206 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 13:34:14,263 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 13:34:14,264 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:34:14,274 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 13:34:14,287 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-07 13:34:14,312 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-07 13:34:14,312 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:34:14,315 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 13:34:14,325 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 13:34:14,326 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:34:16,826 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 13:34:17,029 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-07 13:34:17,029 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 13:34:17,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-07 13:34:17,732 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-07 13:34:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-07 13:34:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:34:17,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:17,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:34:17,739 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 13:34:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-07 13:34:17,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:17,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815123400] [2019-12-07 13:34:17,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:17,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815123400] [2019-12-07 13:34:17,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:17,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:34:17,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135517023] [2019-12-07 13:34:17,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:17,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:17,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:17,941 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-07 13:34:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:18,131 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-07 13:34:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:18,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:34:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:18,227 INFO L225 Difference]: With dead ends: 13722 [2019-12-07 13:34:18,227 INFO L226 Difference]: Without dead ends: 12214 [2019-12-07 13:34:18,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-07 13:34:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-07 13:34:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-07 13:34:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-07 13:34:18,715 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-07 13:34:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:18,716 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-07 13:34:18,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-07 13:34:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:34:18,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:18,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:34:18,721 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 13:34:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-07 13:34:18,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:18,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990424709] [2019-12-07 13:34:18,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:18,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990424709] [2019-12-07 13:34:18,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:18,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:34:18,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329674832] [2019-12-07 13:34:18,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:34:18,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:34:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:34:18,792 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-07 13:34:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:19,073 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-07 13:34:19,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:34:19,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:34:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:19,135 INFO L225 Difference]: With dead ends: 18446 [2019-12-07 13:34:19,135 INFO L226 Difference]: Without dead ends: 18390 [2019-12-07 13:34:19,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:34:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-07 13:34:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-07 13:34:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-07 13:34:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-07 13:34:19,592 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-07 13:34:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:19,592 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-07 13:34:19,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:34:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-07 13:34:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:34:19,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:19,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:34:19,599 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 13:34:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-07 13:34:19,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:19,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187308849] [2019-12-07 13:34:19,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:19,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187308849] [2019-12-07 13:34:19,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:19,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:34:19,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442527458] [2019-12-07 13:34:19,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:34:19,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:19,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:34:19,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:34:19,658 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-07 13:34:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:19,899 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-07 13:34:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:34:19,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 13:34:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:19,942 INFO L225 Difference]: With dead ends: 24000 [2019-12-07 13:34:19,942 INFO L226 Difference]: Without dead ends: 23924 [2019-12-07 13:34:19,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:34:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-07 13:34:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-07 13:34:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-07 13:34:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-07 13:34:20,420 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-07 13:34:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:20,421 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-07 13:34:20,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:34:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-07 13:34:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:34:20,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:20,426 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 13:34:20,426 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 13:34:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-07 13:34:20,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:20,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182976473] [2019-12-07 13:34:20,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:20,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182976473] [2019-12-07 13:34:20,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:20,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:34:20,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123925413] [2019-12-07 13:34:20,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:20,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:20,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:20,486 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-07 13:34:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:20,565 INFO L93 Difference]: Finished difference Result 19280 states and 70741 transitions. [2019-12-07 13:34:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:20,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:34:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:20,597 INFO L225 Difference]: With dead ends: 19280 [2019-12-07 13:34:20,598 INFO L226 Difference]: Without dead ends: 19280 [2019-12-07 13:34:20,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2019-12-07 13:34:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 19016. [2019-12-07 13:34:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19016 states. [2019-12-07 13:34:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 69841 transitions. [2019-12-07 13:34:20,961 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 69841 transitions. Word has length 18 [2019-12-07 13:34:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:20,961 INFO L462 AbstractCegarLoop]: Abstraction has 19016 states and 69841 transitions. [2019-12-07 13:34:20,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 69841 transitions. [2019-12-07 13:34:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:34:20,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:20,966 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 13:34:20,966 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 13:34:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2086322840, now seen corresponding path program 1 times [2019-12-07 13:34:20,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:20,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427825170] [2019-12-07 13:34:20,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:21,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427825170] [2019-12-07 13:34:21,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:21,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:34:21,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395378929] [2019-12-07 13:34:21,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:21,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:21,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:21,025 INFO L87 Difference]: Start difference. First operand 19016 states and 69841 transitions. Second operand 3 states. [2019-12-07 13:34:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:21,189 INFO L93 Difference]: Finished difference Result 26927 states and 94091 transitions. [2019-12-07 13:34:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:21,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:34:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:21,231 INFO L225 Difference]: With dead ends: 26927 [2019-12-07 13:34:21,231 INFO L226 Difference]: Without dead ends: 26295 [2019-12-07 13:34:21,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26295 states. [2019-12-07 13:34:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26295 to 25562. [2019-12-07 13:34:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2019-12-07 13:34:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 90430 transitions. [2019-12-07 13:34:21,693 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 90430 transitions. Word has length 18 [2019-12-07 13:34:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:21,693 INFO L462 AbstractCegarLoop]: Abstraction has 25562 states and 90430 transitions. [2019-12-07 13:34:21,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 90430 transitions. [2019-12-07 13:34:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:34:21,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:21,699 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 13:34:21,699 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 13:34:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:21,699 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-07 13:34:21,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:21,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934674055] [2019-12-07 13:34:21,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:21,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934674055] [2019-12-07 13:34:21,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:21,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:34:21,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625551353] [2019-12-07 13:34:21,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:34:21,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:34:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:34:21,741 INFO L87 Difference]: Start difference. First operand 25562 states and 90430 transitions. Second operand 5 states. [2019-12-07 13:34:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:21,783 INFO L93 Difference]: Finished difference Result 4382 states and 12860 transitions. [2019-12-07 13:34:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:34:21,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 13:34:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:21,786 INFO L225 Difference]: With dead ends: 4382 [2019-12-07 13:34:21,786 INFO L226 Difference]: Without dead ends: 2858 [2019-12-07 13:34:21,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:34:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-12-07 13:34:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2019-12-07 13:34:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2019-12-07 13:34:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 7333 transitions. [2019-12-07 13:34:21,818 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 7333 transitions. Word has length 19 [2019-12-07 13:34:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:21,818 INFO L462 AbstractCegarLoop]: Abstraction has 2858 states and 7333 transitions. [2019-12-07 13:34:21,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:34:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 7333 transitions. [2019-12-07 13:34:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:34:21,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:21,821 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] [2019-12-07 13:34:21,821 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 13:34:21,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-07 13:34:21,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:21,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680203219] [2019-12-07 13:34:21,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:21,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680203219] [2019-12-07 13:34:21,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:21,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:34:21,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796797141] [2019-12-07 13:34:21,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:21,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:21,855 INFO L87 Difference]: Start difference. First operand 2858 states and 7333 transitions. Second operand 3 states. [2019-12-07 13:34:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:21,895 INFO L93 Difference]: Finished difference Result 3915 states and 9708 transitions. [2019-12-07 13:34:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:21,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 13:34:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:21,899 INFO L225 Difference]: With dead ends: 3915 [2019-12-07 13:34:21,899 INFO L226 Difference]: Without dead ends: 3915 [2019-12-07 13:34:21,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:21,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2019-12-07 13:34:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3005. [2019-12-07 13:34:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-12-07 13:34:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7535 transitions. [2019-12-07 13:34:21,959 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7535 transitions. Word has length 29 [2019-12-07 13:34:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:21,960 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 7535 transitions. [2019-12-07 13:34:21,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7535 transitions. [2019-12-07 13:34:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:34:21,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:21,964 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] [2019-12-07 13:34:21,964 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 13:34:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-07 13:34:21,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:21,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432359083] [2019-12-07 13:34:21,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:22,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432359083] [2019-12-07 13:34:22,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:22,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:34:22,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586712111] [2019-12-07 13:34:22,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:34:22,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:34:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:34:22,013 INFO L87 Difference]: Start difference. First operand 3005 states and 7535 transitions. Second operand 6 states. [2019-12-07 13:34:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:22,223 INFO L93 Difference]: Finished difference Result 4482 states and 10963 transitions. [2019-12-07 13:34:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:34:22,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 13:34:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:22,226 INFO L225 Difference]: With dead ends: 4482 [2019-12-07 13:34:22,226 INFO L226 Difference]: Without dead ends: 4474 [2019-12-07 13:34:22,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:34:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2019-12-07 13:34:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 3100. [2019-12-07 13:34:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-12-07 13:34:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 7742 transitions. [2019-12-07 13:34:22,260 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 7742 transitions. Word has length 29 [2019-12-07 13:34:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:22,260 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 7742 transitions. [2019-12-07 13:34:22,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:34:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 7742 transitions. [2019-12-07 13:34:22,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:34:22,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:22,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:34:22,264 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 13:34:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1852558596, now seen corresponding path program 1 times [2019-12-07 13:34:22,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:22,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153421010] [2019-12-07 13:34:22,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:22,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153421010] [2019-12-07 13:34:22,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:22,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:34:22,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685971923] [2019-12-07 13:34:22,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:34:22,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:34:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:34:22,324 INFO L87 Difference]: Start difference. First operand 3100 states and 7742 transitions. Second operand 6 states. [2019-12-07 13:34:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:22,372 INFO L93 Difference]: Finished difference Result 1877 states and 4852 transitions. [2019-12-07 13:34:22,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:34:22,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 13:34:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:22,374 INFO L225 Difference]: With dead ends: 1877 [2019-12-07 13:34:22,374 INFO L226 Difference]: Without dead ends: 1747 [2019-12-07 13:34:22,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:34:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-12-07 13:34:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1256. [2019-12-07 13:34:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-12-07 13:34:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 3372 transitions. [2019-12-07 13:34:22,389 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 3372 transitions. Word has length 30 [2019-12-07 13:34:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:22,389 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 3372 transitions. [2019-12-07 13:34:22,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:34:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 3372 transitions. [2019-12-07 13:34:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:34:22,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:22,392 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 13:34:22,392 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 13:34:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-12-07 13:34:22,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:22,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120380272] [2019-12-07 13:34:22,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:22,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120380272] [2019-12-07 13:34:22,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:22,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:34:22,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877937696] [2019-12-07 13:34:22,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:22,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:22,421 INFO L87 Difference]: Start difference. First operand 1256 states and 3372 transitions. Second operand 3 states. [2019-12-07 13:34:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:22,447 INFO L93 Difference]: Finished difference Result 1456 states and 3760 transitions. [2019-12-07 13:34:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:22,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 13:34:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:22,449 INFO L225 Difference]: With dead ends: 1456 [2019-12-07 13:34:22,449 INFO L226 Difference]: Without dead ends: 1456 [2019-12-07 13:34:22,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-12-07 13:34:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1308. [2019-12-07 13:34:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-12-07 13:34:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 3424 transitions. [2019-12-07 13:34:22,462 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 3424 transitions. Word has length 45 [2019-12-07 13:34:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:22,462 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 3424 transitions. [2019-12-07 13:34:22,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 3424 transitions. [2019-12-07 13:34:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:34:22,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:22,464 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 13:34:22,465 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 13:34:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-12-07 13:34:22,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:22,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339063521] [2019-12-07 13:34:22,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:22,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339063521] [2019-12-07 13:34:22,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:22,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:34:22,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10471307] [2019-12-07 13:34:22,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:34:22,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:34:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:34:22,543 INFO L87 Difference]: Start difference. First operand 1308 states and 3424 transitions. Second operand 4 states. [2019-12-07 13:34:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:22,558 INFO L93 Difference]: Finished difference Result 1845 states and 4579 transitions. [2019-12-07 13:34:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:34:22,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 13:34:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:22,560 INFO L225 Difference]: With dead ends: 1845 [2019-12-07 13:34:22,560 INFO L226 Difference]: Without dead ends: 1192 [2019-12-07 13:34:22,560 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 13:34:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-07 13:34:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-07 13:34:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-07 13:34:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-07 13:34:22,572 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-07 13:34:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:22,572 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-07 13:34:22,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:34:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-07 13:34:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:34:22,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:22,574 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 13:34:22,574 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 13:34:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 2 times [2019-12-07 13:34:22,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:22,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036260941] [2019-12-07 13:34:22,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:22,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036260941] [2019-12-07 13:34:22,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:22,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:34:22,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128173617] [2019-12-07 13:34:22,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:34:22,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:22,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:34:22,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:34:22,648 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-07 13:34:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:22,874 INFO L93 Difference]: Finished difference Result 3292 states and 8482 transitions. [2019-12-07 13:34:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:34:22,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 13:34:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:22,877 INFO L225 Difference]: With dead ends: 3292 [2019-12-07 13:34:22,877 INFO L226 Difference]: Without dead ends: 2736 [2019-12-07 13:34:22,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:34:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-12-07 13:34:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1608. [2019-12-07 13:34:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-12-07 13:34:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 4035 transitions. [2019-12-07 13:34:22,895 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 4035 transitions. Word has length 45 [2019-12-07 13:34:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:22,895 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 4035 transitions. [2019-12-07 13:34:22,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:34:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 4035 transitions. [2019-12-07 13:34:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:34:22,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:22,897 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 13:34:22,897 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 13:34:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash -228434578, now seen corresponding path program 3 times [2019-12-07 13:34:22,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:22,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160108495] [2019-12-07 13:34:22,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:34:22,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160108495] [2019-12-07 13:34:22,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:22,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:34:22,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269514459] [2019-12-07 13:34:22,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:34:22,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:34:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:34:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:34:22,950 INFO L87 Difference]: Start difference. First operand 1608 states and 4035 transitions. Second operand 4 states. [2019-12-07 13:34:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:22,973 INFO L93 Difference]: Finished difference Result 2137 states and 5208 transitions. [2019-12-07 13:34:22,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:34:22,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 13:34:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:22,975 INFO L225 Difference]: With dead ends: 2137 [2019-12-07 13:34:22,975 INFO L226 Difference]: Without dead ends: 1667 [2019-12-07 13:34:22,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:34:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-12-07 13:34:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1264. [2019-12-07 13:34:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2019-12-07 13:34:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 3174 transitions. [2019-12-07 13:34:22,994 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 3174 transitions. Word has length 45 [2019-12-07 13:34:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:22,994 INFO L462 AbstractCegarLoop]: Abstraction has 1264 states and 3174 transitions. [2019-12-07 13:34:22,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:34:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 3174 transitions. [2019-12-07 13:34:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:34:22,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:22,997 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 13:34:22,997 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 13:34:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 4 times [2019-12-07 13:34:22,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:34:22,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633606262] [2019-12-07 13:34:22,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:34:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:34:23,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:34:23,065 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:34:23,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2589~0.offset_22|) (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31|) |v_ULTIMATE.start_main_~#t2589~0.offset_22| 0))) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2589~0.base_31| 4)) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2589~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2589~0.base=|v_ULTIMATE.start_main_~#t2589~0.base_31|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~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_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_23|, ~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_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2589~0.offset=|v_ULTIMATE.start_main_~#t2589~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2591~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2589~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2589~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2591~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2590~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:34:23,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2590~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2590~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2590~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2590~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10|) |v_ULTIMATE.start_main_~#t2590~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2590~0.base] because there is no mapped edge [2019-12-07 13:34:23,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2591~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11|) |v_ULTIMATE.start_main_~#t2591~0.offset_10| 2))) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2591~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2591~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2591~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2591~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2591~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:34:23,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:34:23,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:34:23,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In800285029 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out800285029| |P1Thread1of1ForFork1_#t~ite8_Out800285029|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In800285029 256) 0))) (or (= (mod ~y$w_buff0_used~0_In800285029 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In800285029 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In800285029 256)) .cse1))) (= ~y$w_buff0~0_In800285029 |P1Thread1of1ForFork1_#t~ite8_Out800285029|)) (and (= ~y$w_buff0~0_In800285029 |P1Thread1of1ForFork1_#t~ite9_Out800285029|) (= |P1Thread1of1ForFork1_#t~ite8_In800285029| |P1Thread1of1ForFork1_#t~ite8_Out800285029|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, ~y$w_buff0~0=~y$w_buff0~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In800285029|, ~weak$$choice2~0=~weak$$choice2~0_In800285029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out800285029|, ~y$w_buff0~0=~y$w_buff0~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out800285029|, ~weak$$choice2~0=~weak$$choice2~0_In800285029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:34:23,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1553668176 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1553668176 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1553668176 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1553668176 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1553668176 256))))) .cse1 (= ~y$w_buff0_used~0_In1553668176 |P1Thread1of1ForFork1_#t~ite14_Out1553668176|) (= |P1Thread1of1ForFork1_#t~ite14_Out1553668176| |P1Thread1of1ForFork1_#t~ite15_Out1553668176|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In1553668176| |P1Thread1of1ForFork1_#t~ite14_Out1553668176|) (= ~y$w_buff0_used~0_In1553668176 |P1Thread1of1ForFork1_#t~ite15_Out1553668176|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1553668176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1553668176, ~weak$$choice2~0=~weak$$choice2~0_In1553668176, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1553668176|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1553668176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1553668176, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1553668176|, ~weak$$choice2~0=~weak$$choice2~0_In1553668176, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1553668176|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:34:23,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:34:23,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1482999699 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1482999699 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-1482999699| ~y$w_buff0_used~0_In-1482999699)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1482999699|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482999699, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1482999699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482999699, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1482999699, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1482999699|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:34:23,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:34:23,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1784209430 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1784209430 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1784209430 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1784209430 256)))) (or (and (= ~y$w_buff1_used~0_In-1784209430 |P2Thread1of1ForFork2_#t~ite29_Out-1784209430|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1784209430|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1784209430, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1784209430, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1784209430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1784209430} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1784209430, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1784209430, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1784209430, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1784209430|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1784209430} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2098444693 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-2098444693 ~y$r_buff0_thd3~0_Out-2098444693)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2098444693 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-2098444693)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098444693, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2098444693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098444693, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2098444693|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2098444693} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2133909964 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In2133909964 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In2133909964 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2133909964 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In2133909964 |P2Thread1of1ForFork2_#t~ite31_Out2133909964|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out2133909964|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2133909964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133909964, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133909964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133909964} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2133909964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133909964, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out2133909964|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133909964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133909964} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1409807910 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1409807910 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1409807910| ~y~0_In1409807910) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1409807910| ~y$w_buff1~0_In1409807910) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1409807910, ~y~0=~y~0_In1409807910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1409807910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409807910} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1409807910, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1409807910|, ~y~0=~y~0_In1409807910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1409807910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409807910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 13:34:23,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In745546079 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In745546079 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out745546079| ~y$w_buff0_used~0_In745546079)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out745546079| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out745546079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:34:23,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1136776121 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1136776121 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1136776121 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1136776121 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out1136776121| ~y$w_buff1_used~0_In1136776121)) (and (= |ULTIMATE.start_main_#t~ite38_Out1136776121| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1136776121, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1136776121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1136776121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1136776121, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1136776121|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1136776121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1136776121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:34:23,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In521048916 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In521048916 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out521048916| ~y$r_buff0_thd0~0_In521048916) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out521048916| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521048916} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out521048916|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521048916} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:34:23,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-421244409 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-421244409 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-421244409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-421244409 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-421244409|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out-421244409| ~y$r_buff1_thd0~0_In-421244409) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-421244409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-421244409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-421244409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-421244409} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-421244409|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-421244409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-421244409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-421244409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-421244409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:34:23,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:34:23,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:34:23 BasicIcfg [2019-12-07 13:34:23,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:34:23,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:34:23,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:34:23,121 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:34:23,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:34:14" (3/4) ... [2019-12-07 13:34:23,122 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:34:23,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t2589~0.offset_22|) (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_31|) |v_ULTIMATE.start_main_~#t2589~0.offset_22| 0))) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2589~0.base_31| 4)) (= v_~z~0_143 0) (= v_~weak$$choice2~0_148 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2589~0.base_31|) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_31| 1) |v_#valid_66|) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2589~0.base=|v_ULTIMATE.start_main_~#t2589~0.base_31|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_31|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~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_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_23|, ~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_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2589~0.offset=|v_ULTIMATE.start_main_~#t2589~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2591~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2589~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2589~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2591~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2590~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:34:23,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2590~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2590~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2590~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2590~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10|) |v_ULTIMATE.start_main_~#t2590~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2590~0.base] because there is no mapped edge [2019-12-07 13:34:23,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2591~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11|) |v_ULTIMATE.start_main_~#t2591~0.offset_10| 2))) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2591~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2591~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2591~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2591~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2591~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:34:23,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:34:23,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:34:23,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In800285029 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out800285029| |P1Thread1of1ForFork1_#t~ite8_Out800285029|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In800285029 256) 0))) (or (= (mod ~y$w_buff0_used~0_In800285029 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In800285029 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In800285029 256)) .cse1))) (= ~y$w_buff0~0_In800285029 |P1Thread1of1ForFork1_#t~ite8_Out800285029|)) (and (= ~y$w_buff0~0_In800285029 |P1Thread1of1ForFork1_#t~ite9_Out800285029|) (= |P1Thread1of1ForFork1_#t~ite8_In800285029| |P1Thread1of1ForFork1_#t~ite8_Out800285029|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, ~y$w_buff0~0=~y$w_buff0~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In800285029|, ~weak$$choice2~0=~weak$$choice2~0_In800285029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out800285029|, ~y$w_buff0~0=~y$w_buff0~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out800285029|, ~weak$$choice2~0=~weak$$choice2~0_In800285029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:34:23,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1553668176 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1553668176 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1553668176 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1553668176 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1553668176 256))))) .cse1 (= ~y$w_buff0_used~0_In1553668176 |P1Thread1of1ForFork1_#t~ite14_Out1553668176|) (= |P1Thread1of1ForFork1_#t~ite14_Out1553668176| |P1Thread1of1ForFork1_#t~ite15_Out1553668176|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In1553668176| |P1Thread1of1ForFork1_#t~ite14_Out1553668176|) (= ~y$w_buff0_used~0_In1553668176 |P1Thread1of1ForFork1_#t~ite15_Out1553668176|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1553668176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1553668176, ~weak$$choice2~0=~weak$$choice2~0_In1553668176, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1553668176|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1553668176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1553668176, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1553668176|, ~weak$$choice2~0=~weak$$choice2~0_In1553668176, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1553668176|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:34:23,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:34:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1482999699 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1482999699 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out-1482999699| ~y$w_buff0_used~0_In-1482999699)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out-1482999699|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482999699, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1482999699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482999699, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1482999699, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-1482999699|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:34:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:34:23,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1784209430 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1784209430 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1784209430 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1784209430 256)))) (or (and (= ~y$w_buff1_used~0_In-1784209430 |P2Thread1of1ForFork2_#t~ite29_Out-1784209430|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1784209430|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1784209430, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1784209430, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1784209430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1784209430} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1784209430, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1784209430, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1784209430, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1784209430|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1784209430} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2098444693 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-2098444693 ~y$r_buff0_thd3~0_Out-2098444693)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-2098444693 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-2098444693)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098444693, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2098444693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098444693, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2098444693|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2098444693} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2133909964 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In2133909964 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In2133909964 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2133909964 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In2133909964 |P2Thread1of1ForFork2_#t~ite31_Out2133909964|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out2133909964|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2133909964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133909964, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133909964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133909964} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2133909964, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133909964, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out2133909964|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2133909964, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133909964} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1409807910 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1409807910 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1409807910| ~y~0_In1409807910) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1409807910| ~y$w_buff1~0_In1409807910) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1409807910, ~y~0=~y~0_In1409807910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1409807910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409807910} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1409807910, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1409807910|, ~y~0=~y~0_In1409807910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1409807910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1409807910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 13:34:23,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In745546079 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In745546079 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out745546079| ~y$w_buff0_used~0_In745546079)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out745546079| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out745546079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:34:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1136776121 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1136776121 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1136776121 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1136776121 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out1136776121| ~y$w_buff1_used~0_In1136776121)) (and (= |ULTIMATE.start_main_#t~ite38_Out1136776121| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1136776121, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1136776121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1136776121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1136776121, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1136776121|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1136776121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1136776121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:34:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In521048916 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In521048916 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out521048916| ~y$r_buff0_thd0~0_In521048916) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out521048916| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521048916} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out521048916|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521048916} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:34:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-421244409 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-421244409 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-421244409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-421244409 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-421244409|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out-421244409| ~y$r_buff1_thd0~0_In-421244409) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-421244409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-421244409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-421244409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-421244409} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-421244409|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-421244409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-421244409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-421244409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-421244409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:34:23,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:34:23,178 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b3a032c4-3b10-4ada-afec-dfd8f2bfe677/bin/uautomizer/witness.graphml [2019-12-07 13:34:23,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:34:23,179 INFO L168 Benchmark]: Toolchain (without parser) took 9908.78 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 633.3 MB). Free memory was 943.6 MB in the beginning and 1.0 GB in the end (delta: -105.4 MB). Peak memory consumption was 527.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:34:23,180 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:34:23,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:34:23,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:34:23,180 INFO L168 Benchmark]: Boogie Preprocessor took 24.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:34:23,181 INFO L168 Benchmark]: RCFGBuilder took 395.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:34:23,181 INFO L168 Benchmark]: TraceAbstraction took 9014.19 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 540.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -64.5 MB). Peak memory consumption was 476.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:34:23,181 INFO L168 Benchmark]: Witness Printer took 58.00 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:34:23,183 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 395.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9014.19 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 540.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -64.5 MB). Peak memory consumption was 476.0 MB. Max. memory is 11.5 GB. * Witness Printer took 58.00 ms. Allocated memory is still 1.7 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L816] FCALL, FORK 0 pthread_create(&t2590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L818] FCALL, FORK 0 pthread_create(&t2591, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L791] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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=2] [L755] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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=2] [L755] 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) [L756] 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)) [L757] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, 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=2] [L757] 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)) [L758] 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)) [L759] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, 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=2] [L759] 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)) [L761] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, 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=2] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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=2] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1414 SDtfs, 1996 SDslu, 2372 SDs, 0 SdLazy, 845 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25562occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 10763 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 59172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...