./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_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/rfi003_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 600b3f8ed1ae6a83367c916dba179aeec96a795d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:12,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:12,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:12,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:12,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:12,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:12,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:12,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:12,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:12,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:12,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:12,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:12,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:12,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:12,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:12,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:12,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:12,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:12,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:12,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:12,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:12,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:12,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:12,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:12,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:12,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:12,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:12,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:12,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:12,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:12,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:12,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:12,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:12,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:12,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:12,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:12,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:12,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:12,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:12,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:12,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:12,448 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:22:12,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:12,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:12,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:12,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:12,474 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:12,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:12,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:12,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:12,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:12,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:12,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:12,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:12,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:12,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:12,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:12,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:12,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:12,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:12,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:12,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:12,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:12,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:12,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:12,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:12,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:12,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:12,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:12,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:12,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:12,482 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 -> 600b3f8ed1ae6a83367c916dba179aeec96a795d [2019-11-28 18:22:12,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:12,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:12,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:12,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:12,863 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:12,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt.i [2019-11-28 18:22:12,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4eac13d/4fbfcae12f174cda9a09e2f8e7d8a0e9/FLAGcaec5fee4 [2019-11-28 18:22:13,500 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:13,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_rmo.opt.i [2019-11-28 18:22:13,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4eac13d/4fbfcae12f174cda9a09e2f8e7d8a0e9/FLAGcaec5fee4 [2019-11-28 18:22:13,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4eac13d/4fbfcae12f174cda9a09e2f8e7d8a0e9 [2019-11-28 18:22:13,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:13,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:13,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:13,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:13,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:13,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13, skipping insertion in model container [2019-11-28 18:22:13,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:13,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:14,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:14,427 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:14,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:14,569 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:14,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14 WrapperNode [2019-11-28 18:22:14,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:14,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:14,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:14,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:14,581 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:22:14" (1/1) ... [2019-11-28 18:22:14,602 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:22:14" (1/1) ... [2019-11-28 18:22:14,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:14,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:14,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:14,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:14,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (1/1) ... [2019-11-28 18:22:14,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:14,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:14,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:14,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:14,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (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:22:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:14,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:14,759 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:22:15,515 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:15,515 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:15,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:15 BoogieIcfgContainer [2019-11-28 18:22:15,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:15,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:15,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:15,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:15,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:13" (1/3) ... [2019-11-28 18:22:15,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b32b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:15, skipping insertion in model container [2019-11-28 18:22:15,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:14" (2/3) ... [2019-11-28 18:22:15,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b32b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:15, skipping insertion in model container [2019-11-28 18:22:15,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:15" (3/3) ... [2019-11-28 18:22:15,525 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.opt.i [2019-11-28 18:22:15,535 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:15,536 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:15,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:15,545 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:15,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,580 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:15,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:15,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:15,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:15,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:15,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:15,656 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:15,656 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:15,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:15,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:15,682 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-11-28 18:22:15,684 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:15,762 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:15,762 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:15,778 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:15,797 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:15,841 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:15,841 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:15,851 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:15,867 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:15,868 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:20,341 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:22:20,477 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:22:20,516 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-11-28 18:22:20,517 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-11-28 18:22:20,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-11-28 18:22:21,013 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-11-28 18:22:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-11-28 18:22:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:21,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:21,031 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:21,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,041 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-11-28 18:22:21,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516619293] [2019-11-28 18:22:21,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,513 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:22:21,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516619293] [2019-11-28 18:22:21,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:21,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334363144] [2019-11-28 18:22:21,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:21,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:21,548 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-11-28 18:22:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:21,820 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-11-28 18:22:21,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:21,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:21,910 INFO L225 Difference]: With dead ends: 5990 [2019-11-28 18:22:21,915 INFO L226 Difference]: Without dead ends: 5642 [2019-11-28 18:22:21,919 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:22:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-11-28 18:22:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-11-28 18:22:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-11-28 18:22:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-11-28 18:22:22,289 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-11-28 18:22:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,289 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-11-28 18:22:22,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-11-28 18:22:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:22,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,296 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-11-28 18:22:22,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917476822] [2019-11-28 18:22:22,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,418 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:22:22,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917476822] [2019-11-28 18:22:22,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:22,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660360384] [2019-11-28 18:22:22,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:22,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,422 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 3 states. [2019-11-28 18:22:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,451 INFO L93 Difference]: Finished difference Result 1157 states and 2862 transitions. [2019-11-28 18:22:22,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:22:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,459 INFO L225 Difference]: With dead ends: 1157 [2019-11-28 18:22:22,460 INFO L226 Difference]: Without dead ends: 1157 [2019-11-28 18:22:22,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-11-28 18:22:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2019-11-28 18:22:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-11-28 18:22:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2862 transitions. [2019-11-28 18:22:22,501 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2862 transitions. Word has length 11 [2019-11-28 18:22:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,502 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 2862 transitions. [2019-11-28 18:22:22,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2862 transitions. [2019-11-28 18:22:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:22,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,510 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-11-28 18:22:22,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232902031] [2019-11-28 18:22:22,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,573 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:22:22,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232902031] [2019-11-28 18:22:22,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:22,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242676319] [2019-11-28 18:22:22,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:22,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,577 INFO L87 Difference]: Start difference. First operand 1157 states and 2862 transitions. Second operand 3 states. [2019-11-28 18:22:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,647 INFO L93 Difference]: Finished difference Result 1787 states and 4461 transitions. [2019-11-28 18:22:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,660 INFO L225 Difference]: With dead ends: 1787 [2019-11-28 18:22:22,660 INFO L226 Difference]: Without dead ends: 1787 [2019-11-28 18:22:22,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-11-28 18:22:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1271. [2019-11-28 18:22:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-11-28 18:22:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3173 transitions. [2019-11-28 18:22:22,711 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3173 transitions. Word has length 14 [2019-11-28 18:22:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,712 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 3173 transitions. [2019-11-28 18:22:22,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3173 transitions. [2019-11-28 18:22:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:22,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,714 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-11-28 18:22:22,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504283810] [2019-11-28 18:22:22,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,815 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:22:22,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504283810] [2019-11-28 18:22:22,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:22,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536975923] [2019-11-28 18:22:22,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:22,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:22,818 INFO L87 Difference]: Start difference. First operand 1271 states and 3173 transitions. Second operand 4 states. [2019-11-28 18:22:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,004 INFO L93 Difference]: Finished difference Result 1720 states and 4173 transitions. [2019-11-28 18:22:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:23,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,016 INFO L225 Difference]: With dead ends: 1720 [2019-11-28 18:22:23,017 INFO L226 Difference]: Without dead ends: 1720 [2019-11-28 18:22:23,017 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:22:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-11-28 18:22:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1552. [2019-11-28 18:22:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-11-28 18:22:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3797 transitions. [2019-11-28 18:22:23,066 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 3797 transitions. Word has length 14 [2019-11-28 18:22:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,066 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 3797 transitions. [2019-11-28 18:22:23,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 3797 transitions. [2019-11-28 18:22:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:23,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:23,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,069 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-11-28 18:22:23,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316912711] [2019-11-28 18:22:23,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,114 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:22:23,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316912711] [2019-11-28 18:22:23,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:23,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939551416] [2019-11-28 18:22:23,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:23,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,116 INFO L87 Difference]: Start difference. First operand 1552 states and 3797 transitions. Second operand 4 states. [2019-11-28 18:22:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,277 INFO L93 Difference]: Finished difference Result 1981 states and 4771 transitions. [2019-11-28 18:22:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:23,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,289 INFO L225 Difference]: With dead ends: 1981 [2019-11-28 18:22:23,290 INFO L226 Difference]: Without dead ends: 1981 [2019-11-28 18:22:23,290 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:22:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-11-28 18:22:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1581. [2019-11-28 18:22:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-11-28 18:22:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 3869 transitions. [2019-11-28 18:22:23,337 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 3869 transitions. Word has length 14 [2019-11-28 18:22:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,338 INFO L462 AbstractCegarLoop]: Abstraction has 1581 states and 3869 transitions. [2019-11-28 18:22:23,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 3869 transitions. [2019-11-28 18:22:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:23,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,341 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:22:23,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-11-28 18:22:23,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919908292] [2019-11-28 18:22:23,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,397 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:22:23,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919908292] [2019-11-28 18:22:23,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:23,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778509554] [2019-11-28 18:22:23,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:23,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,400 INFO L87 Difference]: Start difference. First operand 1581 states and 3869 transitions. Second operand 4 states. [2019-11-28 18:22:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,421 INFO L93 Difference]: Finished difference Result 702 states and 1600 transitions. [2019-11-28 18:22:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:23,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-28 18:22:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,426 INFO L225 Difference]: With dead ends: 702 [2019-11-28 18:22:23,426 INFO L226 Difference]: Without dead ends: 702 [2019-11-28 18:22:23,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-11-28 18:22:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 670. [2019-11-28 18:22:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-28 18:22:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1532 transitions. [2019-11-28 18:22:23,442 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1532 transitions. Word has length 26 [2019-11-28 18:22:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,443 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1532 transitions. [2019-11-28 18:22:23,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1532 transitions. [2019-11-28 18:22:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:22:23,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,446 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] [2019-11-28 18:22:23,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:23,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1430443939, now seen corresponding path program 1 times [2019-11-28 18:22:23,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016719656] [2019-11-28 18:22:23,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,552 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:22:23,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016719656] [2019-11-28 18:22:23,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:22:23,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162681538] [2019-11-28 18:22:23,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:23,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:23,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:23,555 INFO L87 Difference]: Start difference. First operand 670 states and 1532 transitions. Second operand 6 states. [2019-11-28 18:22:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,101 INFO L93 Difference]: Finished difference Result 1184 states and 2613 transitions. [2019-11-28 18:22:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:22:24,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:22:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,108 INFO L225 Difference]: With dead ends: 1184 [2019-11-28 18:22:24,109 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:22:24,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:22:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 911. [2019-11-28 18:22:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-11-28 18:22:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 2063 transitions. [2019-11-28 18:22:24,134 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 2063 transitions. Word has length 41 [2019-11-28 18:22:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,136 INFO L462 AbstractCegarLoop]: Abstraction has 911 states and 2063 transitions. [2019-11-28 18:22:24,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 2063 transitions. [2019-11-28 18:22:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:22:24,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,140 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] [2019-11-28 18:22:24,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -231336031, now seen corresponding path program 2 times [2019-11-28 18:22:24,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844189163] [2019-11-28 18:22:24,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,277 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:22:24,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844189163] [2019-11-28 18:22:24,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:24,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764658020] [2019-11-28 18:22:24,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:24,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:24,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:24,280 INFO L87 Difference]: Start difference. First operand 911 states and 2063 transitions. Second operand 4 states. [2019-11-28 18:22:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,301 INFO L93 Difference]: Finished difference Result 1565 states and 3564 transitions. [2019-11-28 18:22:24,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:24,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-28 18:22:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,306 INFO L225 Difference]: With dead ends: 1565 [2019-11-28 18:22:24,306 INFO L226 Difference]: Without dead ends: 682 [2019-11-28 18:22:24,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-28 18:22:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-11-28 18:22:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-11-28 18:22:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1549 transitions. [2019-11-28 18:22:24,323 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1549 transitions. Word has length 41 [2019-11-28 18:22:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,323 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1549 transitions. [2019-11-28 18:22:24,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1549 transitions. [2019-11-28 18:22:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:22:24,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,326 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] [2019-11-28 18:22:24,326 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1632906437, now seen corresponding path program 3 times [2019-11-28 18:22:24,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940466084] [2019-11-28 18:22:24,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,424 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:22:24,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940466084] [2019-11-28 18:22:24,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:24,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624088318] [2019-11-28 18:22:24,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:24,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:24,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:24,427 INFO L87 Difference]: Start difference. First operand 682 states and 1549 transitions. Second operand 3 states. [2019-11-28 18:22:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,442 INFO L93 Difference]: Finished difference Result 680 states and 1544 transitions. [2019-11-28 18:22:24,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:24,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:22:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,447 INFO L225 Difference]: With dead ends: 680 [2019-11-28 18:22:24,447 INFO L226 Difference]: Without dead ends: 680 [2019-11-28 18:22:24,448 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:22:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-28 18:22:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 597. [2019-11-28 18:22:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-28 18:22:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1377 transitions. [2019-11-28 18:22:24,465 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1377 transitions. Word has length 41 [2019-11-28 18:22:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,466 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1377 transitions. [2019-11-28 18:22:24,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1377 transitions. [2019-11-28 18:22:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:24,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,469 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] [2019-11-28 18:22:24,469 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1753934669, now seen corresponding path program 1 times [2019-11-28 18:22:24,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871170299] [2019-11-28 18:22:24,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,602 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:22:24,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871170299] [2019-11-28 18:22:24,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:22:24,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502743628] [2019-11-28 18:22:24,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:24,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:24,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:24,605 INFO L87 Difference]: Start difference. First operand 597 states and 1377 transitions. Second operand 6 states. [2019-11-28 18:22:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,857 INFO L93 Difference]: Finished difference Result 962 states and 2156 transitions. [2019-11-28 18:22:24,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:22:24,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:22:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,863 INFO L225 Difference]: With dead ends: 962 [2019-11-28 18:22:24,863 INFO L226 Difference]: Without dead ends: 660 [2019-11-28 18:22:24,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:22:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-11-28 18:22:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 618. [2019-11-28 18:22:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-28 18:22:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1405 transitions. [2019-11-28 18:22:24,880 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1405 transitions. Word has length 42 [2019-11-28 18:22:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,881 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 1405 transitions. [2019-11-28 18:22:24,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1405 transitions. [2019-11-28 18:22:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:24,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,887 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] [2019-11-28 18:22:24,887 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 2 times [2019-11-28 18:22:24,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152618267] [2019-11-28 18:22:24,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:25,056 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:25,056 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:25,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1643~0.base_35|) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t1643~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1643~0.base_35| 4)) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1643~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1643~0.base_35|) |v_ULTIMATE.start_main_~#t1643~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$mem_tmp~0_15 0) (= |v_ULTIMATE.start_main_~#t1643~0.offset_24| 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1643~0.base_35|)) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_~#t1644~0.offset=|v_ULTIMATE.start_main_~#t1644~0.offset_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1643~0.base=|v_ULTIMATE.start_main_~#t1643~0.base_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ULTIMATE.start_main_~#t1643~0.offset=|v_ULTIMATE.start_main_~#t1643~0.offset_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1644~0.base=|v_ULTIMATE.start_main_~#t1644~0.base_35|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1644~0.offset, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1643~0.base, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1643~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1644~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:25,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1644~0.base_10| 0)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1644~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1644~0.base_10|) (= |v_ULTIMATE.start_main_~#t1644~0.offset_9| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1644~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1644~0.base_10|) |v_ULTIMATE.start_main_~#t1644~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1644~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1644~0.base_10| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1644~0.base=|v_ULTIMATE.start_main_~#t1644~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1644~0.offset=|v_ULTIMATE.start_main_~#t1644~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1644~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1644~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:22:25,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out631011897) (= ~y~0_Out631011897 1) (= ~y~0_Out631011897 ~__unbuffered_p1_EBX~0_Out631011897) (= ~x$r_buff1_thd0~0_Out631011897 ~x$r_buff0_thd0~0_In631011897) (= ~x$r_buff0_thd1~0_In631011897 ~x$r_buff1_thd1~0_Out631011897) (= ~__unbuffered_p1_EAX~0_Out631011897 ~y~0_Out631011897) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In631011897 0)) (= ~x$r_buff0_thd2~0_In631011897 ~x$r_buff1_thd2~0_Out631011897)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In631011897, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In631011897, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In631011897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In631011897} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In631011897, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In631011897, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out631011897, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In631011897, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out631011897, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out631011897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out631011897, ~y~0=~y~0_Out631011897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out631011897, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out631011897} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:25,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:22:25,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1800033672 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite24_Out-1800033672| ~x$r_buff1_thd1~0_In-1800033672) (= |P0Thread1of1ForFork1_#t~ite23_In-1800033672| |P0Thread1of1ForFork1_#t~ite23_Out-1800033672|) (= |P0Thread1of1ForFork1_#t~ite22_In-1800033672| |P0Thread1of1ForFork1_#t~ite22_Out-1800033672|)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In-1800033672 256) 0)))) (and .cse0 (not (= (mod ~x$w_buff0_used~0_In-1800033672 256) 0)) (= |P0Thread1of1ForFork1_#t~ite23_Out-1800033672| |P0Thread1of1ForFork1_#t~ite22_Out-1800033672|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out-1800033672|) (or (not (= 0 (mod ~x$w_buff1_used~0_In-1800033672 256))) .cse1) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In-1800033672 256) 0))) (= |P0Thread1of1ForFork1_#t~ite24_Out-1800033672| |P0Thread1of1ForFork1_#t~ite23_Out-1800033672|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1800033672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1800033672, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1800033672, ~weak$$choice2~0=~weak$$choice2~0_In-1800033672, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-1800033672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1800033672, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-1800033672|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1800033672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1800033672, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1800033672, ~weak$$choice2~0=~weak$$choice2~0_In-1800033672, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-1800033672|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-1800033672|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-1800033672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1800033672} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:25,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:25,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In924670397 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In924670397 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out924670397|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In924670397 |P1Thread1of1ForFork0_#t~ite28_Out924670397|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In924670397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924670397} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In924670397, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out924670397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924670397} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:25,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1960645331 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1960645331 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1960645331 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1960645331 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out1960645331| ~x$w_buff1_used~0_In1960645331)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out1960645331| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1960645331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1960645331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1960645331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960645331} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1960645331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1960645331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1960645331, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1960645331|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960645331} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:25,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-521311654 256))) (.cse0 (= ~x$r_buff0_thd2~0_Out-521311654 ~x$r_buff0_thd2~0_In-521311654)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-521311654 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= ~x$r_buff0_thd2~0_Out-521311654 0)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-521311654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-521311654} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-521311654|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-521311654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-521311654} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:25,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In860889390 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In860889390 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In860889390 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In860889390 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out860889390| ~x$r_buff1_thd2~0_In860889390)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out860889390| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In860889390, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860889390, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860889390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860889390} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out860889390|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860889390, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860889390, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860889390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860889390} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:25,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:25,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:25,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-348650850 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-348650850 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-348650850 |ULTIMATE.start_main_#t~ite34_Out-348650850|)) (and (= ~x~0_In-348650850 |ULTIMATE.start_main_#t~ite34_Out-348650850|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-348650850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-348650850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-348650850, ~x~0=~x~0_In-348650850} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-348650850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-348650850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-348650850, ~x~0=~x~0_In-348650850, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-348650850|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:25,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:25,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In655850151 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In655850151 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out655850151| ~x$w_buff0_used~0_In655850151)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out655850151| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In655850151, ~x$w_buff0_used~0=~x$w_buff0_used~0_In655850151} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In655850151, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out655850151|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In655850151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:25,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In282763843 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In282763843 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In282763843 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In282763843 256)))) (or (and (= ~x$w_buff1_used~0_In282763843 |ULTIMATE.start_main_#t~ite37_Out282763843|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out282763843| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In282763843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In282763843, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In282763843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In282763843} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In282763843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In282763843, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out282763843|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In282763843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In282763843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:25,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1492122495 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1492122495 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In1492122495 |ULTIMATE.start_main_#t~ite38_Out1492122495|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1492122495| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1492122495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1492122495} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1492122495, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1492122495|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1492122495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:25,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In504357271 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In504357271 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In504357271 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In504357271 256)))) (or (and (= ~x$r_buff1_thd0~0_In504357271 |ULTIMATE.start_main_#t~ite39_Out504357271|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out504357271|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In504357271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In504357271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In504357271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In504357271} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In504357271, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out504357271|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In504357271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In504357271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In504357271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:25,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:25,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:25 BasicIcfg [2019-11-28 18:22:25,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:25,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:25,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:25,169 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:25,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:15" (3/4) ... [2019-11-28 18:22:25,172 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:25,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1643~0.base_35|) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t1643~0.base_35| 1) |v_#valid_59|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1643~0.base_35| 4)) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1643~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1643~0.base_35|) |v_ULTIMATE.start_main_~#t1643~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$mem_tmp~0_15 0) (= |v_ULTIMATE.start_main_~#t1643~0.offset_24| 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1643~0.base_35|)) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_~#t1644~0.offset=|v_ULTIMATE.start_main_~#t1644~0.offset_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1643~0.base=|v_ULTIMATE.start_main_~#t1643~0.base_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ULTIMATE.start_main_~#t1643~0.offset=|v_ULTIMATE.start_main_~#t1643~0.offset_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ULTIMATE.start_main_~#t1644~0.base=|v_ULTIMATE.start_main_~#t1644~0.base_35|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1644~0.offset, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1643~0.base, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1643~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1644~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:25,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1644~0.base_10| 0)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1644~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1644~0.base_10|) (= |v_ULTIMATE.start_main_~#t1644~0.offset_9| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1644~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1644~0.base_10|) |v_ULTIMATE.start_main_~#t1644~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1644~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1644~0.base_10| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1644~0.base=|v_ULTIMATE.start_main_~#t1644~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1644~0.offset=|v_ULTIMATE.start_main_~#t1644~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1644~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1644~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:22:25,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= 1 ~x$r_buff0_thd2~0_Out631011897) (= ~y~0_Out631011897 1) (= ~y~0_Out631011897 ~__unbuffered_p1_EBX~0_Out631011897) (= ~x$r_buff1_thd0~0_Out631011897 ~x$r_buff0_thd0~0_In631011897) (= ~x$r_buff0_thd1~0_In631011897 ~x$r_buff1_thd1~0_Out631011897) (= ~__unbuffered_p1_EAX~0_Out631011897 ~y~0_Out631011897) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In631011897 0)) (= ~x$r_buff0_thd2~0_In631011897 ~x$r_buff1_thd2~0_Out631011897)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In631011897, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In631011897, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In631011897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In631011897} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In631011897, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In631011897, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out631011897, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In631011897, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out631011897, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out631011897, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out631011897, ~y~0=~y~0_Out631011897, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out631011897, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out631011897} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:25,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:22:25,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1800033672 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite24_Out-1800033672| ~x$r_buff1_thd1~0_In-1800033672) (= |P0Thread1of1ForFork1_#t~ite23_In-1800033672| |P0Thread1of1ForFork1_#t~ite23_Out-1800033672|) (= |P0Thread1of1ForFork1_#t~ite22_In-1800033672| |P0Thread1of1ForFork1_#t~ite22_Out-1800033672|)) (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In-1800033672 256) 0)))) (and .cse0 (not (= (mod ~x$w_buff0_used~0_In-1800033672 256) 0)) (= |P0Thread1of1ForFork1_#t~ite23_Out-1800033672| |P0Thread1of1ForFork1_#t~ite22_Out-1800033672|) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out-1800033672|) (or (not (= 0 (mod ~x$w_buff1_used~0_In-1800033672 256))) .cse1) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In-1800033672 256) 0))) (= |P0Thread1of1ForFork1_#t~ite24_Out-1800033672| |P0Thread1of1ForFork1_#t~ite23_Out-1800033672|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1800033672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1800033672, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1800033672, ~weak$$choice2~0=~weak$$choice2~0_In-1800033672, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-1800033672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1800033672, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-1800033672|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1800033672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1800033672, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1800033672, ~weak$$choice2~0=~weak$$choice2~0_In-1800033672, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-1800033672|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-1800033672|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-1800033672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1800033672} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:25,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:25,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In924670397 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In924670397 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out924670397|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In924670397 |P1Thread1of1ForFork0_#t~ite28_Out924670397|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In924670397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924670397} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In924670397, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out924670397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924670397} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:25,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1960645331 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1960645331 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1960645331 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1960645331 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out1960645331| ~x$w_buff1_used~0_In1960645331)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out1960645331| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1960645331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1960645331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1960645331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960645331} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1960645331, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1960645331, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1960645331, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1960645331|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1960645331} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:25,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-521311654 256))) (.cse0 (= ~x$r_buff0_thd2~0_Out-521311654 ~x$r_buff0_thd2~0_In-521311654)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-521311654 256)))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse1) (= ~x$r_buff0_thd2~0_Out-521311654 0)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-521311654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-521311654} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-521311654|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-521311654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-521311654} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:25,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In860889390 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In860889390 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In860889390 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In860889390 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out860889390| ~x$r_buff1_thd2~0_In860889390)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out860889390| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In860889390, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860889390, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860889390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860889390} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out860889390|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860889390, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In860889390, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In860889390, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860889390} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:25,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:25,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:25,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-348650850 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-348650850 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-348650850 |ULTIMATE.start_main_#t~ite34_Out-348650850|)) (and (= ~x~0_In-348650850 |ULTIMATE.start_main_#t~ite34_Out-348650850|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-348650850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-348650850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-348650850, ~x~0=~x~0_In-348650850} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-348650850, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-348650850, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-348650850, ~x~0=~x~0_In-348650850, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-348650850|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:25,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:25,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In655850151 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In655850151 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out655850151| ~x$w_buff0_used~0_In655850151)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out655850151| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In655850151, ~x$w_buff0_used~0=~x$w_buff0_used~0_In655850151} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In655850151, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out655850151|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In655850151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:25,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In282763843 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In282763843 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In282763843 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In282763843 256)))) (or (and (= ~x$w_buff1_used~0_In282763843 |ULTIMATE.start_main_#t~ite37_Out282763843|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out282763843| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In282763843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In282763843, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In282763843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In282763843} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In282763843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In282763843, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out282763843|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In282763843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In282763843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:25,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1492122495 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1492122495 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In1492122495 |ULTIMATE.start_main_#t~ite38_Out1492122495|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1492122495| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1492122495, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1492122495} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1492122495, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1492122495|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1492122495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:25,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In504357271 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In504357271 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In504357271 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In504357271 256)))) (or (and (= ~x$r_buff1_thd0~0_In504357271 |ULTIMATE.start_main_#t~ite39_Out504357271|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out504357271|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In504357271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In504357271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In504357271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In504357271} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In504357271, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out504357271|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In504357271, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In504357271, ~x$w_buff0_used~0=~x$w_buff0_used~0_In504357271} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:25,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:25,288 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:25,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:25,291 INFO L168 Benchmark]: Toolchain (without parser) took 11527.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -209.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:25,291 INFO L168 Benchmark]: CDTParser took 0.29 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:22:25,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:25,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:25,295 INFO L168 Benchmark]: Boogie Preprocessor took 60.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:25,296 INFO L168 Benchmark]: RCFGBuilder took 821.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:25,297 INFO L168 Benchmark]: TraceAbstraction took 9650.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -172.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:25,299 INFO L168 Benchmark]: Witness Printer took 119.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:25,301 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.29 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 806.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 821.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9650.59 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -172.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Witness Printer took 119.56 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1643, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L802] FCALL, FORK 0 pthread_create(&t1644, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L777] EXPR 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 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, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 941 SDtfs, 795 SDslu, 1384 SDs, 0 SdLazy, 768 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6150occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 36359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...