./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi007_rmo.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 bebf2e800959dd87191c01f9bf178b468f23daf8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:23:27,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:27,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:27,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:27,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:27,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:27,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:27,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:27,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:27,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:27,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:27,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:27,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:27,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:27,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:27,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:27,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:27,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:27,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:27,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:27,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:27,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:27,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:27,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:27,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:27,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:27,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:27,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:27,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:27,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:27,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:27,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:27,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:27,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:27,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:27,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:27,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:27,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:27,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:27,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:27,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:27,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:23:27,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:27,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:27,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:27,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:27,457 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:27,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:27,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:27,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:27,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:27,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:27,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:27,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:27,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:27,460 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:27,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:27,461 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:27,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:27,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:27,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:27,462 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:27,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:27,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:27,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:27,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:27,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:27,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:27,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:27,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:27,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:27,465 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 -> bebf2e800959dd87191c01f9bf178b468f23daf8 [2019-11-28 18:23:27,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:27,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:27,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:27,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:27,775 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:27,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i [2019-11-28 18:23:27,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b82583c2/e1d2c8f79157439dbe785d53398fc13f/FLAG81fe69f02 [2019-11-28 18:23:28,435 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:28,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_rmo.opt.i [2019-11-28 18:23:28,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b82583c2/e1d2c8f79157439dbe785d53398fc13f/FLAG81fe69f02 [2019-11-28 18:23:28,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b82583c2/e1d2c8f79157439dbe785d53398fc13f [2019-11-28 18:23:28,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:28,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:28,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:28,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:28,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:28,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1dbb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:28, skipping insertion in model container [2019-11-28 18:23:28,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:28" (1/1) ... [2019-11-28 18:23:28,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:28,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:29,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:29,277 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:29,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:29,442 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:29,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29 WrapperNode [2019-11-28 18:23:29,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:29,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:29,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:29,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:29,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:29,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:29,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:29,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:29,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... [2019-11-28 18:23:29,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:29,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:29,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:29,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:29,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:29,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:29,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:29,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:29,657 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:23:30,389 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:30,390 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:30,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:30 BoogieIcfgContainer [2019-11-28 18:23:30,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:30,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:30,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:30,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:30,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:28" (1/3) ... [2019-11-28 18:23:30,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b942446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:30, skipping insertion in model container [2019-11-28 18:23:30,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:29" (2/3) ... [2019-11-28 18:23:30,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b942446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:30, skipping insertion in model container [2019-11-28 18:23:30,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:30" (3/3) ... [2019-11-28 18:23:30,408 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-11-28 18:23:30,420 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:30,420 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:30,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:30,434 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:30,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,480 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,481 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,482 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:30,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:30,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:30,575 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:30,575 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:30,575 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:30,575 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:30,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:30,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:30,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:30,595 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:23:30,598 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:30,691 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:30,692 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:30,707 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:30,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:30,782 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:30,782 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:30,791 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:30,812 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:23:30,814 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:35,404 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:23:35,539 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:23:35,907 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-11-28 18:23:35,907 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-11-28 18:23:35,911 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-11-28 18:23:36,674 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-11-28 18:23:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-11-28 18:23:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:23:36,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:36,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:23:36,690 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-11-28 18:23:36,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:36,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388223309] [2019-11-28 18:23:36,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:37,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388223309] [2019-11-28 18:23:37,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:37,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:37,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652826716] [2019-11-28 18:23:37,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:37,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:37,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:37,100 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-11-28 18:23:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:37,409 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-11-28 18:23:37,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:37,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:23:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:37,515 INFO L225 Difference]: With dead ends: 9266 [2019-11-28 18:23:37,515 INFO L226 Difference]: Without dead ends: 8258 [2019-11-28 18:23:37,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-11-28 18:23:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-11-28 18:23:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-11-28 18:23:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-11-28 18:23:37,991 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-11-28 18:23:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:37,992 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-11-28 18:23:37,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-11-28 18:23:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:37,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:37,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:37,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-11-28 18:23:38,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:38,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852205951] [2019-11-28 18:23:38,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:38,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852205951] [2019-11-28 18:23:38,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:38,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:38,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187215028] [2019-11-28 18:23:38,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:38,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:38,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:38,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:38,156 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-11-28 18:23:38,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:38,673 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-11-28 18:23:38,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:38,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:23:38,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:38,774 INFO L225 Difference]: With dead ends: 12603 [2019-11-28 18:23:38,774 INFO L226 Difference]: Without dead ends: 12589 [2019-11-28 18:23:38,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-11-28 18:23:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-11-28 18:23:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-11-28 18:23:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-11-28 18:23:39,295 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-11-28 18:23:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,296 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-11-28 18:23:39,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-11-28 18:23:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:23:39,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:39,307 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-11-28 18:23:39,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656774078] [2019-11-28 18:23:39,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:39,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656774078] [2019-11-28 18:23:39,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:39,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:39,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985147743] [2019-11-28 18:23:39,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:39,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:39,422 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-11-28 18:23:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:39,686 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-11-28 18:23:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:39,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:23:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:39,735 INFO L225 Difference]: With dead ends: 13736 [2019-11-28 18:23:39,736 INFO L226 Difference]: Without dead ends: 13736 [2019-11-28 18:23:39,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-11-28 18:23:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-11-28 18:23:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-11-28 18:23:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-11-28 18:23:40,208 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-11-28 18:23:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,209 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-11-28 18:23:40,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-11-28 18:23:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:23:40,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:40,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-11-28 18:23:40,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709643424] [2019-11-28 18:23:40,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:40,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709643424] [2019-11-28 18:23:40,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:40,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:40,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245869414] [2019-11-28 18:23:40,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:40,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:40,303 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-11-28 18:23:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:40,378 INFO L93 Difference]: Finished difference Result 11576 states and 35711 transitions. [2019-11-28 18:23:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:40,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:23:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:40,412 INFO L225 Difference]: With dead ends: 11576 [2019-11-28 18:23:40,413 INFO L226 Difference]: Without dead ends: 11576 [2019-11-28 18:23:40,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11576 states. [2019-11-28 18:23:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11576 to 11496. [2019-11-28 18:23:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11496 states. [2019-11-28 18:23:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11496 states to 11496 states and 35479 transitions. [2019-11-28 18:23:40,925 INFO L78 Accepts]: Start accepts. Automaton has 11496 states and 35479 transitions. Word has length 16 [2019-11-28 18:23:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,925 INFO L462 AbstractCegarLoop]: Abstraction has 11496 states and 35479 transitions. [2019-11-28 18:23:40,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11496 states and 35479 transitions. [2019-11-28 18:23:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:23:40,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:40,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1184696536, now seen corresponding path program 1 times [2019-11-28 18:23:40,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487356881] [2019-11-28 18:23:40,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:41,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487356881] [2019-11-28 18:23:41,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:41,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010642655] [2019-11-28 18:23:41,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:41,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:41,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:41,018 INFO L87 Difference]: Start difference. First operand 11496 states and 35479 transitions. Second operand 3 states. [2019-11-28 18:23:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,117 INFO L93 Difference]: Finished difference Result 19925 states and 60894 transitions. [2019-11-28 18:23:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:41,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:23:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,171 INFO L225 Difference]: With dead ends: 19925 [2019-11-28 18:23:41,172 INFO L226 Difference]: Without dead ends: 17497 [2019-11-28 18:23:41,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17497 states. [2019-11-28 18:23:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17497 to 16697. [2019-11-28 18:23:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-11-28 18:23:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 51504 transitions. [2019-11-28 18:23:41,687 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 51504 transitions. Word has length 16 [2019-11-28 18:23:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,688 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 51504 transitions. [2019-11-28 18:23:41,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 51504 transitions. [2019-11-28 18:23:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:23:41,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:41,696 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-11-28 18:23:41,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755779436] [2019-11-28 18:23:41,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:41,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755779436] [2019-11-28 18:23:41,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:23:41,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909541041] [2019-11-28 18:23:41,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:41,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:41,756 INFO L87 Difference]: Start difference. First operand 16697 states and 51504 transitions. Second operand 4 states. [2019-11-28 18:23:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,793 INFO L93 Difference]: Finished difference Result 3027 states and 7631 transitions. [2019-11-28 18:23:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:23:41,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:23:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,798 INFO L225 Difference]: With dead ends: 3027 [2019-11-28 18:23:41,798 INFO L226 Difference]: Without dead ends: 2101 [2019-11-28 18:23:41,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-11-28 18:23:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2101. [2019-11-28 18:23:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-11-28 18:23:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4686 transitions. [2019-11-28 18:23:41,836 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4686 transitions. Word has length 17 [2019-11-28 18:23:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,837 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 4686 transitions. [2019-11-28 18:23:41,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4686 transitions. [2019-11-28 18:23:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:23:41,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:41,841 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-11-28 18:23:41,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108640740] [2019-11-28 18:23:41,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:41,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108640740] [2019-11-28 18:23:41,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:41,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651854299] [2019-11-28 18:23:41,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:41,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:41,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:41,999 INFO L87 Difference]: Start difference. First operand 2101 states and 4686 transitions. Second operand 6 states. [2019-11-28 18:23:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:42,627 INFO L93 Difference]: Finished difference Result 5510 states and 12155 transitions. [2019-11-28 18:23:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:42,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:23:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:42,640 INFO L225 Difference]: With dead ends: 5510 [2019-11-28 18:23:42,640 INFO L226 Difference]: Without dead ends: 5475 [2019-11-28 18:23:42,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-11-28 18:23:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 2768. [2019-11-28 18:23:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-11-28 18:23:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6308 transitions. [2019-11-28 18:23:42,721 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6308 transitions. Word has length 25 [2019-11-28 18:23:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:42,722 INFO L462 AbstractCegarLoop]: Abstraction has 2768 states and 6308 transitions. [2019-11-28 18:23:42,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6308 transitions. [2019-11-28 18:23:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:23:42,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:42,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:42,727 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:42,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-11-28 18:23:42,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:42,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135040824] [2019-11-28 18:23:42,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:42,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135040824] [2019-11-28 18:23:42,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:42,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:42,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052868100] [2019-11-28 18:23:42,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:42,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:42,911 INFO L87 Difference]: Start difference. First operand 2768 states and 6308 transitions. Second operand 6 states. [2019-11-28 18:23:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:43,504 INFO L93 Difference]: Finished difference Result 5148 states and 11236 transitions. [2019-11-28 18:23:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:43,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:23:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:43,514 INFO L225 Difference]: With dead ends: 5148 [2019-11-28 18:23:43,515 INFO L226 Difference]: Without dead ends: 5119 [2019-11-28 18:23:43,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-11-28 18:23:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 2810. [2019-11-28 18:23:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-11-28 18:23:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6417 transitions. [2019-11-28 18:23:43,699 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6417 transitions. Word has length 26 [2019-11-28 18:23:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:43,699 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6417 transitions. [2019-11-28 18:23:43,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6417 transitions. [2019-11-28 18:23:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:23:43,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:43,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:43,705 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:43,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-11-28 18:23:43,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:43,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097643344] [2019-11-28 18:23:43,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:43,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097643344] [2019-11-28 18:23:43,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:43,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:43,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095870680] [2019-11-28 18:23:43,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:23:43,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:23:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:43,783 INFO L87 Difference]: Start difference. First operand 2810 states and 6417 transitions. Second operand 5 states. [2019-11-28 18:23:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:43,823 INFO L93 Difference]: Finished difference Result 1471 states and 3338 transitions. [2019-11-28 18:23:43,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:43,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:23:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:43,826 INFO L225 Difference]: With dead ends: 1471 [2019-11-28 18:23:43,826 INFO L226 Difference]: Without dead ends: 1312 [2019-11-28 18:23:43,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-11-28 18:23:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 841. [2019-11-28 18:23:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-28 18:23:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1889 transitions. [2019-11-28 18:23:43,845 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1889 transitions. Word has length 28 [2019-11-28 18:23:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:43,845 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1889 transitions. [2019-11-28 18:23:43,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:23:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1889 transitions. [2019-11-28 18:23:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:23:43,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:43,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:43,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-11-28 18:23:43,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:43,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902213540] [2019-11-28 18:23:43,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902213540] [2019-11-28 18:23:43,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:43,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:43,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723595351] [2019-11-28 18:23:43,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:43,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:43,930 INFO L87 Difference]: Start difference. First operand 841 states and 1889 transitions. Second operand 3 states. [2019-11-28 18:23:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:44,007 INFO L93 Difference]: Finished difference Result 1065 states and 2362 transitions. [2019-11-28 18:23:44,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:44,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:23:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:44,010 INFO L225 Difference]: With dead ends: 1065 [2019-11-28 18:23:44,011 INFO L226 Difference]: Without dead ends: 1065 [2019-11-28 18:23:44,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-11-28 18:23:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 765. [2019-11-28 18:23:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-28 18:23:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1700 transitions. [2019-11-28 18:23:44,034 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1700 transitions. Word has length 52 [2019-11-28 18:23:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:44,035 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1700 transitions. [2019-11-28 18:23:44,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1700 transitions. [2019-11-28 18:23:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:44,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:44,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:44,039 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:44,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1774994823, now seen corresponding path program 1 times [2019-11-28 18:23:44,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:44,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175062540] [2019-11-28 18:23:44,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:23:44,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175062540] [2019-11-28 18:23:44,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:44,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:23:44,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622440965] [2019-11-28 18:23:44,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:23:44,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:44,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:23:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:44,254 INFO L87 Difference]: Start difference. First operand 765 states and 1700 transitions. Second operand 7 states. [2019-11-28 18:23:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:44,660 INFO L93 Difference]: Finished difference Result 3260 states and 7094 transitions. [2019-11-28 18:23:44,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:23:44,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:23:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:44,664 INFO L225 Difference]: With dead ends: 3260 [2019-11-28 18:23:44,664 INFO L226 Difference]: Without dead ends: 2226 [2019-11-28 18:23:44,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:23:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-11-28 18:23:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 888. [2019-11-28 18:23:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-28 18:23:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1964 transitions. [2019-11-28 18:23:44,688 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1964 transitions. Word has length 53 [2019-11-28 18:23:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:44,688 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1964 transitions. [2019-11-28 18:23:44,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:23:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1964 transitions. [2019-11-28 18:23:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:44,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:44,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:44,692 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 2 times [2019-11-28 18:23:44,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:44,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599529422] [2019-11-28 18:23:44,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:44,857 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:23:44,858 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:23:44,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:44,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:44,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-11-28 18:23:44,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-921144090 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-921144090 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-921144090 |P0Thread1of1ForFork0_#t~ite5_Out-921144090|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-921144090|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-921144090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-921144090} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-921144090|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-921144090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-921144090} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:44,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1090469922 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1090469922| |P1Thread1of1ForFork1_#t~ite14_Out-1090469922|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-1090469922| ~x$w_buff0~0_In-1090469922)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1090469922 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1090469922 256))) (= (mod ~x$w_buff0_used~0_In-1090469922 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-1090469922 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-1090469922| ~x$w_buff0~0_In-1090469922) (= |P1Thread1of1ForFork1_#t~ite15_Out-1090469922| |P1Thread1of1ForFork1_#t~ite14_Out-1090469922|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1090469922, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1090469922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1090469922, ~weak$$choice2~0=~weak$$choice2~0_In-1090469922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1090469922, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1090469922|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090469922} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1090469922, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1090469922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1090469922, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1090469922|, ~weak$$choice2~0=~weak$$choice2~0_In-1090469922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1090469922, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1090469922|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090469922} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:44,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1554842244 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1554842244 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1554842244 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1554842244 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1554842244|)) (and (= ~x$w_buff1_used~0_In1554842244 |P0Thread1of1ForFork0_#t~ite6_Out1554842244|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1554842244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1554842244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1554842244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1554842244} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1554842244|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1554842244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1554842244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1554842244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1554842244} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:44,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1224898192 256))) (.cse2 (= ~x$r_buff0_thd1~0_Out1224898192 ~x$r_buff0_thd1~0_In1224898192)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1224898192 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out1224898192) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1224898192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1224898192} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1224898192, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1224898192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1224898192} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:44,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1360131309 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1360131309 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1360131309 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1360131309 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1360131309| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1360131309| ~x$r_buff1_thd1~0_In-1360131309) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1360131309, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360131309, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1360131309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360131309} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1360131309, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1360131309|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360131309, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1360131309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360131309} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:44,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:44,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1543221920 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1543221920| |P1Thread1of1ForFork1_#t~ite17_Out1543221920|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1543221920 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In1543221920 256)) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In1543221920 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1543221920 256)))) .cse1 (= ~x$w_buff1~0_In1543221920 |P1Thread1of1ForFork1_#t~ite17_Out1543221920|)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1543221920| ~x$w_buff1~0_In1543221920) (= |P1Thread1of1ForFork1_#t~ite17_In1543221920| |P1Thread1of1ForFork1_#t~ite17_Out1543221920|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1543221920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1543221920, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1543221920, ~weak$$choice2~0=~weak$$choice2~0_In1543221920, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1543221920, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1543221920|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1543221920} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1543221920|, ~x$w_buff1~0=~x$w_buff1~0_In1543221920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1543221920, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1543221920, ~weak$$choice2~0=~weak$$choice2~0_In1543221920, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1543221920, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1543221920|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1543221920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:44,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In376235630 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In376235630 256)))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In376235630 256))) (= 0 (mod ~x$w_buff0_used~0_In376235630 256)) (and (= 0 (mod ~x$w_buff1_used~0_In376235630 256)) .cse0))) (= ~x$w_buff0_used~0_In376235630 |P1Thread1of1ForFork1_#t~ite20_Out376235630|) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out376235630| |P1Thread1of1ForFork1_#t~ite20_Out376235630|)) (and (= ~x$w_buff0_used~0_In376235630 |P1Thread1of1ForFork1_#t~ite21_Out376235630|) (= |P1Thread1of1ForFork1_#t~ite20_In376235630| |P1Thread1of1ForFork1_#t~ite20_Out376235630|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In376235630|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376235630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In376235630, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In376235630, ~weak$$choice2~0=~weak$$choice2~0_In376235630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In376235630} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out376235630|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376235630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In376235630, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out376235630|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In376235630, ~weak$$choice2~0=~weak$$choice2~0_In376235630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In376235630} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:44,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:44,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In69379160 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out69379160| ~x$r_buff1_thd2~0_In69379160) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In69379160| |P1Thread1of1ForFork1_#t~ite29_Out69379160|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In69379160 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In69379160 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In69379160 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In69379160 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out69379160| ~x$r_buff1_thd2~0_In69379160) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out69379160| |P1Thread1of1ForFork1_#t~ite29_Out69379160|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In69379160|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In69379160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In69379160, ~weak$$choice2~0=~weak$$choice2~0_In69379160, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In69379160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In69379160} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out69379160|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out69379160|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In69379160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In69379160, ~weak$$choice2~0=~weak$$choice2~0_In69379160, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In69379160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In69379160} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:44,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-799608502 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-799608502 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-799608502| ~x$w_buff1~0_In-799608502)) (and (= ~x~0_In-799608502 |P1Thread1of1ForFork1_#t~ite32_Out-799608502|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-799608502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-799608502, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-799608502, ~x~0=~x~0_In-799608502} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-799608502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-799608502, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-799608502, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-799608502|, ~x~0=~x~0_In-799608502} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:44,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In55900577 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In55900577 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out55900577|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In55900577 |P1Thread1of1ForFork1_#t~ite34_Out55900577|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In55900577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In55900577} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out55900577|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In55900577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In55900577} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:44,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-729189218 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-729189218 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-729189218 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-729189218 256)))) (or (and (= ~x$w_buff1_used~0_In-729189218 |P1Thread1of1ForFork1_#t~ite35_Out-729189218|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-729189218|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-729189218, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-729189218, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-729189218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729189218} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-729189218, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-729189218, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-729189218|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-729189218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729189218} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:44,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-586098804 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-586098804 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-586098804|)) (and (= ~x$r_buff0_thd2~0_In-586098804 |P1Thread1of1ForFork1_#t~ite36_Out-586098804|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586098804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586098804} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586098804, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-586098804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586098804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:44,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1827289825 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1827289825 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1827289825 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1827289825 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1827289825| ~x$r_buff1_thd2~0_In1827289825) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1827289825| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1827289825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1827289825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1827289825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827289825} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1827289825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1827289825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1827289825, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1827289825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827289825} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:44,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:44,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:44,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1709330982 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1709330982 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1709330982| ~x$w_buff1~0_In1709330982) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1709330982| ~x~0_In1709330982) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1709330982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1709330982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1709330982, ~x~0=~x~0_In1709330982} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1709330982|, ~x$w_buff1~0=~x$w_buff1~0_In1709330982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1709330982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1709330982, ~x~0=~x~0_In1709330982} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:44,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1348016931 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1348016931 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1348016931|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1348016931 |ULTIMATE.start_main_#t~ite42_Out1348016931|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1348016931, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1348016931} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1348016931, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1348016931|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1348016931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:44,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1723836123 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1723836123 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1723836123 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1723836123 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1723836123|)) (and (= ~x$w_buff1_used~0_In1723836123 |ULTIMATE.start_main_#t~ite43_Out1723836123|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1723836123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1723836123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1723836123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1723836123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1723836123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1723836123, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1723836123|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1723836123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1723836123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:44,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1217232303 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1217232303 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-1217232303 |ULTIMATE.start_main_#t~ite44_Out-1217232303|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1217232303|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1217232303, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217232303} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1217232303, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1217232303|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217232303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:44,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1773499523 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1773499523 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1773499523 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1773499523 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1773499523| ~x$r_buff1_thd0~0_In1773499523) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out1773499523| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1773499523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1773499523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1773499523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1773499523} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1773499523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1773499523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1773499523, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1773499523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1773499523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:44,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:23:44,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:23:44 BasicIcfg [2019-11-28 18:23:44,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:23:44,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:23:44,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:23:44,979 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:23:44,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:30" (3/4) ... [2019-11-28 18:23:44,985 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:23:44,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| 4)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24| 1)) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_18|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_24|) |v_ULTIMATE.start_main_~#t1715~0.offset_18| 0)) |v_#memory_int_13|) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_24|) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_24|)) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_24|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:44,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:44,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-11-28 18:23:44,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-921144090 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-921144090 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-921144090 |P0Thread1of1ForFork0_#t~ite5_Out-921144090|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-921144090|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-921144090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-921144090} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-921144090|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-921144090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-921144090} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:44,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1090469922 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1090469922| |P1Thread1of1ForFork1_#t~ite14_Out-1090469922|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-1090469922| ~x$w_buff0~0_In-1090469922)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1090469922 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1090469922 256))) (= (mod ~x$w_buff0_used~0_In-1090469922 256) 0) (and (= (mod ~x$r_buff1_thd2~0_In-1090469922 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-1090469922| ~x$w_buff0~0_In-1090469922) (= |P1Thread1of1ForFork1_#t~ite15_Out-1090469922| |P1Thread1of1ForFork1_#t~ite14_Out-1090469922|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1090469922, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1090469922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1090469922, ~weak$$choice2~0=~weak$$choice2~0_In-1090469922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1090469922, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1090469922|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090469922} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1090469922, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1090469922, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1090469922, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1090469922|, ~weak$$choice2~0=~weak$$choice2~0_In-1090469922, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1090469922, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1090469922|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1090469922} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:44,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1554842244 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1554842244 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1554842244 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1554842244 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1554842244|)) (and (= ~x$w_buff1_used~0_In1554842244 |P0Thread1of1ForFork0_#t~ite6_Out1554842244|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1554842244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1554842244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1554842244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1554842244} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1554842244|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1554842244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1554842244, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1554842244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1554842244} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:44,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1224898192 256))) (.cse2 (= ~x$r_buff0_thd1~0_Out1224898192 ~x$r_buff0_thd1~0_In1224898192)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1224898192 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out1224898192) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1224898192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1224898192} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1224898192, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1224898192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1224898192} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:44,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1360131309 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1360131309 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1360131309 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1360131309 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1360131309| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1360131309| ~x$r_buff1_thd1~0_In-1360131309) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1360131309, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360131309, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1360131309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360131309} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1360131309, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1360131309|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1360131309, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1360131309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360131309} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:44,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:44,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1543221920 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1543221920| |P1Thread1of1ForFork1_#t~ite17_Out1543221920|) (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1543221920 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In1543221920 256)) .cse0) (and (= 0 (mod ~x$w_buff1_used~0_In1543221920 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1543221920 256)))) .cse1 (= ~x$w_buff1~0_In1543221920 |P1Thread1of1ForFork1_#t~ite17_Out1543221920|)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1543221920| ~x$w_buff1~0_In1543221920) (= |P1Thread1of1ForFork1_#t~ite17_In1543221920| |P1Thread1of1ForFork1_#t~ite17_Out1543221920|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1543221920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1543221920, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1543221920, ~weak$$choice2~0=~weak$$choice2~0_In1543221920, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1543221920, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1543221920|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1543221920} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1543221920|, ~x$w_buff1~0=~x$w_buff1~0_In1543221920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1543221920, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1543221920, ~weak$$choice2~0=~weak$$choice2~0_In1543221920, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1543221920, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1543221920|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1543221920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:44,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In376235630 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In376235630 256)))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd2~0_In376235630 256))) (= 0 (mod ~x$w_buff0_used~0_In376235630 256)) (and (= 0 (mod ~x$w_buff1_used~0_In376235630 256)) .cse0))) (= ~x$w_buff0_used~0_In376235630 |P1Thread1of1ForFork1_#t~ite20_Out376235630|) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out376235630| |P1Thread1of1ForFork1_#t~ite20_Out376235630|)) (and (= ~x$w_buff0_used~0_In376235630 |P1Thread1of1ForFork1_#t~ite21_Out376235630|) (= |P1Thread1of1ForFork1_#t~ite20_In376235630| |P1Thread1of1ForFork1_#t~ite20_Out376235630|) (not .cse1)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In376235630|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376235630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In376235630, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In376235630, ~weak$$choice2~0=~weak$$choice2~0_In376235630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In376235630} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out376235630|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In376235630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In376235630, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out376235630|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In376235630, ~weak$$choice2~0=~weak$$choice2~0_In376235630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In376235630} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:44,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:44,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In69379160 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out69379160| ~x$r_buff1_thd2~0_In69379160) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In69379160| |P1Thread1of1ForFork1_#t~ite29_Out69379160|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In69379160 256)))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In69379160 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In69379160 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In69379160 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out69379160| ~x$r_buff1_thd2~0_In69379160) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out69379160| |P1Thread1of1ForFork1_#t~ite29_Out69379160|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In69379160|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In69379160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In69379160, ~weak$$choice2~0=~weak$$choice2~0_In69379160, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In69379160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In69379160} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out69379160|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out69379160|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In69379160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In69379160, ~weak$$choice2~0=~weak$$choice2~0_In69379160, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In69379160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In69379160} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:44,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-799608502 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-799608502 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-799608502| ~x$w_buff1~0_In-799608502)) (and (= ~x~0_In-799608502 |P1Thread1of1ForFork1_#t~ite32_Out-799608502|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-799608502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-799608502, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-799608502, ~x~0=~x~0_In-799608502} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-799608502, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-799608502, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-799608502, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-799608502|, ~x~0=~x~0_In-799608502} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:44,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In55900577 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In55900577 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out55900577|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In55900577 |P1Thread1of1ForFork1_#t~ite34_Out55900577|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In55900577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In55900577} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out55900577|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In55900577, ~x$w_buff0_used~0=~x$w_buff0_used~0_In55900577} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:44,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-729189218 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-729189218 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-729189218 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-729189218 256)))) (or (and (= ~x$w_buff1_used~0_In-729189218 |P1Thread1of1ForFork1_#t~ite35_Out-729189218|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-729189218|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-729189218, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-729189218, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-729189218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729189218} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-729189218, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-729189218, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-729189218|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-729189218, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-729189218} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:44,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-586098804 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-586098804 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-586098804|)) (and (= ~x$r_buff0_thd2~0_In-586098804 |P1Thread1of1ForFork1_#t~ite36_Out-586098804|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586098804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586098804} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586098804, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-586098804|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586098804} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:44,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1827289825 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1827289825 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1827289825 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1827289825 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1827289825| ~x$r_buff1_thd2~0_In1827289825) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1827289825| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1827289825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1827289825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1827289825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827289825} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1827289825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1827289825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1827289825, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1827289825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1827289825} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:44,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:44,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:44,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1709330982 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1709330982 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1709330982| ~x$w_buff1~0_In1709330982) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1709330982| ~x~0_In1709330982) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1709330982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1709330982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1709330982, ~x~0=~x~0_In1709330982} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1709330982|, ~x$w_buff1~0=~x$w_buff1~0_In1709330982, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1709330982, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1709330982, ~x~0=~x~0_In1709330982} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:44,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:44,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1348016931 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1348016931 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1348016931|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1348016931 |ULTIMATE.start_main_#t~ite42_Out1348016931|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1348016931, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1348016931} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1348016931, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1348016931|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1348016931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:45,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1723836123 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1723836123 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1723836123 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1723836123 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1723836123|)) (and (= ~x$w_buff1_used~0_In1723836123 |ULTIMATE.start_main_#t~ite43_Out1723836123|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1723836123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1723836123, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1723836123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1723836123} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1723836123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1723836123, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1723836123|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1723836123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1723836123} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:45,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1217232303 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1217232303 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-1217232303 |ULTIMATE.start_main_#t~ite44_Out-1217232303|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1217232303|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1217232303, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217232303} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1217232303, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1217232303|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217232303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:45,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1773499523 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1773499523 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1773499523 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1773499523 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1773499523| ~x$r_buff1_thd0~0_In1773499523) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out1773499523| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1773499523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1773499523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1773499523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1773499523} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1773499523, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1773499523, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1773499523, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1773499523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1773499523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:45,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:23:45,092 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:23:45,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:23:45,094 INFO L168 Benchmark]: Toolchain (without parser) took 16396.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:45,095 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:23:45,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:45,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:45,097 INFO L168 Benchmark]: Boogie Preprocessor took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:23:45,097 INFO L168 Benchmark]: RCFGBuilder took 842.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:45,098 INFO L168 Benchmark]: TraceAbstraction took 14583.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 355.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:45,099 INFO L168 Benchmark]: Witness Printer took 114.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:45,102 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 744.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 842.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14583.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 355.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. * Witness Printer took 114.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1574 SDtfs, 1736 SDslu, 2984 SDs, 0 SdLazy, 1265 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16697occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 10797 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 42934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...