./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c1f4b5c4 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/rfi003_tso.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 9376b435c3a080947be73b080a08fbb0ea62b520 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-c1f4b5c [2019-12-08 15:58:08,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 15:58:08,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 15:58:08,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 15:58:08,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 15:58:08,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 15:58:08,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 15:58:08,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 15:58:08,212 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 15:58:08,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 15:58:08,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 15:58:08,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 15:58:08,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 15:58:08,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 15:58:08,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 15:58:08,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 15:58:08,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 15:58:08,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 15:58:08,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 15:58:08,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 15:58:08,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 15:58:08,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 15:58:08,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 15:58:08,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 15:58:08,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 15:58:08,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 15:58:08,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 15:58:08,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 15:58:08,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 15:58:08,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 15:58:08,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 15:58:08,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 15:58:08,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 15:58:08,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 15:58:08,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 15:58:08,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 15:58:08,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 15:58:08,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 15:58:08,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 15:58:08,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 15:58:08,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 15:58:08,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-08 15:58:08,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 15:58:08,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 15:58:08,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 15:58:08,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 15:58:08,300 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 15:58:08,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 15:58:08,301 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 15:58:08,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 15:58:08,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 15:58:08,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 15:58:08,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-08 15:58:08,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 15:58:08,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-08 15:58:08,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 15:58:08,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-08 15:58:08,303 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 15:58:08,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-08 15:58:08,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 15:58:08,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 15:58:08,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 15:58:08,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 15:58:08,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 15:58:08,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 15:58:08,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 15:58:08,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-08 15:58:08,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 15:58:08,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 15:58:08,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-08 15:58:08,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 15:58:08,309 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 -> 9376b435c3a080947be73b080a08fbb0ea62b520 [2019-12-08 15:58:08,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 15:58:08,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 15:58:08,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 15:58:08,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 15:58:08,635 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 15:58:08,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_tso.opt.i [2019-12-08 15:58:08,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44655a05/c7eba99ebb754ed592960546d4653c4d/FLAG3891ef3b2 [2019-12-08 15:58:09,230 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 15:58:09,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_tso.opt.i [2019-12-08 15:58:09,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44655a05/c7eba99ebb754ed592960546d4653c4d/FLAG3891ef3b2 [2019-12-08 15:58:09,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e44655a05/c7eba99ebb754ed592960546d4653c4d [2019-12-08 15:58:09,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 15:58:09,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-08 15:58:09,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 15:58:09,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 15:58:09,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 15:58:09,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:58:09" (1/1) ... [2019-12-08 15:58:09,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8518985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:09, skipping insertion in model container [2019-12-08 15:58:09,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:58:09" (1/1) ... [2019-12-08 15:58:09,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 15:58:09,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 15:58:10,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 15:58:10,267 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 15:58:10,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 15:58:10,472 INFO L208 MainTranslator]: Completed translation [2019-12-08 15:58:10,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10 WrapperNode [2019-12-08 15:58:10,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 15:58:10,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-08 15:58:10,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-08 15:58:10,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-08 15:58:10,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-08 15:58:10,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 15:58:10,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 15:58:10,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 15:58:10,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (1/1) ... [2019-12-08 15:58:10,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 15:58:10,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 15:58:10,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 15:58:10,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 15:58:10,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (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-12-08 15:58:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-08 15:58:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-08 15:58:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-08 15:58:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 15:58:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-08 15:58:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-08 15:58:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-08 15:58:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-08 15:58:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-08 15:58:10,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 15:58:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 15:58:10,765 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-08 15:58:11,774 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 15:58:11,774 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-08 15:58:11,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:58:11 BoogieIcfgContainer [2019-12-08 15:58:11,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 15:58:11,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 15:58:11,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 15:58:11,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 15:58:11,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:58:09" (1/3) ... [2019-12-08 15:58:11,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2011a0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:58:11, skipping insertion in model container [2019-12-08 15:58:11,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:58:10" (2/3) ... [2019-12-08 15:58:11,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2011a0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:58:11, skipping insertion in model container [2019-12-08 15:58:11,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:58:11" (3/3) ... [2019-12-08 15:58:11,786 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2019-12-08 15:58:11,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-08 15:58:11,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 15:58:11,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-08 15:58:11,816 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-08 15:58:11,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,897 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,897 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:11,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-08 15:58:12,010 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-08 15:58:12,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 15:58:12,034 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-08 15:58:12,034 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 15:58:12,034 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 15:58:12,034 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 15:58:12,034 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 15:58:12,034 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 15:58:12,035 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 15:58:12,060 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-08 15:58:12,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-08 15:58:12,211 INFO L130 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-08 15:58:12,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-08 15:58:12,264 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1350 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-08 15:58:12,358 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-08 15:58:12,450 INFO L130 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-08 15:58:12,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-08 15:58:12,474 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1350 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-08 15:58:12,524 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-08 15:58:12,525 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-08 15:58:19,077 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-08 15:58:19,196 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-08 15:58:19,370 INFO L206 etLargeBlockEncoding]: Checked pairs total: 282427 [2019-12-08 15:58:19,371 INFO L214 etLargeBlockEncoding]: Total number of compositions: 142 [2019-12-08 15:58:19,374 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 192 transitions [2019-12-08 15:58:30,257 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86906 states. [2019-12-08 15:58:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 86906 states. [2019-12-08 15:58:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-08 15:58:30,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:30,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-08 15:58:30,272 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240646, now seen corresponding path program 1 times [2019-12-08 15:58:30,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:30,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633957235] [2019-12-08 15:58:30,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:58:30,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633957235] [2019-12-08 15:58:30,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:30,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-08 15:58:30,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103600630] [2019-12-08 15:58:30,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 15:58:30,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 15:58:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:58:30,550 INFO L87 Difference]: Start difference. First operand 86906 states. Second operand 3 states. [2019-12-08 15:58:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:31,896 INFO L93 Difference]: Finished difference Result 86858 states and 312643 transitions. [2019-12-08 15:58:31,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 15:58:31,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-08 15:58:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:32,607 INFO L225 Difference]: With dead ends: 86858 [2019-12-08 15:58:32,608 INFO L226 Difference]: Without dead ends: 85058 [2019-12-08 15:58:32,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:58:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85058 states. [2019-12-08 15:58:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85058 to 85058. [2019-12-08 15:58:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85058 states. [2019-12-08 15:58:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85058 states to 85058 states and 306544 transitions. [2019-12-08 15:58:38,778 INFO L78 Accepts]: Start accepts. Automaton has 85058 states and 306544 transitions. Word has length 5 [2019-12-08 15:58:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:38,778 INFO L462 AbstractCegarLoop]: Abstraction has 85058 states and 306544 transitions. [2019-12-08 15:58:38,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 15:58:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 85058 states and 306544 transitions. [2019-12-08 15:58:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-08 15:58:38,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:38,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:38,781 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2045261550, now seen corresponding path program 1 times [2019-12-08 15:58:38,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:38,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301418925] [2019-12-08 15:58:38,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:58:38,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301418925] [2019-12-08 15:58:38,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:38,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-08 15:58:38,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028431235] [2019-12-08 15:58:38,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 15:58:38,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:38,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 15:58:38,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:58:38,909 INFO L87 Difference]: Start difference. First operand 85058 states and 306544 transitions. Second operand 4 states. [2019-12-08 15:58:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:39,909 INFO L93 Difference]: Finished difference Result 127330 states and 444666 transitions. [2019-12-08 15:58:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 15:58:39,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-08 15:58:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:40,486 INFO L225 Difference]: With dead ends: 127330 [2019-12-08 15:58:40,486 INFO L226 Difference]: Without dead ends: 127330 [2019-12-08 15:58:40,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:58:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127330 states. [2019-12-08 15:58:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127330 to 126190. [2019-12-08 15:58:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126190 states. [2019-12-08 15:58:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126190 states to 126190 states and 441366 transitions. [2019-12-08 15:58:51,419 INFO L78 Accepts]: Start accepts. Automaton has 126190 states and 441366 transitions. Word has length 11 [2019-12-08 15:58:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:58:51,419 INFO L462 AbstractCegarLoop]: Abstraction has 126190 states and 441366 transitions. [2019-12-08 15:58:51,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 15:58:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 126190 states and 441366 transitions. [2019-12-08 15:58:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-08 15:58:51,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:58:51,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:58:51,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:58:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:58:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 216920818, now seen corresponding path program 1 times [2019-12-08 15:58:51,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:58:51,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013215241] [2019-12-08 15:58:51,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:58:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:58:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:58:51,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013215241] [2019-12-08 15:58:51,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:58:51,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-08 15:58:51,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445144638] [2019-12-08 15:58:51,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 15:58:51,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:58:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 15:58:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:58:51,498 INFO L87 Difference]: Start difference. First operand 126190 states and 441366 transitions. Second operand 4 states. [2019-12-08 15:58:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:58:53,658 INFO L93 Difference]: Finished difference Result 160605 states and 554475 transitions. [2019-12-08 15:58:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-08 15:58:53,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-08 15:58:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:58:54,013 INFO L225 Difference]: With dead ends: 160605 [2019-12-08 15:58:54,014 INFO L226 Difference]: Without dead ends: 160605 [2019-12-08 15:58:54,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:58:57,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160605 states. [2019-12-08 15:59:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160605 to 146194. [2019-12-08 15:59:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146194 states. [2019-12-08 15:59:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146194 states to 146194 states and 506713 transitions. [2019-12-08 15:59:00,627 INFO L78 Accepts]: Start accepts. Automaton has 146194 states and 506713 transitions. Word has length 11 [2019-12-08 15:59:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:00,627 INFO L462 AbstractCegarLoop]: Abstraction has 146194 states and 506713 transitions. [2019-12-08 15:59:00,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 15:59:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 146194 states and 506713 transitions. [2019-12-08 15:59:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-08 15:59:00,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:00,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:00,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash -27958944, now seen corresponding path program 1 times [2019-12-08 15:59:00,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:00,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891747933] [2019-12-08 15:59:00,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:00,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891747933] [2019-12-08 15:59:00,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:00,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 15:59:00,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411831467] [2019-12-08 15:59:00,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:59:00,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:59:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:59:00,780 INFO L87 Difference]: Start difference. First operand 146194 states and 506713 transitions. Second operand 5 states. [2019-12-08 15:59:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:07,076 INFO L93 Difference]: Finished difference Result 194428 states and 664127 transitions. [2019-12-08 15:59:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 15:59:07,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-08 15:59:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:07,540 INFO L225 Difference]: With dead ends: 194428 [2019-12-08 15:59:07,541 INFO L226 Difference]: Without dead ends: 194428 [2019-12-08 15:59:07,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-08 15:59:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194428 states. [2019-12-08 15:59:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194428 to 145942. [2019-12-08 15:59:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145942 states. [2019-12-08 15:59:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145942 states to 145942 states and 505733 transitions. [2019-12-08 15:59:14,196 INFO L78 Accepts]: Start accepts. Automaton has 145942 states and 505733 transitions. Word has length 17 [2019-12-08 15:59:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:14,196 INFO L462 AbstractCegarLoop]: Abstraction has 145942 states and 505733 transitions. [2019-12-08 15:59:14,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:59:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 145942 states and 505733 transitions. [2019-12-08 15:59:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-08 15:59:14,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:14,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:14,210 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash -468341505, now seen corresponding path program 1 times [2019-12-08 15:59:14,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:14,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124479415] [2019-12-08 15:59:14,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:14,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124479415] [2019-12-08 15:59:14,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:14,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 15:59:14,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8366987] [2019-12-08 15:59:14,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 15:59:14,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:14,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 15:59:14,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:59:14,431 INFO L87 Difference]: Start difference. First operand 145942 states and 505733 transitions. Second operand 7 states. [2019-12-08 15:59:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:16,616 INFO L93 Difference]: Finished difference Result 212693 states and 721981 transitions. [2019-12-08 15:59:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 15:59:16,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-08 15:59:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:17,102 INFO L225 Difference]: With dead ends: 212693 [2019-12-08 15:59:17,102 INFO L226 Difference]: Without dead ends: 212675 [2019-12-08 15:59:17,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-08 15:59:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212675 states. [2019-12-08 15:59:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212675 to 198947. [2019-12-08 15:59:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198947 states. [2019-12-08 15:59:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198947 states to 198947 states and 679454 transitions. [2019-12-08 15:59:27,143 INFO L78 Accepts]: Start accepts. Automaton has 198947 states and 679454 transitions. Word has length 22 [2019-12-08 15:59:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:27,144 INFO L462 AbstractCegarLoop]: Abstraction has 198947 states and 679454 transitions. [2019-12-08 15:59:27,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 15:59:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 198947 states and 679454 transitions. [2019-12-08 15:59:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-08 15:59:27,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:27,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:27,169 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:27,169 INFO L82 PathProgramCache]: Analyzing trace with hash 724579748, now seen corresponding path program 1 times [2019-12-08 15:59:27,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:27,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398497313] [2019-12-08 15:59:27,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:27,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398497313] [2019-12-08 15:59:27,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:27,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-08 15:59:27,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382348837] [2019-12-08 15:59:27,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 15:59:27,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 15:59:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:27,230 INFO L87 Difference]: Start difference. First operand 198947 states and 679454 transitions. Second operand 3 states. [2019-12-08 15:59:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:27,267 INFO L93 Difference]: Finished difference Result 9112 states and 21748 transitions. [2019-12-08 15:59:27,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 15:59:27,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-08 15:59:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:27,280 INFO L225 Difference]: With dead ends: 9112 [2019-12-08 15:59:27,280 INFO L226 Difference]: Without dead ends: 9112 [2019-12-08 15:59:27,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9112 states. [2019-12-08 15:59:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9112 to 9102. [2019-12-08 15:59:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9102 states. [2019-12-08 15:59:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9102 states to 9102 states and 21728 transitions. [2019-12-08 15:59:27,387 INFO L78 Accepts]: Start accepts. Automaton has 9102 states and 21728 transitions. Word has length 25 [2019-12-08 15:59:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:27,387 INFO L462 AbstractCegarLoop]: Abstraction has 9102 states and 21728 transitions. [2019-12-08 15:59:27,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 15:59:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 9102 states and 21728 transitions. [2019-12-08 15:59:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-08 15:59:27,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:27,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:27,390 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1753070628, now seen corresponding path program 1 times [2019-12-08 15:59:27,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:27,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805356221] [2019-12-08 15:59:27,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805356221] [2019-12-08 15:59:27,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:27,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 15:59:27,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650638281] [2019-12-08 15:59:27,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 15:59:27,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:27,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 15:59:27,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-08 15:59:27,610 INFO L87 Difference]: Start difference. First operand 9102 states and 21728 transitions. Second operand 8 states. [2019-12-08 15:59:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:29,121 INFO L93 Difference]: Finished difference Result 10813 states and 25588 transitions. [2019-12-08 15:59:29,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 15:59:29,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-08 15:59:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:29,134 INFO L225 Difference]: With dead ends: 10813 [2019-12-08 15:59:29,134 INFO L226 Difference]: Without dead ends: 10813 [2019-12-08 15:59:29,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-08 15:59:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10813 states. [2019-12-08 15:59:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10813 to 10278. [2019-12-08 15:59:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10278 states. [2019-12-08 15:59:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10278 states to 10278 states and 24484 transitions. [2019-12-08 15:59:29,254 INFO L78 Accepts]: Start accepts. Automaton has 10278 states and 24484 transitions. Word has length 34 [2019-12-08 15:59:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:29,254 INFO L462 AbstractCegarLoop]: Abstraction has 10278 states and 24484 transitions. [2019-12-08 15:59:29,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 15:59:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 10278 states and 24484 transitions. [2019-12-08 15:59:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-08 15:59:29,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:29,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:29,261 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1451730190, now seen corresponding path program 1 times [2019-12-08 15:59:29,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:29,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864005947] [2019-12-08 15:59:29,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:29,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864005947] [2019-12-08 15:59:29,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:29,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 15:59:29,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244504589] [2019-12-08 15:59:29,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 15:59:29,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 15:59:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:59:29,339 INFO L87 Difference]: Start difference. First operand 10278 states and 24484 transitions. Second operand 4 states. [2019-12-08 15:59:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:29,361 INFO L93 Difference]: Finished difference Result 3430 states and 7653 transitions. [2019-12-08 15:59:29,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 15:59:29,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-08 15:59:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:29,366 INFO L225 Difference]: With dead ends: 3430 [2019-12-08 15:59:29,366 INFO L226 Difference]: Without dead ends: 3430 [2019-12-08 15:59:29,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:59:29,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-12-08 15:59:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3354. [2019-12-08 15:59:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-12-08 15:59:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 7512 transitions. [2019-12-08 15:59:29,414 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 7512 transitions. Word has length 48 [2019-12-08 15:59:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:29,415 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 7512 transitions. [2019-12-08 15:59:29,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 15:59:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 7512 transitions. [2019-12-08 15:59:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-08 15:59:29,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:29,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:29,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1776556996, now seen corresponding path program 1 times [2019-12-08 15:59:29,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:29,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868925516] [2019-12-08 15:59:29,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:29,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868925516] [2019-12-08 15:59:29,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:29,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-08 15:59:29,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558876994] [2019-12-08 15:59:29,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 15:59:29,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 15:59:29,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:29,542 INFO L87 Difference]: Start difference. First operand 3354 states and 7512 transitions. Second operand 3 states. [2019-12-08 15:59:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:29,573 INFO L93 Difference]: Finished difference Result 3354 states and 7437 transitions. [2019-12-08 15:59:29,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 15:59:29,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-08 15:59:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:29,579 INFO L225 Difference]: With dead ends: 3354 [2019-12-08 15:59:29,579 INFO L226 Difference]: Without dead ends: 3354 [2019-12-08 15:59:29,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-12-08 15:59:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3354. [2019-12-08 15:59:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-12-08 15:59:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 7437 transitions. [2019-12-08 15:59:29,637 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 7437 transitions. Word has length 93 [2019-12-08 15:59:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:29,638 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 7437 transitions. [2019-12-08 15:59:29,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 15:59:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 7437 transitions. [2019-12-08 15:59:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-08 15:59:29,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:29,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:29,645 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1261390719, now seen corresponding path program 1 times [2019-12-08 15:59:29,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:29,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058581469] [2019-12-08 15:59:29,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:29,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058581469] [2019-12-08 15:59:29,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:29,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 15:59:29,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626158600] [2019-12-08 15:59:29,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:59:29,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:29,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:59:29,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:59:29,768 INFO L87 Difference]: Start difference. First operand 3354 states and 7437 transitions. Second operand 5 states. [2019-12-08 15:59:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:30,085 INFO L93 Difference]: Finished difference Result 3622 states and 7937 transitions. [2019-12-08 15:59:30,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 15:59:30,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-08 15:59:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:30,091 INFO L225 Difference]: With dead ends: 3622 [2019-12-08 15:59:30,091 INFO L226 Difference]: Without dead ends: 3622 [2019-12-08 15:59:30,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:59:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2019-12-08 15:59:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3527. [2019-12-08 15:59:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3527 states. [2019-12-08 15:59:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 7763 transitions. [2019-12-08 15:59:30,144 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 7763 transitions. Word has length 94 [2019-12-08 15:59:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:30,146 INFO L462 AbstractCegarLoop]: Abstraction has 3527 states and 7763 transitions. [2019-12-08 15:59:30,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:59:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 7763 transitions. [2019-12-08 15:59:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-08 15:59:30,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:30,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:30,153 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash 870783717, now seen corresponding path program 2 times [2019-12-08 15:59:30,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:30,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888057161] [2019-12-08 15:59:30,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:30,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888057161] [2019-12-08 15:59:30,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:30,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-08 15:59:30,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494245649] [2019-12-08 15:59:30,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 15:59:30,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 15:59:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:30,333 INFO L87 Difference]: Start difference. First operand 3527 states and 7763 transitions. Second operand 3 states. [2019-12-08 15:59:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:30,390 INFO L93 Difference]: Finished difference Result 3526 states and 7761 transitions. [2019-12-08 15:59:30,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 15:59:30,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-08 15:59:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:30,396 INFO L225 Difference]: With dead ends: 3526 [2019-12-08 15:59:30,396 INFO L226 Difference]: Without dead ends: 3526 [2019-12-08 15:59:30,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2019-12-08 15:59:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3444. [2019-12-08 15:59:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2019-12-08 15:59:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 7613 transitions. [2019-12-08 15:59:30,446 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 7613 transitions. Word has length 94 [2019-12-08 15:59:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:30,448 INFO L462 AbstractCegarLoop]: Abstraction has 3444 states and 7613 transitions. [2019-12-08 15:59:30,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 15:59:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 7613 transitions. [2019-12-08 15:59:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-08 15:59:30,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:30,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:30,455 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:30,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:30,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1584536319, now seen corresponding path program 1 times [2019-12-08 15:59:30,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:30,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046481454] [2019-12-08 15:59:30,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:30,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046481454] [2019-12-08 15:59:30,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:30,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-08 15:59:30,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579308173] [2019-12-08 15:59:30,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-08 15:59:30,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:30,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-08 15:59:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-08 15:59:30,902 INFO L87 Difference]: Start difference. First operand 3444 states and 7613 transitions. Second operand 17 states. [2019-12-08 15:59:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:32,747 INFO L93 Difference]: Finished difference Result 8525 states and 18874 transitions. [2019-12-08 15:59:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-08 15:59:32,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2019-12-08 15:59:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:32,757 INFO L225 Difference]: With dead ends: 8525 [2019-12-08 15:59:32,757 INFO L226 Difference]: Without dead ends: 4586 [2019-12-08 15:59:32,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1005, Unknown=0, NotChecked=0, Total=1260 [2019-12-08 15:59:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2019-12-08 15:59:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 3869. [2019-12-08 15:59:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3869 states. [2019-12-08 15:59:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 8547 transitions. [2019-12-08 15:59:32,840 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 8547 transitions. Word has length 95 [2019-12-08 15:59:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:32,840 INFO L462 AbstractCegarLoop]: Abstraction has 3869 states and 8547 transitions. [2019-12-08 15:59:32,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-08 15:59:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 8547 transitions. [2019-12-08 15:59:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-08 15:59:32,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:32,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:32,851 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash 790886631, now seen corresponding path program 2 times [2019-12-08 15:59:32,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:32,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116269485] [2019-12-08 15:59:32,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:33,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116269485] [2019-12-08 15:59:33,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:33,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-08 15:59:33,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761731727] [2019-12-08 15:59:33,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-08 15:59:33,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-08 15:59:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:59:33,009 INFO L87 Difference]: Start difference. First operand 3869 states and 8547 transitions. Second operand 4 states. [2019-12-08 15:59:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:33,318 INFO L93 Difference]: Finished difference Result 8419 states and 18543 transitions. [2019-12-08 15:59:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 15:59:33,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-08 15:59:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:33,328 INFO L225 Difference]: With dead ends: 8419 [2019-12-08 15:59:33,328 INFO L226 Difference]: Without dead ends: 8419 [2019-12-08 15:59:33,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-08 15:59:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2019-12-08 15:59:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 6410. [2019-12-08 15:59:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6410 states. [2019-12-08 15:59:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 14302 transitions. [2019-12-08 15:59:33,401 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 14302 transitions. Word has length 95 [2019-12-08 15:59:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:33,401 INFO L462 AbstractCegarLoop]: Abstraction has 6410 states and 14302 transitions. [2019-12-08 15:59:33,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-08 15:59:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 14302 transitions. [2019-12-08 15:59:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-08 15:59:33,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:33,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:33,409 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:33,410 INFO L82 PathProgramCache]: Analyzing trace with hash -742531793, now seen corresponding path program 3 times [2019-12-08 15:59:33,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:33,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517040140] [2019-12-08 15:59:33,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:33,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517040140] [2019-12-08 15:59:33,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:33,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 15:59:33,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240073283] [2019-12-08 15:59:33,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 15:59:33,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 15:59:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:59:33,544 INFO L87 Difference]: Start difference. First operand 6410 states and 14302 transitions. Second operand 6 states. [2019-12-08 15:59:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:34,016 INFO L93 Difference]: Finished difference Result 8516 states and 18911 transitions. [2019-12-08 15:59:34,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 15:59:34,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-08 15:59:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:34,028 INFO L225 Difference]: With dead ends: 8516 [2019-12-08 15:59:34,028 INFO L226 Difference]: Without dead ends: 8516 [2019-12-08 15:59:34,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-08 15:59:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2019-12-08 15:59:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 7479. [2019-12-08 15:59:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7479 states. [2019-12-08 15:59:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 16557 transitions. [2019-12-08 15:59:34,110 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 16557 transitions. Word has length 95 [2019-12-08 15:59:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:34,110 INFO L462 AbstractCegarLoop]: Abstraction has 7479 states and 16557 transitions. [2019-12-08 15:59:34,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 15:59:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 16557 transitions. [2019-12-08 15:59:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-08 15:59:34,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:34,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:34,120 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash -332569801, now seen corresponding path program 4 times [2019-12-08 15:59:34,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:34,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744473666] [2019-12-08 15:59:34,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:34,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744473666] [2019-12-08 15:59:34,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:34,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-08 15:59:34,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56769667] [2019-12-08 15:59:34,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-08 15:59:34,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-08 15:59:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-08 15:59:34,377 INFO L87 Difference]: Start difference. First operand 7479 states and 16557 transitions. Second operand 13 states. [2019-12-08 15:59:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:34,993 INFO L93 Difference]: Finished difference Result 10596 states and 23319 transitions. [2019-12-08 15:59:34,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-08 15:59:34,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-08 15:59:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:35,008 INFO L225 Difference]: With dead ends: 10596 [2019-12-08 15:59:35,008 INFO L226 Difference]: Without dead ends: 10498 [2019-12-08 15:59:35,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-08 15:59:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10498 states. [2019-12-08 15:59:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10498 to 9461. [2019-12-08 15:59:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2019-12-08 15:59:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 21155 transitions. [2019-12-08 15:59:35,134 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 21155 transitions. Word has length 95 [2019-12-08 15:59:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:35,134 INFO L462 AbstractCegarLoop]: Abstraction has 9461 states and 21155 transitions. [2019-12-08 15:59:35,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-08 15:59:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 21155 transitions. [2019-12-08 15:59:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-08 15:59:35,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:35,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:35,148 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:35,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1079118703, now seen corresponding path program 5 times [2019-12-08 15:59:35,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:35,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884582741] [2019-12-08 15:59:35,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:35,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884582741] [2019-12-08 15:59:35,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:35,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-08 15:59:35,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330077123] [2019-12-08 15:59:35,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-08 15:59:35,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-08 15:59:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-08 15:59:35,308 INFO L87 Difference]: Start difference. First operand 9461 states and 21155 transitions. Second operand 5 states. [2019-12-08 15:59:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:35,378 INFO L93 Difference]: Finished difference Result 9461 states and 20954 transitions. [2019-12-08 15:59:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-08 15:59:35,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-08 15:59:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:35,391 INFO L225 Difference]: With dead ends: 9461 [2019-12-08 15:59:35,392 INFO L226 Difference]: Without dead ends: 9461 [2019-12-08 15:59:35,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:59:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2019-12-08 15:59:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 9137. [2019-12-08 15:59:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2019-12-08 15:59:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 20261 transitions. [2019-12-08 15:59:35,519 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 20261 transitions. Word has length 95 [2019-12-08 15:59:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:35,520 INFO L462 AbstractCegarLoop]: Abstraction has 9137 states and 20261 transitions. [2019-12-08 15:59:35,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-08 15:59:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 20261 transitions. [2019-12-08 15:59:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-08 15:59:35,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:35,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:35,532 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2044435228, now seen corresponding path program 1 times [2019-12-08 15:59:35,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:35,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667458416] [2019-12-08 15:59:35,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:35,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667458416] [2019-12-08 15:59:35,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-08 15:59:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363864170] [2019-12-08 15:59:35,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-08 15:59:35,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-08 15:59:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-08 15:59:35,807 INFO L87 Difference]: Start difference. First operand 9137 states and 20261 transitions. Second operand 12 states. [2019-12-08 15:59:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:36,957 INFO L93 Difference]: Finished difference Result 15455 states and 33589 transitions. [2019-12-08 15:59:36,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-08 15:59:36,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-08 15:59:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:36,967 INFO L225 Difference]: With dead ends: 15455 [2019-12-08 15:59:36,968 INFO L226 Difference]: Without dead ends: 4205 [2019-12-08 15:59:36,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-08 15:59:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4205 states. [2019-12-08 15:59:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4205 to 3629. [2019-12-08 15:59:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-12-08 15:59:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 7883 transitions. [2019-12-08 15:59:37,021 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 7883 transitions. Word has length 96 [2019-12-08 15:59:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:37,022 INFO L462 AbstractCegarLoop]: Abstraction has 3629 states and 7883 transitions. [2019-12-08 15:59:37,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-08 15:59:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 7883 transitions. [2019-12-08 15:59:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-08 15:59:37,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:37,025 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:37,026 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash 273024232, now seen corresponding path program 1 times [2019-12-08 15:59:37,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:37,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456659804] [2019-12-08 15:59:37,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:37,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456659804] [2019-12-08 15:59:37,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:37,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 15:59:37,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353591174] [2019-12-08 15:59:37,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 15:59:37,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 15:59:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 15:59:37,133 INFO L87 Difference]: Start difference. First operand 3629 states and 7883 transitions. Second operand 6 states. [2019-12-08 15:59:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:38,953 INFO L93 Difference]: Finished difference Result 3857 states and 8269 transitions. [2019-12-08 15:59:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 15:59:38,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-08 15:59:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:38,957 INFO L225 Difference]: With dead ends: 3857 [2019-12-08 15:59:38,958 INFO L226 Difference]: Without dead ends: 3774 [2019-12-08 15:59:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-08 15:59:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2019-12-08 15:59:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3583. [2019-12-08 15:59:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-12-08 15:59:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 7771 transitions. [2019-12-08 15:59:38,992 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 7771 transitions. Word has length 97 [2019-12-08 15:59:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:38,993 INFO L462 AbstractCegarLoop]: Abstraction has 3583 states and 7771 transitions. [2019-12-08 15:59:38,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 15:59:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 7771 transitions. [2019-12-08 15:59:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-08 15:59:38,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:38,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:38,997 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 822787398, now seen corresponding path program 1 times [2019-12-08 15:59:38,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:38,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336303092] [2019-12-08 15:59:38,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:39,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336303092] [2019-12-08 15:59:39,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:39,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-08 15:59:39,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590176426] [2019-12-08 15:59:39,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-08 15:59:39,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-08 15:59:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-12-08 15:59:39,373 INFO L87 Difference]: Start difference. First operand 3583 states and 7771 transitions. Second operand 18 states. [2019-12-08 15:59:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:40,628 INFO L93 Difference]: Finished difference Result 7999 states and 17292 transitions. [2019-12-08 15:59:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-08 15:59:40,629 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-12-08 15:59:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:40,638 INFO L225 Difference]: With dead ends: 7999 [2019-12-08 15:59:40,638 INFO L226 Difference]: Without dead ends: 7901 [2019-12-08 15:59:40,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-12-08 15:59:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7901 states. [2019-12-08 15:59:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 5512. [2019-12-08 15:59:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-12-08 15:59:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 12171 transitions. [2019-12-08 15:59:40,706 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 12171 transitions. Word has length 97 [2019-12-08 15:59:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:40,706 INFO L462 AbstractCegarLoop]: Abstraction has 5512 states and 12171 transitions. [2019-12-08 15:59:40,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-08 15:59:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 12171 transitions. [2019-12-08 15:59:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-08 15:59:40,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:40,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:40,712 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 953133656, now seen corresponding path program 1 times [2019-12-08 15:59:40,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:40,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109592453] [2019-12-08 15:59:40,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:41,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109592453] [2019-12-08 15:59:41,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:41,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-08 15:59:41,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918355182] [2019-12-08 15:59:41,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-08 15:59:41,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-08 15:59:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-08 15:59:41,321 INFO L87 Difference]: Start difference. First operand 5512 states and 12171 transitions. Second operand 15 states. [2019-12-08 15:59:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:43,432 INFO L93 Difference]: Finished difference Result 10528 states and 23303 transitions. [2019-12-08 15:59:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-08 15:59:43,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-08 15:59:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:43,446 INFO L225 Difference]: With dead ends: 10528 [2019-12-08 15:59:43,446 INFO L226 Difference]: Without dead ends: 10241 [2019-12-08 15:59:43,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2019-12-08 15:59:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states. [2019-12-08 15:59:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 9838. [2019-12-08 15:59:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9838 states. [2019-12-08 15:59:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9838 states to 9838 states and 21905 transitions. [2019-12-08 15:59:43,546 INFO L78 Accepts]: Start accepts. Automaton has 9838 states and 21905 transitions. Word has length 98 [2019-12-08 15:59:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:43,546 INFO L462 AbstractCegarLoop]: Abstraction has 9838 states and 21905 transitions. [2019-12-08 15:59:43,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-08 15:59:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9838 states and 21905 transitions. [2019-12-08 15:59:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-08 15:59:43,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:43,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:43,556 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1860317714, now seen corresponding path program 1 times [2019-12-08 15:59:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:43,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495859202] [2019-12-08 15:59:43,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:43,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495859202] [2019-12-08 15:59:43,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:43,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-08 15:59:43,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784667547] [2019-12-08 15:59:43,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 15:59:43,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:43,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 15:59:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:43,609 INFO L87 Difference]: Start difference. First operand 9838 states and 21905 transitions. Second operand 3 states. [2019-12-08 15:59:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:43,699 INFO L93 Difference]: Finished difference Result 7168 states and 15075 transitions. [2019-12-08 15:59:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 15:59:43,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-08 15:59:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:43,708 INFO L225 Difference]: With dead ends: 7168 [2019-12-08 15:59:43,708 INFO L226 Difference]: Without dead ends: 7126 [2019-12-08 15:59:43,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 15:59:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2019-12-08 15:59:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5608. [2019-12-08 15:59:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5608 states. [2019-12-08 15:59:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 12123 transitions. [2019-12-08 15:59:43,800 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 12123 transitions. Word has length 98 [2019-12-08 15:59:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:43,801 INFO L462 AbstractCegarLoop]: Abstraction has 5608 states and 12123 transitions. [2019-12-08 15:59:43,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 15:59:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 12123 transitions. [2019-12-08 15:59:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-08 15:59:43,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:43,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:43,809 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 272691207, now seen corresponding path program 1 times [2019-12-08 15:59:43,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:43,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642225532] [2019-12-08 15:59:43,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:44,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642225532] [2019-12-08 15:59:44,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:44,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-08 15:59:44,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099865231] [2019-12-08 15:59:44,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-08 15:59:44,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:44,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-08 15:59:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-08 15:59:44,266 INFO L87 Difference]: Start difference. First operand 5608 states and 12123 transitions. Second operand 19 states. [2019-12-08 15:59:45,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:45,729 INFO L93 Difference]: Finished difference Result 8172 states and 17523 transitions. [2019-12-08 15:59:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-08 15:59:45,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-12-08 15:59:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:45,738 INFO L225 Difference]: With dead ends: 8172 [2019-12-08 15:59:45,739 INFO L226 Difference]: Without dead ends: 7900 [2019-12-08 15:59:45,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2019-12-08 15:59:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2019-12-08 15:59:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7384. [2019-12-08 15:59:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7384 states. [2019-12-08 15:59:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7384 states to 7384 states and 15973 transitions. [2019-12-08 15:59:45,816 INFO L78 Accepts]: Start accepts. Automaton has 7384 states and 15973 transitions. Word has length 98 [2019-12-08 15:59:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:45,816 INFO L462 AbstractCegarLoop]: Abstraction has 7384 states and 15973 transitions. [2019-12-08 15:59:45,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-08 15:59:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7384 states and 15973 transitions. [2019-12-08 15:59:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-08 15:59:45,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:45,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:45,826 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 741591247, now seen corresponding path program 1 times [2019-12-08 15:59:45,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:45,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650125602] [2019-12-08 15:59:45,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 15:59:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 15:59:46,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650125602] [2019-12-08 15:59:46,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 15:59:46,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-08 15:59:46,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943413778] [2019-12-08 15:59:46,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-08 15:59:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 15:59:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-08 15:59:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-12-08 15:59:46,971 INFO L87 Difference]: Start difference. First operand 7384 states and 15973 transitions. Second operand 27 states. [2019-12-08 15:59:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 15:59:56,512 INFO L93 Difference]: Finished difference Result 11889 states and 25271 transitions. [2019-12-08 15:59:56,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-08 15:59:56,513 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 98 [2019-12-08 15:59:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 15:59:56,524 INFO L225 Difference]: With dead ends: 11889 [2019-12-08 15:59:56,524 INFO L226 Difference]: Without dead ends: 11043 [2019-12-08 15:59:56,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2276 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1026, Invalid=6630, Unknown=0, NotChecked=0, Total=7656 [2019-12-08 15:59:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2019-12-08 15:59:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 8280. [2019-12-08 15:59:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-12-08 15:59:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 17920 transitions. [2019-12-08 15:59:56,616 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 17920 transitions. Word has length 98 [2019-12-08 15:59:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 15:59:56,616 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 17920 transitions. [2019-12-08 15:59:56,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-08 15:59:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 17920 transitions. [2019-12-08 15:59:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-08 15:59:56,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 15:59:56,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 15:59:56,627 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-08 15:59:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 15:59:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 402744400, now seen corresponding path program 1 times [2019-12-08 15:59:56,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 15:59:56,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66874921] [2019-12-08 15:59:56,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 15:59:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 15:59:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-08 15:59:56,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-08 15:59:56,802 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-08 15:59:56,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= v_~main$tmp_guard0~0_23 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1647~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_311 0) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19|) 0) (= 0 |v_#NULL.base_7|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19| 1) |v_#valid_46|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1647~0.base_19|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19|) |v_ULTIMATE.start_main_~#t1647~0.offset_15| 0))) (= 0 |v_ULTIMATE.start_main_~#t1647~0.offset_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_17|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1647~0.offset=|v_ULTIMATE.start_main_~#t1647~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ULTIMATE.start_main_~#t1647~0.base=|v_ULTIMATE.start_main_~#t1647~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ULTIMATE.start_main_~#t1648~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1648~0.base, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1647~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1647~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-08 15:59:56,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1648~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1648~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1648~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1648~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11|) |v_ULTIMATE.start_main_~#t1648~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, ULTIMATE.start_main_~#t1648~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1648~0.base] because there is no mapped edge [2019-12-08 15:59:56,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-211797073 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-211797073 256))) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-211797073| |P0Thread1of1ForFork0_#t~ite3_Out-211797073|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-211797073 |P0Thread1of1ForFork0_#t~ite3_Out-211797073|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y~0_In-211797073 |P0Thread1of1ForFork0_#t~ite3_Out-211797073|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-211797073, ~y$w_buff1~0=~y$w_buff1~0_In-211797073, ~y~0=~y~0_In-211797073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211797073} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-211797073, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-211797073|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-211797073|, ~y$w_buff1~0=~y$w_buff1~0_In-211797073, ~y~0=~y~0_In-211797073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211797073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-08 15:59:56,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1574786746 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1574786746 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1574786746|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1574786746 |P0Thread1of1ForFork0_#t~ite5_Out-1574786746|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1574786746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1574786746} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1574786746|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1574786746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1574786746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-08 15:59:56,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2049910557 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2049910557 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In2049910557 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2049910557 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2049910557 |P0Thread1of1ForFork0_#t~ite6_Out2049910557|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2049910557| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2049910557, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2049910557, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2049910557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2049910557} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2049910557|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2049910557, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2049910557, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2049910557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2049910557} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-08 15:59:56,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-266429937 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-266429937 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-266429937 |P0Thread1of1ForFork0_#t~ite7_Out-266429937|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-266429937| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-266429937, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-266429937} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-266429937, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-266429937|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-266429937} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-08 15:59:56,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1531354050 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1531354050 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1531354050 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1531354050 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1531354050|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1531354050 |P0Thread1of1ForFork0_#t~ite8_Out1531354050|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1531354050, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531354050, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1531354050, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531354050} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1531354050, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531354050, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1531354050|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1531354050, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531354050} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-08 15:59:56,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite10_Out-266138418| |P0Thread1of1ForFork0_#t~ite9_Out-266138418|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-266138418 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-266138418 256)))) (or (and (= ~y~0_In-266138418 |P0Thread1of1ForFork0_#t~ite9_Out-266138418|) .cse0 (or .cse1 .cse2)) (and (= ~y$w_buff1~0_In-266138418 |P0Thread1of1ForFork0_#t~ite9_Out-266138418|) .cse0 (not .cse2) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-266138418, ~y$w_buff1~0=~y$w_buff1~0_In-266138418, ~y~0=~y~0_In-266138418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-266138418} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out-266138418|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-266138418, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-266138418|, ~y$w_buff1~0=~y$w_buff1~0_In-266138418, ~y~0=~y~0_In-266138418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-266138418} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-08 15:59:56,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_458 1) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33)) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= v_P1Thread1of1ForFork1_~arg.base_31 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_31) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_217 256) 0)) (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-08 15:59:56,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2089562161 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2089562161 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite17_Out-2089562161| ~y$w_buff1~0_In-2089562161)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out-2089562161| ~y$w_buff0~0_In-2089562161) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2089562161, ~y$w_buff1~0=~y$w_buff1~0_In-2089562161, ~y$w_buff0~0=~y$w_buff0~0_In-2089562161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2089562161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2089562161, ~y$w_buff1~0=~y$w_buff1~0_In-2089562161, ~y$w_buff0~0=~y$w_buff0~0_In-2089562161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2089562161, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-2089562161|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-08 15:59:56,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_10|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_10|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_13|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-08 15:59:56,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_14|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_10|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-08 15:59:56,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In342713380 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite37_Out342713380| ~y~0_In342713380)) (and (= ~y$mem_tmp~0_In342713380 |P1Thread1of1ForFork1_#t~ite37_Out342713380|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In342713380, ~y$flush_delayed~0=~y$flush_delayed~0_In342713380, ~y~0=~y~0_In342713380} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In342713380, ~y$flush_delayed~0=~y$flush_delayed~0_In342713380, ~y~0=~y~0_In342713380, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out342713380|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-08 15:59:56,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite41_Out-1753652399| |P1Thread1of1ForFork1_#t~ite40_Out-1753652399|)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1753652399 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1753652399 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y$w_buff1~0_In-1753652399 |P1Thread1of1ForFork1_#t~ite40_Out-1753652399|)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff0~0_In-1753652399 |P1Thread1of1ForFork1_#t~ite40_Out-1753652399|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753652399, ~y$w_buff1~0=~y$w_buff1~0_In-1753652399, ~y$w_buff0~0=~y$w_buff0~0_In-1753652399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1753652399} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753652399, ~y$w_buff1~0=~y$w_buff1~0_In-1753652399, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out-1753652399|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out-1753652399|, ~y$w_buff0~0=~y$w_buff0~0_In-1753652399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1753652399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-08 15:59:56,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_11|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_14|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-08 15:59:56,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In886324672 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In886324672 |P1Thread1of1ForFork1_#t~ite60_Out886324672|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite60_Out886324672| ~y~0_In886324672)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In886324672, ~y$flush_delayed~0=~y$flush_delayed~0_In886324672, ~y~0=~y~0_In886324672} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In886324672, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out886324672|, ~y$flush_delayed~0=~y$flush_delayed~0_In886324672, ~y~0=~y~0_In886324672} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-08 15:59:56,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1600840887 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1600840887 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite63_Out1600840887| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1600840887 |P1Thread1of1ForFork1_#t~ite63_Out1600840887|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1600840887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1600840887} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out1600840887|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1600840887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1600840887} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-08 15:59:56,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1174151798 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1174151798 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1174151798 |P0Thread1of1ForFork0_#t~ite11_Out-1174151798|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite11_Out-1174151798|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1174151798, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1174151798} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1174151798|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1174151798, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1174151798} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-08 15:59:56,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In426069468 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In426069468 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In426069468 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In426069468 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite64_Out426069468| ~y$w_buff1_used~0_In426069468)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite64_Out426069468| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In426069468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In426069468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In426069468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426069468} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In426069468, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out426069468|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In426069468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In426069468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426069468} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-08 15:59:56,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In1019224256 ~y$r_buff0_thd2~0_Out1019224256)) (.cse2 (= (mod ~y$w_buff0_used~0_In1019224256 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1019224256 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd2~0_Out1019224256 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1019224256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1019224256} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1019224256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1019224256, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out1019224256|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-08 15:59:56,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1752543545 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1752543545 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1752543545 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1752543545 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite66_Out1752543545| 0)) (and (= |P1Thread1of1ForFork1_#t~ite66_Out1752543545| ~y$r_buff1_thd2~0_In1752543545) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1752543545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1752543545, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1752543545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1752543545} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1752543545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1752543545, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1752543545, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out1752543545|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1752543545} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-08 15:59:56,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-08 15:59:56,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1361379896 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1361379896 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1361379896 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1361379896 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out1361379896| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1361379896 |P0Thread1of1ForFork0_#t~ite12_Out1361379896|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1361379896, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1361379896, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1361379896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1361379896} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1361379896, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1361379896, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1361379896, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1361379896|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1361379896} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-08 15:59:56,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1667182471 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1667182471 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite13_Out1667182471|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In1667182471 |P0Thread1of1ForFork0_#t~ite13_Out1667182471|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1667182471, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1667182471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1667182471, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1667182471, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out1667182471|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-08 15:59:56,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1273606197 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1273606197 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1273606197 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1273606197 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite14_Out1273606197| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite14_Out1273606197| ~y$r_buff1_thd1~0_In1273606197)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1273606197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1273606197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1273606197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273606197} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1273606197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1273606197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1273606197, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1273606197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273606197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-08 15:59:56,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_28|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_27|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-08 15:59:56,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_26) 1 0) 0) 0 1) v_~main$tmp_guard0~0_9)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-08 15:59:56,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1947948692 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1947948692 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1947948692 |ULTIMATE.start_main_#t~ite69_Out-1947948692|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite69_Out-1947948692| ~y$w_buff1~0_In-1947948692) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1947948692, ~y~0=~y~0_In-1947948692, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1947948692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1947948692} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1947948692, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1947948692|, ~y~0=~y~0_In-1947948692, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1947948692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1947948692} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-08 15:59:56,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-08 15:59:56,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1915647930 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1915647930 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1915647930 |ULTIMATE.start_main_#t~ite71_Out1915647930|)) (and (= 0 |ULTIMATE.start_main_#t~ite71_Out1915647930|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1915647930, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1915647930} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1915647930|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915647930, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1915647930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-08 15:59:56,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-340940825 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-340940825 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-340940825 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-340940825 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite72_Out-340940825| ~y$w_buff1_used~0_In-340940825)) (and (= |ULTIMATE.start_main_#t~ite72_Out-340940825| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-340940825, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-340940825, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-340940825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-340940825} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-340940825|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-340940825, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-340940825, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-340940825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-340940825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-08 15:59:56,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-398722615 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-398722615 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite73_Out-398722615| ~y$r_buff0_thd0~0_In-398722615)) (and (= |ULTIMATE.start_main_#t~ite73_Out-398722615| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-398722615, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-398722615} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-398722615|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-398722615, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-398722615} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-08 15:59:56,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In16645307 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In16645307 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In16645307 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In16645307 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite74_Out16645307| 0)) (and (= |ULTIMATE.start_main_#t~ite74_Out16645307| ~y$r_buff1_thd0~0_In16645307) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In16645307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In16645307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In16645307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16645307} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out16645307|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16645307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In16645307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In16645307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16645307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-08 15:59:56,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1955079606 256) 0))) (or (and .cse0 (= ~y~0_In-1955079606 |ULTIMATE.start_main_#t~ite97_Out-1955079606|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1955079606 |ULTIMATE.start_main_#t~ite97_Out-1955079606|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1955079606, ~y$flush_delayed~0=~y$flush_delayed~0_In-1955079606, ~y~0=~y~0_In-1955079606} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1955079606, ~y$flush_delayed~0=~y$flush_delayed~0_In-1955079606, ~y~0=~y~0_In-1955079606, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1955079606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-08 15:59:56,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-08 15:59:56,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 03:59:56 BasicIcfg [2019-12-08 15:59:56,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 15:59:56,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 15:59:56,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 15:59:56,961 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 15:59:56,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:58:11" (3/4) ... [2019-12-08 15:59:56,964 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-08 15:59:56,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= v_~main$tmp_guard0~0_23 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1647~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_311 0) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (= 0 v_~y$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19|) 0) (= 0 |v_#NULL.base_7|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19| 1) |v_#valid_46|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1647~0.base_19|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19|) |v_ULTIMATE.start_main_~#t1647~0.offset_15| 0))) (= 0 |v_ULTIMATE.start_main_~#t1647~0.offset_15|) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_17|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1647~0.offset=|v_ULTIMATE.start_main_~#t1647~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ULTIMATE.start_main_~#t1647~0.base=|v_ULTIMATE.start_main_~#t1647~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ULTIMATE.start_main_~#t1648~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1648~0.base, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1647~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1647~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-08 15:59:56,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1648~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1648~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1648~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1648~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11|) |v_ULTIMATE.start_main_~#t1648~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, ULTIMATE.start_main_~#t1648~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1648~0.base] because there is no mapped edge [2019-12-08 15:59:56,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-211797073 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-211797073 256))) (.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-211797073| |P0Thread1of1ForFork0_#t~ite3_Out-211797073|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-211797073 |P0Thread1of1ForFork0_#t~ite3_Out-211797073|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y~0_In-211797073 |P0Thread1of1ForFork0_#t~ite3_Out-211797073|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-211797073, ~y$w_buff1~0=~y$w_buff1~0_In-211797073, ~y~0=~y~0_In-211797073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211797073} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-211797073, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-211797073|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-211797073|, ~y$w_buff1~0=~y$w_buff1~0_In-211797073, ~y~0=~y~0_In-211797073, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211797073} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-08 15:59:56,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1574786746 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1574786746 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1574786746|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1574786746 |P0Thread1of1ForFork0_#t~ite5_Out-1574786746|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1574786746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1574786746} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1574786746|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1574786746, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1574786746} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-08 15:59:56,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2049910557 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2049910557 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In2049910557 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2049910557 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2049910557 |P0Thread1of1ForFork0_#t~ite6_Out2049910557|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2049910557| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2049910557, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2049910557, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2049910557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2049910557} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2049910557|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2049910557, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2049910557, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2049910557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2049910557} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-08 15:59:56,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-266429937 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-266429937 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-266429937 |P0Thread1of1ForFork0_#t~ite7_Out-266429937|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-266429937| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-266429937, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-266429937} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-266429937, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-266429937|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-266429937} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-08 15:59:56,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1531354050 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1531354050 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1531354050 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1531354050 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1531354050|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In1531354050 |P0Thread1of1ForFork0_#t~ite8_Out1531354050|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1531354050, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531354050, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1531354050, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531354050} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1531354050, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1531354050, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1531354050|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1531354050, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1531354050} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-08 15:59:56,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite10_Out-266138418| |P0Thread1of1ForFork0_#t~ite9_Out-266138418|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-266138418 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-266138418 256)))) (or (and (= ~y~0_In-266138418 |P0Thread1of1ForFork0_#t~ite9_Out-266138418|) .cse0 (or .cse1 .cse2)) (and (= ~y$w_buff1~0_In-266138418 |P0Thread1of1ForFork0_#t~ite9_Out-266138418|) .cse0 (not .cse2) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-266138418, ~y$w_buff1~0=~y$w_buff1~0_In-266138418, ~y~0=~y~0_In-266138418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-266138418} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out-266138418|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-266138418, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-266138418|, ~y$w_buff1~0=~y$w_buff1~0_In-266138418, ~y~0=~y~0_In-266138418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-266138418} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-08 15:59:56,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_458 1) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33)) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= v_P1Thread1of1ForFork1_~arg.base_31 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_31) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_217 256) 0)) (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-08 15:59:56,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-2089562161 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2089562161 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite17_Out-2089562161| ~y$w_buff1~0_In-2089562161)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out-2089562161| ~y$w_buff0~0_In-2089562161) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2089562161, ~y$w_buff1~0=~y$w_buff1~0_In-2089562161, ~y$w_buff0~0=~y$w_buff0~0_In-2089562161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2089562161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2089562161, ~y$w_buff1~0=~y$w_buff1~0_In-2089562161, ~y$w_buff0~0=~y$w_buff0~0_In-2089562161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2089562161, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-2089562161|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-08 15:59:56,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_10|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_10|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_13|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-08 15:59:56,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_14|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_10|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-08 15:59:56,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In342713380 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite37_Out342713380| ~y~0_In342713380)) (and (= ~y$mem_tmp~0_In342713380 |P1Thread1of1ForFork1_#t~ite37_Out342713380|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In342713380, ~y$flush_delayed~0=~y$flush_delayed~0_In342713380, ~y~0=~y~0_In342713380} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In342713380, ~y$flush_delayed~0=~y$flush_delayed~0_In342713380, ~y~0=~y~0_In342713380, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out342713380|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-08 15:59:56,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite41_Out-1753652399| |P1Thread1of1ForFork1_#t~ite40_Out-1753652399|)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1753652399 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1753652399 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y$w_buff1~0_In-1753652399 |P1Thread1of1ForFork1_#t~ite40_Out-1753652399|)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff0~0_In-1753652399 |P1Thread1of1ForFork1_#t~ite40_Out-1753652399|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753652399, ~y$w_buff1~0=~y$w_buff1~0_In-1753652399, ~y$w_buff0~0=~y$w_buff0~0_In-1753652399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1753652399} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1753652399, ~y$w_buff1~0=~y$w_buff1~0_In-1753652399, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out-1753652399|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out-1753652399|, ~y$w_buff0~0=~y$w_buff0~0_In-1753652399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1753652399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-08 15:59:56,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_11|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_14|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-08 15:59:56,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In886324672 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In886324672 |P1Thread1of1ForFork1_#t~ite60_Out886324672|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite60_Out886324672| ~y~0_In886324672)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In886324672, ~y$flush_delayed~0=~y$flush_delayed~0_In886324672, ~y~0=~y~0_In886324672} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In886324672, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out886324672|, ~y$flush_delayed~0=~y$flush_delayed~0_In886324672, ~y~0=~y~0_In886324672} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-08 15:59:56,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1600840887 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1600840887 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite63_Out1600840887| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1600840887 |P1Thread1of1ForFork1_#t~ite63_Out1600840887|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1600840887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1600840887} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out1600840887|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1600840887, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1600840887} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-08 15:59:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1174151798 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1174151798 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1174151798 |P0Thread1of1ForFork0_#t~ite11_Out-1174151798|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite11_Out-1174151798|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1174151798, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1174151798} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1174151798|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1174151798, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1174151798} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-08 15:59:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In426069468 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In426069468 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In426069468 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In426069468 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite64_Out426069468| ~y$w_buff1_used~0_In426069468)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite64_Out426069468| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In426069468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In426069468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In426069468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426069468} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In426069468, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out426069468|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In426069468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In426069468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426069468} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-08 15:59:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In1019224256 ~y$r_buff0_thd2~0_Out1019224256)) (.cse2 (= (mod ~y$w_buff0_used~0_In1019224256 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1019224256 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd2~0_Out1019224256 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1019224256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1019224256} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1019224256, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1019224256, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out1019224256|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-08 15:59:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1752543545 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1752543545 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1752543545 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1752543545 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite66_Out1752543545| 0)) (and (= |P1Thread1of1ForFork1_#t~ite66_Out1752543545| ~y$r_buff1_thd2~0_In1752543545) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1752543545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1752543545, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1752543545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1752543545} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1752543545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1752543545, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1752543545, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out1752543545|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1752543545} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-08 15:59:56,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-08 15:59:56,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1361379896 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1361379896 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1361379896 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1361379896 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out1361379896| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1361379896 |P0Thread1of1ForFork0_#t~ite12_Out1361379896|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1361379896, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1361379896, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1361379896, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1361379896} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1361379896, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1361379896, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1361379896, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1361379896|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1361379896} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-08 15:59:56,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1667182471 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1667182471 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite13_Out1667182471|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In1667182471 |P0Thread1of1ForFork0_#t~ite13_Out1667182471|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1667182471, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1667182471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1667182471, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1667182471, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out1667182471|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-08 15:59:56,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1273606197 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1273606197 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1273606197 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1273606197 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite14_Out1273606197| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite14_Out1273606197| ~y$r_buff1_thd1~0_In1273606197)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1273606197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1273606197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1273606197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273606197} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1273606197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1273606197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1273606197, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1273606197|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1273606197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-08 15:59:56,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_28|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_27|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-08 15:59:56,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_26) 1 0) 0) 0 1) v_~main$tmp_guard0~0_9)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-08 15:59:56,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1947948692 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1947948692 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1947948692 |ULTIMATE.start_main_#t~ite69_Out-1947948692|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite69_Out-1947948692| ~y$w_buff1~0_In-1947948692) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1947948692, ~y~0=~y~0_In-1947948692, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1947948692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1947948692} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1947948692, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1947948692|, ~y~0=~y~0_In-1947948692, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1947948692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1947948692} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-08 15:59:56,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-08 15:59:56,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1915647930 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1915647930 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1915647930 |ULTIMATE.start_main_#t~ite71_Out1915647930|)) (and (= 0 |ULTIMATE.start_main_#t~ite71_Out1915647930|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1915647930, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1915647930} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1915647930|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1915647930, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1915647930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-08 15:59:56,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-340940825 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-340940825 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-340940825 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-340940825 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite72_Out-340940825| ~y$w_buff1_used~0_In-340940825)) (and (= |ULTIMATE.start_main_#t~ite72_Out-340940825| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-340940825, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-340940825, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-340940825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-340940825} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-340940825|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-340940825, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-340940825, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-340940825, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-340940825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-08 15:59:56,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-398722615 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-398722615 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite73_Out-398722615| ~y$r_buff0_thd0~0_In-398722615)) (and (= |ULTIMATE.start_main_#t~ite73_Out-398722615| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-398722615, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-398722615} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-398722615|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-398722615, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-398722615} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-08 15:59:56,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In16645307 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In16645307 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In16645307 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In16645307 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite74_Out16645307| 0)) (and (= |ULTIMATE.start_main_#t~ite74_Out16645307| ~y$r_buff1_thd0~0_In16645307) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In16645307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In16645307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In16645307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16645307} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out16645307|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16645307, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In16645307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In16645307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16645307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-08 15:59:57,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1955079606 256) 0))) (or (and .cse0 (= ~y~0_In-1955079606 |ULTIMATE.start_main_#t~ite97_Out-1955079606|)) (and (not .cse0) (= ~y$mem_tmp~0_In-1955079606 |ULTIMATE.start_main_#t~ite97_Out-1955079606|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1955079606, ~y$flush_delayed~0=~y$flush_delayed~0_In-1955079606, ~y~0=~y~0_In-1955079606} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1955079606, ~y$flush_delayed~0=~y$flush_delayed~0_In-1955079606, ~y~0=~y~0_In-1955079606, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1955079606|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-08 15:59:57,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-08 15:59:57,111 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-12-08 15:59:57,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 15:59:57,113 INFO L168 Benchmark]: Toolchain (without parser) took 107564.58 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 951.0 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 620.5 MB. Max. memory is 11.5 GB. [2019-12-08 15:59:57,113 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 15:59:57,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 923.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -123.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-08 15:59:57,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.25 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-12-08 15:59:57,114 INFO L168 Benchmark]: Boogie Preprocessor took 80.51 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-08 15:59:57,115 INFO L168 Benchmark]: RCFGBuilder took 1083.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.1 MB in the end (delta: 73.2 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. [2019-12-08 15:59:57,115 INFO L168 Benchmark]: TraceAbstraction took 105183.47 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 994.1 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 488.1 MB. Max. memory is 11.5 GB. [2019-12-08 15:59:57,116 INFO L168 Benchmark]: Witness Printer took 150.47 ms. Allocated memory is still 4.6 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-12-08 15:59:57,118 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.73 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 923.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -123.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.25 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. * Boogie Preprocessor took 80.51 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1083.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 994.1 MB in the end (delta: 73.2 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 105183.47 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 994.1 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 488.1 MB. Max. memory is 11.5 GB. * Witness Printer took 150.47 ms. Allocated memory is still 4.6 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.3s, 244 ProgramPointsBefore, 155 ProgramPointsAfterwards, 326 TransitionsBefore, 192 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 78 ConcurrentYvCompositions, 48 ChoiceCompositions, 16023 VarBasedMoverChecksPositive, 415 VarBasedMoverChecksNegative, 104 SemBasedMoverChecksPositive, 452 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 282427 CheckedPairsTotal, 142 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1647, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1648, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L788] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L789] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L790] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7432 SDtfs, 9722 SDslu, 29719 SDs, 0 SdLazy, 18067 SolverSat, 712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 52 SyntacticMatches, 32 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2993 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198947occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 92043 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1588 ConstructedInterpolants, 0 QuantifiedInterpolants, 800436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...