./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6b44724bb841e08fac4fc20815502d3ec1e59479 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-28 18:11:57,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:57,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:57,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:57,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:57,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:57,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:57,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:57,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:57,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:57,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:57,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:57,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:57,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:57,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:57,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:57,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:57,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:57,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:57,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:57,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:57,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:57,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:57,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:57,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:57,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:57,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:57,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:57,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:57,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:57,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:57,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:57,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:57,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:57,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:57,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:57,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:57,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:57,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:57,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:57,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:57,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:11:57,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:57,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:57,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:57,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:57,693 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:57,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:57,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:57,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:57,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:57,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:57,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:57,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:57,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:57,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:57,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:57,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:57,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:57,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:57,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:57,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:57,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:57,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:57,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:57,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:57,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:57,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:57,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:57,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:57,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:57,700 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6b44724bb841e08fac4fc20815502d3ec1e59479 [2019-11-28 18:11:58,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:58,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:58,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:58,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:58,034 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:58,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i [2019-11-28 18:11:58,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bdf4250/f2e5578c912045e79cc8bf94fe77f4be/FLAGe928c847d [2019-11-28 18:11:58,706 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:58,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i [2019-11-28 18:11:58,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bdf4250/f2e5578c912045e79cc8bf94fe77f4be/FLAGe928c847d [2019-11-28 18:11:58,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5bdf4250/f2e5578c912045e79cc8bf94fe77f4be [2019-11-28 18:11:58,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:58,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:58,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:58,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:58,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:58,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:58" (1/1) ... [2019-11-28 18:11:58,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0b91f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:58, skipping insertion in model container [2019-11-28 18:11:58,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:58" (1/1) ... [2019-11-28 18:11:58,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:58,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:59,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:59,567 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:59,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:59,753 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:59,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59 WrapperNode [2019-11-28 18:11:59,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:59,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:59,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:59,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:59,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:59,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:59,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:59,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:59,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... [2019-11-28 18:11:59,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:59,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:59,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:59,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:59,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:11:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:59,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:59,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:59,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:59,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:11:59,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:11:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:59,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:59,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:59,925 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:12:00,579 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:00,580 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:00,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:00 BoogieIcfgContainer [2019-11-28 18:12:00,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:00,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:00,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:00,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:00,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:58" (1/3) ... [2019-11-28 18:12:00,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624acf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:00, skipping insertion in model container [2019-11-28 18:12:00,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:59" (2/3) ... [2019-11-28 18:12:00,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624acf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:00, skipping insertion in model container [2019-11-28 18:12:00,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:00" (3/3) ... [2019-11-28 18:12:00,592 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt.i [2019-11-28 18:12:00,602 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:00,603 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:00,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:00,612 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:00,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,654 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,654 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,689 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,690 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,690 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,690 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:00,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:12:00,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:00,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:00,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:00,745 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:00,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:00,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:00,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:00,746 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:00,763 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-11-28 18:12:00,766 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:00,857 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:00,857 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:00,874 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:00,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-11-28 18:12:00,946 INFO L134 PetriNetUnfolder]: 35/177 cut-off events. [2019-11-28 18:12:00,946 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:00,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 560 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:12:00,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:12:00,972 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:05,371 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-28 18:12:05,898 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-11-28 18:12:06,029 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-28 18:12:06,151 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-11-28 18:12:06,151 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:12:06,155 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-11-28 18:12:07,177 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-11-28 18:12:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-11-28 18:12:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:12:07,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:07,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:07,195 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-11-28 18:12:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:07,204 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-11-28 18:12:07,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:07,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220125713] [2019-11-28 18:12:07,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:07,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220125713] [2019-11-28 18:12:07,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:07,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:07,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438830998] [2019-11-28 18:12:07,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:07,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:07,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:07,593 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-11-28 18:12:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:07,928 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-11-28 18:12:07,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:07,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:12:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:08,068 INFO L225 Difference]: With dead ends: 11574 [2019-11-28 18:12:08,068 INFO L226 Difference]: Without dead ends: 10902 [2019-11-28 18:12:08,070 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-11-28 18:12:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-11-28 18:12:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-11-28 18:12:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-11-28 18:12:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-11-28 18:12:08,893 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-11-28 18:12:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:08,895 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-11-28 18:12:08,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-11-28 18:12:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:12:08,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:08,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:08,907 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-11-28 18:12:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-11-28 18:12:08,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:08,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861118767] [2019-11-28 18:12:08,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:09,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861118767] [2019-11-28 18:12:09,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:09,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:09,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957386573] [2019-11-28 18:12:09,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:09,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:09,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:09,071 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 4 states. [2019-11-28 18:12:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:09,499 INFO L93 Difference]: Finished difference Result 16442 states and 60890 transitions. [2019-11-28 18:12:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:09,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:12:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:09,597 INFO L225 Difference]: With dead ends: 16442 [2019-11-28 18:12:09,598 INFO L226 Difference]: Without dead ends: 16416 [2019-11-28 18:12:09,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2019-11-28 18:12:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 14534. [2019-11-28 18:12:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14534 states. [2019-11-28 18:12:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 54626 transitions. [2019-11-28 18:12:10,225 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 54626 transitions. Word has length 13 [2019-11-28 18:12:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:10,226 INFO L462 AbstractCegarLoop]: Abstraction has 14534 states and 54626 transitions. [2019-11-28 18:12:10,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 54626 transitions. [2019-11-28 18:12:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:10,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:10,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:10,232 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-11-28 18:12:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-11-28 18:12:10,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:10,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364512836] [2019-11-28 18:12:10,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:10,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364512836] [2019-11-28 18:12:10,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:10,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:10,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815572972] [2019-11-28 18:12:10,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:10,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:10,291 INFO L87 Difference]: Start difference. First operand 14534 states and 54626 transitions. Second operand 3 states. [2019-11-28 18:12:10,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:10,474 INFO L93 Difference]: Finished difference Result 19566 states and 73114 transitions. [2019-11-28 18:12:10,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:10,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:10,574 INFO L225 Difference]: With dead ends: 19566 [2019-11-28 18:12:10,575 INFO L226 Difference]: Without dead ends: 19566 [2019-11-28 18:12:10,575 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-11-28 18:12:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19566 states. [2019-11-28 18:12:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19566 to 17774. [2019-11-28 18:12:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17774 states. [2019-11-28 18:12:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17774 states to 17774 states and 66874 transitions. [2019-11-28 18:12:11,482 INFO L78 Accepts]: Start accepts. Automaton has 17774 states and 66874 transitions. Word has length 16 [2019-11-28 18:12:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:11,482 INFO L462 AbstractCegarLoop]: Abstraction has 17774 states and 66874 transitions. [2019-11-28 18:12:11,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 17774 states and 66874 transitions. [2019-11-28 18:12:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:11,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:11,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:11,488 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-11-28 18:12:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-11-28 18:12:11,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:11,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750912849] [2019-11-28 18:12:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:11,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750912849] [2019-11-28 18:12:11,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:11,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390679941] [2019-11-28 18:12:11,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:11,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:11,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:11,578 INFO L87 Difference]: Start difference. First operand 17774 states and 66874 transitions. Second operand 5 states. [2019-11-28 18:12:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:11,987 INFO L93 Difference]: Finished difference Result 25142 states and 92536 transitions. [2019-11-28 18:12:11,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:11,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:12:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:12,114 INFO L225 Difference]: With dead ends: 25142 [2019-11-28 18:12:12,114 INFO L226 Difference]: Without dead ends: 25100 [2019-11-28 18:12:12,115 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-11-28 18:12:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25100 states. [2019-11-28 18:12:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25100 to 19982. [2019-11-28 18:12:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19982 states. [2019-11-28 18:12:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19982 states to 19982 states and 74788 transitions. [2019-11-28 18:12:12,786 INFO L78 Accepts]: Start accepts. Automaton has 19982 states and 74788 transitions. Word has length 16 [2019-11-28 18:12:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:12,787 INFO L462 AbstractCegarLoop]: Abstraction has 19982 states and 74788 transitions. [2019-11-28 18:12:12,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19982 states and 74788 transitions. [2019-11-28 18:12:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:12,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:12,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:12,798 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-11-28 18:12:12,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1098036901, now seen corresponding path program 1 times [2019-11-28 18:12:12,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:12,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179049111] [2019-11-28 18:12:12,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:12,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179049111] [2019-11-28 18:12:12,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:12,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:12,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882995877] [2019-11-28 18:12:12,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:12,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:12,907 INFO L87 Difference]: Start difference. First operand 19982 states and 74788 transitions. Second operand 3 states. [2019-11-28 18:12:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:13,469 INFO L93 Difference]: Finished difference Result 18938 states and 69918 transitions. [2019-11-28 18:12:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:13,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:13,534 INFO L225 Difference]: With dead ends: 18938 [2019-11-28 18:12:13,535 INFO L226 Difference]: Without dead ends: 18938 [2019-11-28 18:12:13,535 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-11-28 18:12:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18938 states. [2019-11-28 18:12:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18938 to 18578. [2019-11-28 18:12:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18578 states. [2019-11-28 18:12:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18578 states to 18578 states and 68654 transitions. [2019-11-28 18:12:14,148 INFO L78 Accepts]: Start accepts. Automaton has 18578 states and 68654 transitions. Word has length 18 [2019-11-28 18:12:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:14,149 INFO L462 AbstractCegarLoop]: Abstraction has 18578 states and 68654 transitions. [2019-11-28 18:12:14,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18578 states and 68654 transitions. [2019-11-28 18:12:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:14,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:14,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:14,158 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-11-28 18:12:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:14,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1956522172, now seen corresponding path program 1 times [2019-11-28 18:12:14,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:14,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420773929] [2019-11-28 18:12:14,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:14,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420773929] [2019-11-28 18:12:14,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:14,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:14,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604078462] [2019-11-28 18:12:14,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:14,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:14,263 INFO L87 Difference]: Start difference. First operand 18578 states and 68654 transitions. Second operand 3 states. [2019-11-28 18:12:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:14,465 INFO L93 Difference]: Finished difference Result 27866 states and 97552 transitions. [2019-11-28 18:12:14,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:14,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:14,556 INFO L225 Difference]: With dead ends: 27866 [2019-11-28 18:12:14,556 INFO L226 Difference]: Without dead ends: 27282 [2019-11-28 18:12:14,557 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-11-28 18:12:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27282 states. [2019-11-28 18:12:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27282 to 26418. [2019-11-28 18:12:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26418 states. [2019-11-28 18:12:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26418 states to 26418 states and 93321 transitions. [2019-11-28 18:12:15,849 INFO L78 Accepts]: Start accepts. Automaton has 26418 states and 93321 transitions. Word has length 18 [2019-11-28 18:12:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:15,850 INFO L462 AbstractCegarLoop]: Abstraction has 26418 states and 93321 transitions. [2019-11-28 18:12:15,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 26418 states and 93321 transitions. [2019-11-28 18:12:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:12:15,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:15,863 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-11-28 18:12:15,863 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-11-28 18:12:15,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:15,863 INFO L82 PathProgramCache]: Analyzing trace with hash -517469277, now seen corresponding path program 1 times [2019-11-28 18:12:15,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:15,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705020065] [2019-11-28 18:12:15,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:15,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705020065] [2019-11-28 18:12:15,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:15,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:15,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402668254] [2019-11-28 18:12:15,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:15,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:15,911 INFO L87 Difference]: Start difference. First operand 26418 states and 93321 transitions. Second operand 3 states. [2019-11-28 18:12:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,002 INFO L93 Difference]: Finished difference Result 17125 states and 55138 transitions. [2019-11-28 18:12:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:16,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:12:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,044 INFO L225 Difference]: With dead ends: 17125 [2019-11-28 18:12:16,045 INFO L226 Difference]: Without dead ends: 17125 [2019-11-28 18:12:16,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17125 states. [2019-11-28 18:12:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17125 to 17125. [2019-11-28 18:12:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17125 states. [2019-11-28 18:12:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 55138 transitions. [2019-11-28 18:12:16,394 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 55138 transitions. Word has length 19 [2019-11-28 18:12:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,395 INFO L462 AbstractCegarLoop]: Abstraction has 17125 states and 55138 transitions. [2019-11-28 18:12:16,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 55138 transitions. [2019-11-28 18:12:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:12:16,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:16,403 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-11-28 18:12:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1928635085, now seen corresponding path program 1 times [2019-11-28 18:12:16,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073420654] [2019-11-28 18:12:16,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:16,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073420654] [2019-11-28 18:12:16,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:16,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:16,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603056334] [2019-11-28 18:12:16,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:16,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:16,458 INFO L87 Difference]: Start difference. First operand 17125 states and 55138 transitions. Second operand 4 states. [2019-11-28 18:12:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,489 INFO L93 Difference]: Finished difference Result 3119 states and 7927 transitions. [2019-11-28 18:12:16,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:16,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 18:12:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,494 INFO L225 Difference]: With dead ends: 3119 [2019-11-28 18:12:16,494 INFO L226 Difference]: Without dead ends: 3119 [2019-11-28 18:12:16,495 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-11-28 18:12:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2019-11-28 18:12:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3005. [2019-11-28 18:12:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-11-28 18:12:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7668 transitions. [2019-11-28 18:12:16,534 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7668 transitions. Word has length 20 [2019-11-28 18:12:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,535 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 7668 transitions. [2019-11-28 18:12:16,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7668 transitions. [2019-11-28 18:12:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:12:16,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,540 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-11-28 18:12:16,540 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-11-28 18:12:16,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-11-28 18:12:16,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716497419] [2019-11-28 18:12:16,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:16,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716497419] [2019-11-28 18:12:16,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:16,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:16,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209748553] [2019-11-28 18:12:16,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:16,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:16,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:16,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:16,593 INFO L87 Difference]: Start difference. First operand 3005 states and 7668 transitions. Second operand 5 states. [2019-11-28 18:12:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,626 INFO L93 Difference]: Finished difference Result 1691 states and 4469 transitions. [2019-11-28 18:12:16,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:16,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 18:12:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,630 INFO L225 Difference]: With dead ends: 1691 [2019-11-28 18:12:16,630 INFO L226 Difference]: Without dead ends: 1643 [2019-11-28 18:12:16,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2019-11-28 18:12:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1200. [2019-11-28 18:12:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2019-11-28 18:12:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3295 transitions. [2019-11-28 18:12:16,653 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3295 transitions. Word has length 29 [2019-11-28 18:12:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,654 INFO L462 AbstractCegarLoop]: Abstraction has 1200 states and 3295 transitions. [2019-11-28 18:12:16,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3295 transitions. [2019-11-28 18:12:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:16,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,658 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-11-28 18:12:16,658 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-11-28 18:12:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 91748315, now seen corresponding path program 1 times [2019-11-28 18:12:16,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051479673] [2019-11-28 18:12:16,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:16,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051479673] [2019-11-28 18:12:16,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:16,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:16,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782321820] [2019-11-28 18:12:16,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:16,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:16,764 INFO L87 Difference]: Start difference. First operand 1200 states and 3295 transitions. Second operand 4 states. [2019-11-28 18:12:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,787 INFO L93 Difference]: Finished difference Result 1693 states and 4430 transitions. [2019-11-28 18:12:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:16,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:12:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,790 INFO L225 Difference]: With dead ends: 1693 [2019-11-28 18:12:16,790 INFO L226 Difference]: Without dead ends: 1040 [2019-11-28 18:12:16,790 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-11-28 18:12:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-11-28 18:12:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2019-11-28 18:12:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-28 18:12:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2804 transitions. [2019-11-28 18:12:16,807 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2804 transitions. Word has length 45 [2019-11-28 18:12:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,808 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 2804 transitions. [2019-11-28 18:12:16,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2804 transitions. [2019-11-28 18:12:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:16,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,811 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-11-28 18:12:16,811 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-11-28 18:12:16,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1010142777, now seen corresponding path program 2 times [2019-11-28 18:12:16,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557954817] [2019-11-28 18:12:16,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:16,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557954817] [2019-11-28 18:12:16,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:16,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:16,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139116467] [2019-11-28 18:12:16,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:16,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:16,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:16,922 INFO L87 Difference]: Start difference. First operand 1040 states and 2804 transitions. Second operand 3 states. [2019-11-28 18:12:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:16,934 INFO L93 Difference]: Finished difference Result 1425 states and 3706 transitions. [2019-11-28 18:12:16,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:16,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:12:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:16,936 INFO L225 Difference]: With dead ends: 1425 [2019-11-28 18:12:16,936 INFO L226 Difference]: Without dead ends: 417 [2019-11-28 18:12:16,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-11-28 18:12:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-11-28 18:12:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-28 18:12:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 957 transitions. [2019-11-28 18:12:16,943 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 957 transitions. Word has length 45 [2019-11-28 18:12:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:16,943 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 957 transitions. [2019-11-28 18:12:16,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 957 transitions. [2019-11-28 18:12:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:12:16,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:16,946 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-11-28 18:12:16,946 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-11-28 18:12:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 3 times [2019-11-28 18:12:16,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:16,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541991311] [2019-11-28 18:12:16,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:17,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:17,141 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:17,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_26|) |v_ULTIMATE.start_main_~#t882~0.offset_19| 0)) |v_#memory_int_21|) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t882~0.base_26|)) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t882~0.base_26| 1)) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t882~0.offset_19|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t882~0.base_26| 4)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t882~0.base_26|) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ULTIMATE.start_main_~#t882~0.base=|v_ULTIMATE.start_main_~#t882~0.base_26|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_16|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t882~0.offset=|v_ULTIMATE.start_main_~#t882~0.offset_19|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t882~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t883~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t884~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t884~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t883~0.offset, #NULL.base, ULTIMATE.start_main_~#t882~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:17,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t883~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t883~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t883~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11|) |v_ULTIMATE.start_main_~#t883~0.offset_10| 1)) |v_#memory_int_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11| 1) |v_#valid_39|) (not (= 0 |v_ULTIMATE.start_main_~#t883~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t883~0.base, #length, ULTIMATE.start_main_~#t883~0.offset] because there is no mapped edge [2019-11-28 18:12:17,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t884~0.base_13|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t884~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13|) |v_ULTIMATE.start_main_~#t884~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t884~0.offset_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t884~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t884~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t884~0.offset, #length] because there is no mapped edge [2019-11-28 18:12:17,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:17,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:17,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1573966423 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1573966423| |P1Thread1of1ForFork1_#t~ite14_Out-1573966423|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1573966423 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1573966423 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1573966423 256)) (and (= (mod ~z$r_buff1_thd2~0_In-1573966423 256) 0) .cse0))) (= ~z$w_buff0_used~0_In-1573966423 |P1Thread1of1ForFork1_#t~ite14_Out-1573966423|) .cse1) (and (not .cse1) (= ~z$w_buff0_used~0_In-1573966423 |P1Thread1of1ForFork1_#t~ite15_Out-1573966423|) (= |P1Thread1of1ForFork1_#t~ite14_In-1573966423| |P1Thread1of1ForFork1_#t~ite14_Out-1573966423|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573966423, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573966423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573966423, ~weak$$choice2~0=~weak$$choice2~0_In-1573966423, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573966423, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1573966423|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573966423, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573966423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573966423, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1573966423|, ~weak$$choice2~0=~weak$$choice2~0_In-1573966423, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1573966423|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573966423} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:17,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:17,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:17,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In695683056 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In695683056 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out695683056| ~z$w_buff0_used~0_In695683056)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out695683056| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out695683056|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:17,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1993494908 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1993494908 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1993494908 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1993494908 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1993494908| 0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1993494908| ~z$w_buff1_used~0_In-1993494908) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993494908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1993494908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1993494908} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993494908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1993494908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1993494908, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1993494908|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:17,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1065128433 256) 0)) (.cse0 (= ~z$r_buff0_thd3~0_In1065128433 ~z$r_buff0_thd3~0_Out1065128433)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1065128433 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out1065128433)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1065128433} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1065128433|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1065128433} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:17,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1530224339 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1530224339 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1530224339 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1530224339 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out-1530224339| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out-1530224339| ~z$r_buff1_thd3~0_In-1530224339) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530224339, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1530224339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530224339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1530224339} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1530224339|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530224339, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1530224339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530224339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1530224339} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:17,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:17,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:17,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In344317822 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In344317822 256) 0))) (or (and (= ~z$w_buff1~0_In344317822 |ULTIMATE.start_main_#t~ite35_Out344317822|) (not .cse0) (not .cse1)) (and (= ~z~0_In344317822 |ULTIMATE.start_main_#t~ite35_Out344317822|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In344317822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344317822, ~z$w_buff1~0=~z$w_buff1~0_In344317822, ~z~0=~z~0_In344317822} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In344317822, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out344317822|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344317822, ~z$w_buff1~0=~z$w_buff1~0_In344317822, ~z~0=~z~0_In344317822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:17,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:17,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1691475274 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1691475274 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1691475274|)) (and (= ~z$w_buff0_used~0_In-1691475274 |ULTIMATE.start_main_#t~ite37_Out-1691475274|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1691475274, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1691475274} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1691475274, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1691475274, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1691475274|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:17,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1028743295 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1028743295 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1028743295 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1028743295 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1028743295 |ULTIMATE.start_main_#t~ite38_Out1028743295|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1028743295|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1028743295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1028743295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028743295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1028743295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1028743295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028743295, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1028743295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:17,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In989297146 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In989297146 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out989297146|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In989297146 |ULTIMATE.start_main_#t~ite39_Out989297146|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989297146, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989297146} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989297146, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out989297146|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989297146} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:17,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In9992610 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In9992610 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In9992610 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In9992610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out9992610| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In9992610 |ULTIMATE.start_main_#t~ite40_Out9992610|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In9992610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In9992610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out9992610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In9992610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In9992610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:17,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:17,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:17 BasicIcfg [2019-11-28 18:12:17,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:17,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:17,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:17,303 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:17,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:00" (3/4) ... [2019-11-28 18:12:17,308 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:17,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_26|) |v_ULTIMATE.start_main_~#t882~0.offset_19| 0)) |v_#memory_int_21|) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t882~0.base_26|)) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t882~0.base_26| 1)) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t882~0.offset_19|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t882~0.base_26| 4)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t882~0.base_26|) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ULTIMATE.start_main_~#t882~0.base=|v_ULTIMATE.start_main_~#t882~0.base_26|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_16|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t882~0.offset=|v_ULTIMATE.start_main_~#t882~0.offset_19|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t882~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t883~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t884~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t884~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t883~0.offset, #NULL.base, ULTIMATE.start_main_~#t882~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:17,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t883~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t883~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t883~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11|) |v_ULTIMATE.start_main_~#t883~0.offset_10| 1)) |v_#memory_int_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11| 1) |v_#valid_39|) (not (= 0 |v_ULTIMATE.start_main_~#t883~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t883~0.base, #length, ULTIMATE.start_main_~#t883~0.offset] because there is no mapped edge [2019-11-28 18:12:17,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t884~0.base_13|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t884~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13|) |v_ULTIMATE.start_main_~#t884~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t884~0.offset_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t884~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t884~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t884~0.offset, #length] because there is no mapped edge [2019-11-28 18:12:17,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_22, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-11-28 18:12:17,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x~0_18 1) (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:17,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1573966423 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1573966423| |P1Thread1of1ForFork1_#t~ite14_Out-1573966423|) (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1573966423 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1573966423 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1573966423 256)) (and (= (mod ~z$r_buff1_thd2~0_In-1573966423 256) 0) .cse0))) (= ~z$w_buff0_used~0_In-1573966423 |P1Thread1of1ForFork1_#t~ite14_Out-1573966423|) .cse1) (and (not .cse1) (= ~z$w_buff0_used~0_In-1573966423 |P1Thread1of1ForFork1_#t~ite15_Out-1573966423|) (= |P1Thread1of1ForFork1_#t~ite14_In-1573966423| |P1Thread1of1ForFork1_#t~ite14_Out-1573966423|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573966423, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573966423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573966423, ~weak$$choice2~0=~weak$$choice2~0_In-1573966423, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573966423, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1573966423|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573966423, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573966423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573966423, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1573966423|, ~weak$$choice2~0=~weak$$choice2~0_In-1573966423, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1573966423|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573966423} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:12:17,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_8|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_5|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:17,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:12:17,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In695683056 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In695683056 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out695683056| ~z$w_buff0_used~0_In695683056)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out695683056| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In695683056, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In695683056, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out695683056|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:12:17,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1993494908 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1993494908 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1993494908 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1993494908 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1993494908| 0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1993494908| ~z$w_buff1_used~0_In-1993494908) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993494908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1993494908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1993494908} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993494908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1993494908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1993494908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1993494908, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1993494908|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:12:17,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1065128433 256) 0)) (.cse0 (= ~z$r_buff0_thd3~0_In1065128433 ~z$r_buff0_thd3~0_Out1065128433)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1065128433 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out1065128433)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1065128433} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1065128433|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1065128433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1065128433} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:12:17,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1530224339 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1530224339 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1530224339 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1530224339 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out-1530224339| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out-1530224339| ~z$r_buff1_thd3~0_In-1530224339) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530224339, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1530224339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530224339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1530224339} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1530224339|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1530224339, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1530224339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1530224339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1530224339} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:12:17,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~z$r_buff1_thd3~0_49)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:12:17,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:17,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In344317822 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In344317822 256) 0))) (or (and (= ~z$w_buff1~0_In344317822 |ULTIMATE.start_main_#t~ite35_Out344317822|) (not .cse0) (not .cse1)) (and (= ~z~0_In344317822 |ULTIMATE.start_main_#t~ite35_Out344317822|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In344317822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344317822, ~z$w_buff1~0=~z$w_buff1~0_In344317822, ~z~0=~z~0_In344317822} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In344317822, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out344317822|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In344317822, ~z$w_buff1~0=~z$w_buff1~0_In344317822, ~z~0=~z~0_In344317822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:12:17,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-11-28 18:12:17,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1691475274 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1691475274 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1691475274|)) (and (= ~z$w_buff0_used~0_In-1691475274 |ULTIMATE.start_main_#t~ite37_Out-1691475274|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1691475274, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1691475274} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1691475274, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1691475274, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1691475274|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:17,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1028743295 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1028743295 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1028743295 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1028743295 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1028743295 |ULTIMATE.start_main_#t~ite38_Out1028743295|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1028743295|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1028743295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1028743295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028743295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1028743295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028743295, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1028743295, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028743295, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1028743295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:17,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In989297146 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In989297146 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out989297146|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In989297146 |ULTIMATE.start_main_#t~ite39_Out989297146|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989297146, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989297146} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989297146, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out989297146|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989297146} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:17,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In9992610 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In9992610 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In9992610 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In9992610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out9992610| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In9992610 |ULTIMATE.start_main_#t~ite40_Out9992610|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In9992610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In9992610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In9992610, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out9992610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In9992610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In9992610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In9992610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:17,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_~__unbuffered_p1_EBX~0_41 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:17,465 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:17,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:17,470 INFO L168 Benchmark]: Toolchain (without parser) took 18551.52 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 990.9 MB). Free memory was 960.4 MB in the beginning and 940.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-28 18:12:17,471 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:17,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:17,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:17,476 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:17,476 INFO L168 Benchmark]: RCFGBuilder took 725.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:17,476 INFO L168 Benchmark]: TraceAbstraction took 16718.38 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 869.8 MB). Free memory was 1.0 GB in the beginning and 960.5 MB in the end (delta: 75.6 MB). Peak memory consumption was 945.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:17,477 INFO L168 Benchmark]: Witness Printer took 167.20 ms. Allocated memory is still 2.0 GB. Free memory was 960.5 MB in the beginning and 940.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:17,480 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.93 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 725.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16718.38 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 869.8 MB). Free memory was 1.0 GB in the beginning and 960.5 MB in the end (delta: 75.6 MB). Peak memory consumption was 945.4 MB. Max. memory is 11.5 GB. * Witness Printer took 167.20 ms. Allocated memory is still 2.0 GB. Free memory was 960.5 MB in the beginning and 940.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1062 SDtfs, 920 SDslu, 1071 SDs, 0 SdLazy, 374 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26418occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 10573 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 25691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...