./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6a1879d2537c7330f7d666c3922597c85bb8028 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:13:43,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:13:43,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:13:43,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:13:43,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:13:43,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:13:43,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:13:43,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:13:43,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:13:43,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:13:43,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:13:43,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:13:43,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:13:43,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:13:43,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:13:43,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:13:43,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:13:43,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:13:43,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:13:43,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:13:43,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:13:43,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:13:43,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:13:43,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:13:43,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:13:43,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:13:43,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:13:43,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:13:43,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:13:43,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:13:43,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:13:43,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:13:43,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:13:43,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:13:43,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:13:43,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:13:43,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:13:43,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:13:43,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:13:43,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:13:43,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:13:43,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:13:43,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:13:43,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:13:43,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:13:43,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:13:43,482 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:13:43,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:13:43,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:13:43,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:13:43,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:13:43,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:13:43,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:13:43,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:13:43,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:13:43,487 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:13:43,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:13:43,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:13:43,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:13:43,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:13:43,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:13:43,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:13:43,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:13:43,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:13:43,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:13:43,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:13:43,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:13:43,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:13:43,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:13:43,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:13:43,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:13:43,492 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 -> f6a1879d2537c7330f7d666c3922597c85bb8028 [2019-11-28 18:13:43,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:13:43,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:13:43,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:13:43,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:13:43,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:13:43,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i [2019-11-28 18:13:43,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853afb43c/14a4fd0e8276419c9452ad35a19fdfe7/FLAG53208e9b3 [2019-11-28 18:13:44,516 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:13:44,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i [2019-11-28 18:13:44,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853afb43c/14a4fd0e8276419c9452ad35a19fdfe7/FLAG53208e9b3 [2019-11-28 18:13:44,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853afb43c/14a4fd0e8276419c9452ad35a19fdfe7 [2019-11-28 18:13:44,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:13:44,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:13:44,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:13:44,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:13:44,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:13:44,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:13:44" (1/1) ... [2019-11-28 18:13:44,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ebd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:44, skipping insertion in model container [2019-11-28 18:13:44,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:13:44" (1/1) ... [2019-11-28 18:13:44,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:13:44,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:13:45,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:13:45,422 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:13:45,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:13:45,581 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:13:45,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45 WrapperNode [2019-11-28 18:13:45,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:13:45,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:13:45,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:13:45,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:13:45,592 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:13:45" (1/1) ... [2019-11-28 18:13:45,613 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:13:45" (1/1) ... [2019-11-28 18:13:45,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:13:45,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:13:45,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:13:45,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:13:45,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (1/1) ... [2019-11-28 18:13:45,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:13:45,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:13:45,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:13:45,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:13:45,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (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:13:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:13:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:13:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:13:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:13:45,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:13:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:13:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:13:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:13:45,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:13:45,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:13:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:13:45,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:13:45,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:13:45,774 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:13:46,473 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:13:46,473 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:13:46,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:13:46 BoogieIcfgContainer [2019-11-28 18:13:46,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:13:46,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:13:46,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:13:46,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:13:46,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:13:44" (1/3) ... [2019-11-28 18:13:46,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1520ae68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:13:46, skipping insertion in model container [2019-11-28 18:13:46,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:13:45" (2/3) ... [2019-11-28 18:13:46,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1520ae68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:13:46, skipping insertion in model container [2019-11-28 18:13:46,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:13:46" (3/3) ... [2019-11-28 18:13:46,488 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2019-11-28 18:13:46,499 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:13:46,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:13:46,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:13:46,509 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:13:46,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,548 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,552 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,583 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,584 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,584 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:13:46,611 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:13:46,628 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:13:46,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:13:46,629 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:13:46,629 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:13:46,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:13:46,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:13:46,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:13:46,630 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:13:46,649 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-11-28 18:13:46,651 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-11-28 18:13:46,767 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-11-28 18:13:46,768 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:13:46,789 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:13:46,812 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-11-28 18:13:46,870 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-11-28 18:13:46,870 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:13:46,877 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:13:46,895 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:13:46,897 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:13:51,299 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-28 18:13:51,450 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-28 18:13:51,496 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-11-28 18:13:51,497 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-11-28 18:13:51,500 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-11-28 18:13:52,835 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-11-28 18:13:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-11-28 18:13:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:13:52,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:52,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:52,850 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:52,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-11-28 18:13:52,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:52,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987897689] [2019-11-28 18:13:52,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:53,246 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:13:53,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987897689] [2019-11-28 18:13:53,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:53,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:13:53,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316798395] [2019-11-28 18:13:53,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:53,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:53,277 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-11-28 18:13:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:53,650 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-11-28 18:13:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:53,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:13:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:53,835 INFO L225 Difference]: With dead ends: 13322 [2019-11-28 18:13:53,835 INFO L226 Difference]: Without dead ends: 12542 [2019-11-28 18:13:53,837 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:13:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-11-28 18:13:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-11-28 18:13:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-11-28 18:13:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-11-28 18:13:54,800 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-11-28 18:13:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:54,802 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-11-28 18:13:54,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-11-28 18:13:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:13:54,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:54,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:54,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-11-28 18:13:54,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:54,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191563597] [2019-11-28 18:13:54,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:54,915 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:13:54,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191563597] [2019-11-28 18:13:54,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:54,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:13:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179819915] [2019-11-28 18:13:54,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:13:54,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:54,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:13:54,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:13:54,920 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 4 states. [2019-11-28 18:13:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:55,606 INFO L93 Difference]: Finished difference Result 19054 states and 69906 transitions. [2019-11-28 18:13:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:13:55,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:13:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:55,757 INFO L225 Difference]: With dead ends: 19054 [2019-11-28 18:13:55,759 INFO L226 Difference]: Without dead ends: 19022 [2019-11-28 18:13:55,760 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:13:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2019-11-28 18:13:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 17202. [2019-11-28 18:13:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17202 states. [2019-11-28 18:13:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17202 states to 17202 states and 63964 transitions. [2019-11-28 18:13:56,706 INFO L78 Accepts]: Start accepts. Automaton has 17202 states and 63964 transitions. Word has length 13 [2019-11-28 18:13:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:56,706 INFO L462 AbstractCegarLoop]: Abstraction has 17202 states and 63964 transitions. [2019-11-28 18:13:56,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:13:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 17202 states and 63964 transitions. [2019-11-28 18:13:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:13:56,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:56,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:56,725 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:56,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-11-28 18:13:56,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:56,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631997457] [2019-11-28 18:13:56,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:56,857 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:13:56,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631997457] [2019-11-28 18:13:56,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:56,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:13:56,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170966457] [2019-11-28 18:13:56,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:13:56,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:56,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:13:56,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:13:56,859 INFO L87 Difference]: Start difference. First operand 17202 states and 63964 transitions. Second operand 4 states. [2019-11-28 18:13:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:57,212 INFO L93 Difference]: Finished difference Result 21830 states and 80562 transitions. [2019-11-28 18:13:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:13:57,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:13:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:57,656 INFO L225 Difference]: With dead ends: 21830 [2019-11-28 18:13:57,657 INFO L226 Difference]: Without dead ends: 21804 [2019-11-28 18:13:57,657 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:13:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21804 states. [2019-11-28 18:13:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21804 to 18792. [2019-11-28 18:13:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-11-28 18:13:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 69925 transitions. [2019-11-28 18:13:58,425 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 69925 transitions. Word has length 16 [2019-11-28 18:13:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:58,426 INFO L462 AbstractCegarLoop]: Abstraction has 18792 states and 69925 transitions. [2019-11-28 18:13:58,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:13:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 69925 transitions. [2019-11-28 18:13:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:13:58,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:58,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:58,436 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:58,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1486252895, now seen corresponding path program 1 times [2019-11-28 18:13:58,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:58,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382424071] [2019-11-28 18:13:58,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:58,492 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:13:58,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382424071] [2019-11-28 18:13:58,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:58,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:13:58,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477667723] [2019-11-28 18:13:58,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:58,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:58,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:58,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:58,495 INFO L87 Difference]: Start difference. First operand 18792 states and 69925 transitions. Second operand 3 states. [2019-11-28 18:13:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:58,628 INFO L93 Difference]: Finished difference Result 17806 states and 65342 transitions. [2019-11-28 18:13:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:58,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:13:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:13:58,712 INFO L225 Difference]: With dead ends: 17806 [2019-11-28 18:13:58,713 INFO L226 Difference]: Without dead ends: 17806 [2019-11-28 18:13:58,713 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:13:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17806 states. [2019-11-28 18:13:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17806 to 17542. [2019-11-28 18:13:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17542 states. [2019-11-28 18:13:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17542 states to 17542 states and 64442 transitions. [2019-11-28 18:13:59,357 INFO L78 Accepts]: Start accepts. Automaton has 17542 states and 64442 transitions. Word has length 18 [2019-11-28 18:13:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:13:59,358 INFO L462 AbstractCegarLoop]: Abstraction has 17542 states and 64442 transitions. [2019-11-28 18:13:59,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:13:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17542 states and 64442 transitions. [2019-11-28 18:13:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:13:59,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:13:59,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:13:59,366 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:13:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:13:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1446671698, now seen corresponding path program 1 times [2019-11-28 18:13:59,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:13:59,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767903312] [2019-11-28 18:13:59,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:13:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:13:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:13:59,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767903312] [2019-11-28 18:13:59,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:13:59,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:13:59,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541903186] [2019-11-28 18:13:59,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:13:59,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:13:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:13:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:13:59,488 INFO L87 Difference]: Start difference. First operand 17542 states and 64442 transitions. Second operand 3 states. [2019-11-28 18:13:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:13:59,971 INFO L93 Difference]: Finished difference Result 26307 states and 91521 transitions. [2019-11-28 18:13:59,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:13:59,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:13:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:00,059 INFO L225 Difference]: With dead ends: 26307 [2019-11-28 18:14:00,060 INFO L226 Difference]: Without dead ends: 25675 [2019-11-28 18:14:00,060 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:14:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25675 states. [2019-11-28 18:14:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25675 to 24859. [2019-11-28 18:14:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24859 states. [2019-11-28 18:14:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24859 states to 24859 states and 87229 transitions. [2019-11-28 18:14:01,053 INFO L78 Accepts]: Start accepts. Automaton has 24859 states and 87229 transitions. Word has length 18 [2019-11-28 18:14:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:01,054 INFO L462 AbstractCegarLoop]: Abstraction has 24859 states and 87229 transitions. [2019-11-28 18:14:01,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 24859 states and 87229 transitions. [2019-11-28 18:14:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:14:01,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:01,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:01,066 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash -481288137, now seen corresponding path program 1 times [2019-11-28 18:14:01,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:01,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280443828] [2019-11-28 18:14:01,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:01,107 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:14:01,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280443828] [2019-11-28 18:14:01,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:01,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:01,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921882625] [2019-11-28 18:14:01,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:01,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:01,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:01,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:01,110 INFO L87 Difference]: Start difference. First operand 24859 states and 87229 transitions. Second operand 3 states. [2019-11-28 18:14:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:01,203 INFO L93 Difference]: Finished difference Result 15981 states and 51224 transitions. [2019-11-28 18:14:01,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:01,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:14:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:01,247 INFO L225 Difference]: With dead ends: 15981 [2019-11-28 18:14:01,247 INFO L226 Difference]: Without dead ends: 15981 [2019-11-28 18:14:01,248 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:14:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15981 states. [2019-11-28 18:14:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15981 to 15981. [2019-11-28 18:14:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15981 states. [2019-11-28 18:14:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15981 states to 15981 states and 51224 transitions. [2019-11-28 18:14:02,129 INFO L78 Accepts]: Start accepts. Automaton has 15981 states and 51224 transitions. Word has length 19 [2019-11-28 18:14:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:02,130 INFO L462 AbstractCegarLoop]: Abstraction has 15981 states and 51224 transitions. [2019-11-28 18:14:02,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 15981 states and 51224 transitions. [2019-11-28 18:14:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:14:02,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:02,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] [2019-11-28 18:14:02,140 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:02,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:02,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1008355334, now seen corresponding path program 1 times [2019-11-28 18:14:02,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:02,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602362506] [2019-11-28 18:14:02,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:02,218 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:14:02,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602362506] [2019-11-28 18:14:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:14:02,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056579969] [2019-11-28 18:14:02,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:02,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:02,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:02,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:02,221 INFO L87 Difference]: Start difference. First operand 15981 states and 51224 transitions. Second operand 3 states. [2019-11-28 18:14:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:02,302 INFO L93 Difference]: Finished difference Result 15862 states and 50836 transitions. [2019-11-28 18:14:02,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:02,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 18:14:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:02,345 INFO L225 Difference]: With dead ends: 15862 [2019-11-28 18:14:02,345 INFO L226 Difference]: Without dead ends: 15862 [2019-11-28 18:14:02,346 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:14:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15862 states. [2019-11-28 18:14:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15862 to 14778. [2019-11-28 18:14:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14778 states. [2019-11-28 18:14:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14778 states to 14778 states and 47403 transitions. [2019-11-28 18:14:02,732 INFO L78 Accepts]: Start accepts. Automaton has 14778 states and 47403 transitions. Word has length 20 [2019-11-28 18:14:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:02,733 INFO L462 AbstractCegarLoop]: Abstraction has 14778 states and 47403 transitions. [2019-11-28 18:14:02,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14778 states and 47403 transitions. [2019-11-28 18:14:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:02,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:02,743 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] [2019-11-28 18:14:02,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash 65526288, now seen corresponding path program 1 times [2019-11-28 18:14:02,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:02,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814046384] [2019-11-28 18:14:02,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:02,928 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:14:02,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814046384] [2019-11-28 18:14:02,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:02,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:02,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868084386] [2019-11-28 18:14:02,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:02,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:02,932 INFO L87 Difference]: Start difference. First operand 14778 states and 47403 transitions. Second operand 6 states. [2019-11-28 18:14:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:03,912 INFO L93 Difference]: Finished difference Result 29394 states and 95720 transitions. [2019-11-28 18:14:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:14:03,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 18:14:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:03,982 INFO L225 Difference]: With dead ends: 29394 [2019-11-28 18:14:03,982 INFO L226 Difference]: Without dead ends: 28446 [2019-11-28 18:14:03,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:14:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28446 states. [2019-11-28 18:14:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28446 to 15002. [2019-11-28 18:14:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15002 states. [2019-11-28 18:14:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15002 states to 15002 states and 48116 transitions. [2019-11-28 18:14:04,506 INFO L78 Accepts]: Start accepts. Automaton has 15002 states and 48116 transitions. Word has length 21 [2019-11-28 18:14:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:04,507 INFO L462 AbstractCegarLoop]: Abstraction has 15002 states and 48116 transitions. [2019-11-28 18:14:04,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 15002 states and 48116 transitions. [2019-11-28 18:14:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:04,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:04,523 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] [2019-11-28 18:14:04,523 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2119612684, now seen corresponding path program 2 times [2019-11-28 18:14:04,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:04,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934438969] [2019-11-28 18:14:04,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:04,564 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:14:04,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934438969] [2019-11-28 18:14:04,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:04,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:04,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488568822] [2019-11-28 18:14:04,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:04,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:04,566 INFO L87 Difference]: Start difference. First operand 15002 states and 48116 transitions. Second operand 3 states. [2019-11-28 18:14:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:04,690 INFO L93 Difference]: Finished difference Result 26482 states and 85030 transitions. [2019-11-28 18:14:04,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:04,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 18:14:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:04,715 INFO L225 Difference]: With dead ends: 26482 [2019-11-28 18:14:04,715 INFO L226 Difference]: Without dead ends: 14342 [2019-11-28 18:14:04,716 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:14:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14342 states. [2019-11-28 18:14:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14342 to 13966. [2019-11-28 18:14:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13966 states. [2019-11-28 18:14:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13966 states to 13966 states and 43767 transitions. [2019-11-28 18:14:05,037 INFO L78 Accepts]: Start accepts. Automaton has 13966 states and 43767 transitions. Word has length 21 [2019-11-28 18:14:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:05,037 INFO L462 AbstractCegarLoop]: Abstraction has 13966 states and 43767 transitions. [2019-11-28 18:14:05,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 13966 states and 43767 transitions. [2019-11-28 18:14:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:14:05,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:05,050 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] [2019-11-28 18:14:05,050 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:05,050 INFO L82 PathProgramCache]: Analyzing trace with hash -693081367, now seen corresponding path program 1 times [2019-11-28 18:14:05,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:05,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474378112] [2019-11-28 18:14:05,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:05,101 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:14:05,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474378112] [2019-11-28 18:14:05,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:05,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:05,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833777021] [2019-11-28 18:14:05,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:05,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:05,104 INFO L87 Difference]: Start difference. First operand 13966 states and 43767 transitions. Second operand 4 states. [2019-11-28 18:14:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:05,136 INFO L93 Difference]: Finished difference Result 2600 states and 6184 transitions. [2019-11-28 18:14:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:05,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-28 18:14:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:05,141 INFO L225 Difference]: With dead ends: 2600 [2019-11-28 18:14:05,141 INFO L226 Difference]: Without dead ends: 2600 [2019-11-28 18:14:05,142 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:14:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2019-11-28 18:14:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2600. [2019-11-28 18:14:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2019-11-28 18:14:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 6184 transitions. [2019-11-28 18:14:05,192 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 6184 transitions. Word has length 22 [2019-11-28 18:14:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:05,193 INFO L462 AbstractCegarLoop]: Abstraction has 2600 states and 6184 transitions. [2019-11-28 18:14:05,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 6184 transitions. [2019-11-28 18:14:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:14:05,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:05,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:05,201 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-11-28 18:14:05,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:05,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483489344] [2019-11-28 18:14:05,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:05,312 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:14:05,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483489344] [2019-11-28 18:14:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:05,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:05,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630410054] [2019-11-28 18:14:05,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:05,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:05,315 INFO L87 Difference]: Start difference. First operand 2600 states and 6184 transitions. Second operand 6 states. [2019-11-28 18:14:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:06,067 INFO L93 Difference]: Finished difference Result 6752 states and 16221 transitions. [2019-11-28 18:14:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:06,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 18:14:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:06,075 INFO L225 Difference]: With dead ends: 6752 [2019-11-28 18:14:06,075 INFO L226 Difference]: Without dead ends: 6656 [2019-11-28 18:14:06,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2019-11-28 18:14:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 3481. [2019-11-28 18:14:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3481 states. [2019-11-28 18:14:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 8426 transitions. [2019-11-28 18:14:06,140 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 8426 transitions. Word has length 29 [2019-11-28 18:14:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:06,140 INFO L462 AbstractCegarLoop]: Abstraction has 3481 states and 8426 transitions. [2019-11-28 18:14:06,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 8426 transitions. [2019-11-28 18:14:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 18:14:06,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:06,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:06,146 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:06,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1490700114, now seen corresponding path program 1 times [2019-11-28 18:14:06,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:06,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391846151] [2019-11-28 18:14:06,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:06,245 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:14:06,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391846151] [2019-11-28 18:14:06,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:06,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:06,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409762742] [2019-11-28 18:14:06,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:06,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:06,248 INFO L87 Difference]: Start difference. First operand 3481 states and 8426 transitions. Second operand 6 states. [2019-11-28 18:14:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:06,726 INFO L93 Difference]: Finished difference Result 6424 states and 15362 transitions. [2019-11-28 18:14:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:14:06,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-28 18:14:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:06,736 INFO L225 Difference]: With dead ends: 6424 [2019-11-28 18:14:06,736 INFO L226 Difference]: Without dead ends: 6346 [2019-11-28 18:14:06,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:14:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2019-11-28 18:14:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 3025. [2019-11-28 18:14:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3025 states. [2019-11-28 18:14:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 7299 transitions. [2019-11-28 18:14:06,808 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 7299 transitions. Word has length 30 [2019-11-28 18:14:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:06,808 INFO L462 AbstractCegarLoop]: Abstraction has 3025 states and 7299 transitions. [2019-11-28 18:14:06,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 7299 transitions. [2019-11-28 18:14:06,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:14:06,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:06,814 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] [2019-11-28 18:14:06,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash -485136262, now seen corresponding path program 1 times [2019-11-28 18:14:06,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:06,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973692120] [2019-11-28 18:14:06,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:06,880 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:14:06,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973692120] [2019-11-28 18:14:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:06,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448280197] [2019-11-28 18:14:06,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:06,882 INFO L87 Difference]: Start difference. First operand 3025 states and 7299 transitions. Second operand 5 states. [2019-11-28 18:14:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:06,915 INFO L93 Difference]: Finished difference Result 1784 states and 4226 transitions. [2019-11-28 18:14:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:06,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 18:14:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:06,917 INFO L225 Difference]: With dead ends: 1784 [2019-11-28 18:14:06,917 INFO L226 Difference]: Without dead ends: 1218 [2019-11-28 18:14:06,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-11-28 18:14:06,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 628. [2019-11-28 18:14:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-28 18:14:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1445 transitions. [2019-11-28 18:14:06,928 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1445 transitions. Word has length 31 [2019-11-28 18:14:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:06,928 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 1445 transitions. [2019-11-28 18:14:06,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1445 transitions. [2019-11-28 18:14:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:14:06,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:06,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:06,930 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:06,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1102645559, now seen corresponding path program 1 times [2019-11-28 18:14:06,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:06,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203487842] [2019-11-28 18:14:06,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:07,074 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:14:07,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203487842] [2019-11-28 18:14:07,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:07,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:07,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231215150] [2019-11-28 18:14:07,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:07,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:07,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:07,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:07,077 INFO L87 Difference]: Start difference. First operand 628 states and 1445 transitions. Second operand 6 states. [2019-11-28 18:14:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:07,307 INFO L93 Difference]: Finished difference Result 1706 states and 3827 transitions. [2019-11-28 18:14:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:14:07,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-28 18:14:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:07,309 INFO L225 Difference]: With dead ends: 1706 [2019-11-28 18:14:07,309 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:14:07,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:14:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:14:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 700. [2019-11-28 18:14:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-11-28 18:14:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1621 transitions. [2019-11-28 18:14:07,320 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1621 transitions. Word has length 45 [2019-11-28 18:14:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:07,320 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 1621 transitions. [2019-11-28 18:14:07,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1621 transitions. [2019-11-28 18:14:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:14:07,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:07,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:07,322 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:07,322 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 2 times [2019-11-28 18:14:07,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:07,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075879528] [2019-11-28 18:14:07,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:07,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:14:07,429 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:14:07,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32|) |v_ULTIMATE.start_main_~#t1010~0.offset_22| 0))) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1010~0.base_32| 4)) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~y$r_buff0_thd1~0_39 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1010~0.base_32|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32|) 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t1010~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_133) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, ULTIMATE.start_main_~#t1010~0.offset=|v_ULTIMATE.start_main_~#t1010~0.offset_22|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_~#t1010~0.base=|v_ULTIMATE.start_main_~#t1010~0.base_32|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_26|, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_15|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1010~0.offset, #NULL.offset, ULTIMATE.start_main_~#t1011~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1010~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1012~0.base, ~y~0, ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1011~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:14:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1011~0.base_11| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11|) |v_ULTIMATE.start_main_~#t1011~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1011~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1011~0.base_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1011~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1011~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1011~0.base] because there is no mapped edge [2019-11-28 18:14:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1012~0.base_10|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10|) |v_ULTIMATE.start_main_~#t1012~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1012~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1012~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t1012~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1012~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff1_thd0~0_Out-1489387492 ~y$r_buff0_thd0~0_In-1489387492) (= ~y$r_buff1_thd3~0_Out-1489387492 ~y$r_buff0_thd3~0_In-1489387492) (= ~__unbuffered_p2_EAX~0_Out-1489387492 ~z~0_Out-1489387492) (= ~__unbuffered_p2_EBX~0_Out-1489387492 ~a~0_In-1489387492) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1489387492)) (= 1 ~y$r_buff0_thd3~0_Out-1489387492) (= ~y$r_buff0_thd1~0_In-1489387492 ~y$r_buff1_thd1~0_Out-1489387492) (= ~y$r_buff1_thd2~0_Out-1489387492 ~y$r_buff0_thd2~0_In-1489387492) (= 1 ~z~0_Out-1489387492)) InVars {~a~0=~a~0_In-1489387492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1489387492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489387492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1489387492, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1489387492, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1489387492} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1489387492, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1489387492, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1489387492, ~a~0=~a~0_In-1489387492, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1489387492, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1489387492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1489387492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489387492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1489387492, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1489387492, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1489387492, ~z~0=~z~0_Out-1489387492, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1489387492} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:14:07,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:14:07,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In609620913 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In609620913 256)))) (or (and (= (mod ~y$w_buff1_used~0_In609620913 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In609620913 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In609620913 256) 0))) (= |P1Thread1of1ForFork1_#t~ite8_Out609620913| ~y$w_buff0~0_In609620913) (= |P1Thread1of1ForFork1_#t~ite9_Out609620913| |P1Thread1of1ForFork1_#t~ite8_Out609620913|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite8_In609620913| |P1Thread1of1ForFork1_#t~ite8_Out609620913|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out609620913| ~y$w_buff0~0_In609620913)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In609620913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In609620913, ~y$w_buff0~0=~y$w_buff0~0_In609620913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In609620913, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In609620913|, ~weak$$choice2~0=~weak$$choice2~0_In609620913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In609620913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In609620913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In609620913, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out609620913|, ~y$w_buff0~0=~y$w_buff0~0_In609620913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In609620913, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out609620913|, ~weak$$choice2~0=~weak$$choice2~0_In609620913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In609620913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:14:07,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1540037454 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_In1540037454| |P1Thread1of1ForFork1_#t~ite11_Out1540037454|) (= |P1Thread1of1ForFork1_#t~ite12_Out1540037454| ~y$w_buff1~0_In1540037454) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1540037454 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1540037454 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1540037454 256) 0) (and (= (mod ~y$w_buff1_used~0_In1540037454 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite11_Out1540037454| |P1Thread1of1ForFork1_#t~ite12_Out1540037454|) (= |P1Thread1of1ForFork1_#t~ite11_Out1540037454| ~y$w_buff1~0_In1540037454) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1540037454, ~y$w_buff1~0=~y$w_buff1~0_In1540037454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1540037454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1540037454, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1540037454|, ~weak$$choice2~0=~weak$$choice2~0_In1540037454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1540037454} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1540037454, ~y$w_buff1~0=~y$w_buff1~0_In1540037454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1540037454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1540037454, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1540037454|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1540037454|, ~weak$$choice2~0=~weak$$choice2~0_In1540037454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1540037454} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:14:07,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-175107180 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-175107180| |P1Thread1of1ForFork1_#t~ite14_Out-175107180|) (= ~y$w_buff0_used~0_In-175107180 |P1Thread1of1ForFork1_#t~ite15_Out-175107180|)) (and (= ~y$w_buff0_used~0_In-175107180 |P1Thread1of1ForFork1_#t~ite14_Out-175107180|) (= |P1Thread1of1ForFork1_#t~ite14_Out-175107180| |P1Thread1of1ForFork1_#t~ite15_Out-175107180|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-175107180 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-175107180 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-175107180 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-175107180 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-175107180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-175107180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-175107180, ~weak$$choice2~0=~weak$$choice2~0_In-175107180, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-175107180|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-175107180} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-175107180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-175107180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-175107180, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-175107180|, ~weak$$choice2~0=~weak$$choice2~0_In-175107180, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-175107180|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-175107180} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:14:07,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:14:07,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:14:07,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1730608081 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1730608081 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1730608081| ~y$w_buff0_used~0_In1730608081)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out1730608081| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1730608081, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1730608081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1730608081, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1730608081, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1730608081|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:14:07,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1604535135 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1604535135 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1604535135 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1604535135 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out1604535135| ~y$w_buff1_used~0_In1604535135)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1604535135|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1604535135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1604535135, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1604535135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1604535135} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1604535135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1604535135, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1604535135, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1604535135|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1604535135} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:14:07,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-696896098 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-696896098 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_In-696896098 ~y$r_buff0_thd3~0_Out-696896098))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-696896098) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-696896098, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-696896098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-696896098, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-696896098|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-696896098} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:14:07,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1680061824 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1680061824 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1680061824 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1680061824 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1680061824|)) (and (= ~y$r_buff1_thd3~0_In-1680061824 |P2Thread1of1ForFork2_#t~ite31_Out-1680061824|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1680061824, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1680061824, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1680061824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1680061824} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1680061824, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1680061824, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1680061824|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1680061824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1680061824} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:07,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:14:07,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:14:07,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-10303307 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-10303307 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-10303307| ~y~0_In-10303307)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-10303307| ~y$w_buff1~0_In-10303307) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-10303307, ~y~0=~y~0_In-10303307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-10303307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10303307} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-10303307, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-10303307|, ~y~0=~y~0_In-10303307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-10303307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10303307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:14:07,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:14:07,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1401687037 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1401687037 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1401687037| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1401687037 |ULTIMATE.start_main_#t~ite37_Out1401687037|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1401687037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401687037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1401687037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401687037, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1401687037|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:14:07,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1926217789 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1926217789 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1926217789 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1926217789 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1926217789| ~y$w_buff1_used~0_In1926217789) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out1926217789| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1926217789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926217789, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1926217789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926217789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1926217789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926217789, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1926217789|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1926217789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926217789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:07,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In26008959 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In26008959 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In26008959 |ULTIMATE.start_main_#t~ite39_Out26008959|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out26008959|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In26008959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26008959} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In26008959, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out26008959|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26008959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:07,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-531117248 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-531117248 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-531117248 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-531117248 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-531117248|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-531117248| ~y$r_buff1_thd0~0_In-531117248)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-531117248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-531117248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-531117248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-531117248} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-531117248|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-531117248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-531117248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-531117248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-531117248} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:07,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$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~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:07,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:14:07 BasicIcfg [2019-11-28 18:14:07,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:14:07,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:14:07,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:14:07,534 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:14:07,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:13:46" (3/4) ... [2019-11-28 18:14:07,537 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:14:07,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32|) |v_ULTIMATE.start_main_~#t1010~0.offset_22| 0))) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1010~0.base_32| 4)) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~y$r_buff0_thd1~0_39 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1010~0.base_32|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32|) 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t1010~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_133) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, ULTIMATE.start_main_~#t1010~0.offset=|v_ULTIMATE.start_main_~#t1010~0.offset_22|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_~#t1010~0.base=|v_ULTIMATE.start_main_~#t1010~0.base_32|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_26|, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_15|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1010~0.offset, #NULL.offset, ULTIMATE.start_main_~#t1011~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1010~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1012~0.base, ~y~0, ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1011~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:14:07,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1011~0.base_11| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11|) |v_ULTIMATE.start_main_~#t1011~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1011~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1011~0.base_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1011~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1011~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1011~0.base] because there is no mapped edge [2019-11-28 18:14:07,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1012~0.base_10|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10|) |v_ULTIMATE.start_main_~#t1012~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1012~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1012~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t1012~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1012~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:14:07,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff1_thd0~0_Out-1489387492 ~y$r_buff0_thd0~0_In-1489387492) (= ~y$r_buff1_thd3~0_Out-1489387492 ~y$r_buff0_thd3~0_In-1489387492) (= ~__unbuffered_p2_EAX~0_Out-1489387492 ~z~0_Out-1489387492) (= ~__unbuffered_p2_EBX~0_Out-1489387492 ~a~0_In-1489387492) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1489387492)) (= 1 ~y$r_buff0_thd3~0_Out-1489387492) (= ~y$r_buff0_thd1~0_In-1489387492 ~y$r_buff1_thd1~0_Out-1489387492) (= ~y$r_buff1_thd2~0_Out-1489387492 ~y$r_buff0_thd2~0_In-1489387492) (= 1 ~z~0_Out-1489387492)) InVars {~a~0=~a~0_In-1489387492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1489387492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489387492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1489387492, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1489387492, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1489387492} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1489387492, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-1489387492, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1489387492, ~a~0=~a~0_In-1489387492, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1489387492, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1489387492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1489387492, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1489387492, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1489387492, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1489387492, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1489387492, ~z~0=~z~0_Out-1489387492, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1489387492} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:14:07,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:14:07,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In609620913 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In609620913 256)))) (or (and (= (mod ~y$w_buff1_used~0_In609620913 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In609620913 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In609620913 256) 0))) (= |P1Thread1of1ForFork1_#t~ite8_Out609620913| ~y$w_buff0~0_In609620913) (= |P1Thread1of1ForFork1_#t~ite9_Out609620913| |P1Thread1of1ForFork1_#t~ite8_Out609620913|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite8_In609620913| |P1Thread1of1ForFork1_#t~ite8_Out609620913|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out609620913| ~y$w_buff0~0_In609620913)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In609620913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In609620913, ~y$w_buff0~0=~y$w_buff0~0_In609620913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In609620913, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In609620913|, ~weak$$choice2~0=~weak$$choice2~0_In609620913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In609620913} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In609620913, ~y$w_buff0_used~0=~y$w_buff0_used~0_In609620913, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out609620913|, ~y$w_buff0~0=~y$w_buff0~0_In609620913, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In609620913, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out609620913|, ~weak$$choice2~0=~weak$$choice2~0_In609620913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In609620913} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:14:07,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1540037454 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_In1540037454| |P1Thread1of1ForFork1_#t~ite11_Out1540037454|) (= |P1Thread1of1ForFork1_#t~ite12_Out1540037454| ~y$w_buff1~0_In1540037454) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1540037454 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1540037454 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1540037454 256) 0) (and (= (mod ~y$w_buff1_used~0_In1540037454 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite11_Out1540037454| |P1Thread1of1ForFork1_#t~ite12_Out1540037454|) (= |P1Thread1of1ForFork1_#t~ite11_Out1540037454| ~y$w_buff1~0_In1540037454) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1540037454, ~y$w_buff1~0=~y$w_buff1~0_In1540037454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1540037454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1540037454, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1540037454|, ~weak$$choice2~0=~weak$$choice2~0_In1540037454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1540037454} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1540037454, ~y$w_buff1~0=~y$w_buff1~0_In1540037454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1540037454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1540037454, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1540037454|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1540037454|, ~weak$$choice2~0=~weak$$choice2~0_In1540037454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1540037454} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-11-28 18:14:07,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-175107180 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-175107180| |P1Thread1of1ForFork1_#t~ite14_Out-175107180|) (= ~y$w_buff0_used~0_In-175107180 |P1Thread1of1ForFork1_#t~ite15_Out-175107180|)) (and (= ~y$w_buff0_used~0_In-175107180 |P1Thread1of1ForFork1_#t~ite14_Out-175107180|) (= |P1Thread1of1ForFork1_#t~ite14_Out-175107180| |P1Thread1of1ForFork1_#t~ite15_Out-175107180|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-175107180 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-175107180 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-175107180 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-175107180 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-175107180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-175107180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-175107180, ~weak$$choice2~0=~weak$$choice2~0_In-175107180, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-175107180|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-175107180} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-175107180, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-175107180, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-175107180, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-175107180|, ~weak$$choice2~0=~weak$$choice2~0_In-175107180, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-175107180|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-175107180} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:14:07,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:14:07,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:14:07,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1730608081 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1730608081 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1730608081| ~y$w_buff0_used~0_In1730608081)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out1730608081| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1730608081, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1730608081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1730608081, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1730608081, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1730608081|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:14:07,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1604535135 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1604535135 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1604535135 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1604535135 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out1604535135| ~y$w_buff1_used~0_In1604535135)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1604535135|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1604535135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1604535135, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1604535135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1604535135} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1604535135, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1604535135, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1604535135, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1604535135|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1604535135} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:14:07,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-696896098 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-696896098 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_In-696896098 ~y$r_buff0_thd3~0_Out-696896098))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-696896098) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-696896098, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-696896098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-696896098, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-696896098|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-696896098} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:14:07,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1680061824 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1680061824 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1680061824 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1680061824 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1680061824|)) (and (= ~y$r_buff1_thd3~0_In-1680061824 |P2Thread1of1ForFork2_#t~ite31_Out-1680061824|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1680061824, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1680061824, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1680061824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1680061824} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1680061824, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1680061824, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1680061824|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1680061824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1680061824} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:14:07,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:14:07,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:14:07,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-10303307 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-10303307 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-10303307| ~y~0_In-10303307)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-10303307| ~y$w_buff1~0_In-10303307) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-10303307, ~y~0=~y~0_In-10303307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-10303307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10303307} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-10303307, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-10303307|, ~y~0=~y~0_In-10303307, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-10303307, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-10303307} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:14:07,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:14:07,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1401687037 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1401687037 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out1401687037| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1401687037 |ULTIMATE.start_main_#t~ite37_Out1401687037|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1401687037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401687037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1401687037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1401687037, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1401687037|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:14:07,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1926217789 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1926217789 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1926217789 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1926217789 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1926217789| ~y$w_buff1_used~0_In1926217789) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out1926217789| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1926217789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926217789, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1926217789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926217789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1926217789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926217789, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1926217789|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1926217789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926217789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:07,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In26008959 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In26008959 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In26008959 |ULTIMATE.start_main_#t~ite39_Out26008959|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out26008959|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In26008959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26008959} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In26008959, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out26008959|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26008959} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:07,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-531117248 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-531117248 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-531117248 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-531117248 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-531117248|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-531117248| ~y$r_buff1_thd0~0_In-531117248)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-531117248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-531117248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-531117248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-531117248} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-531117248|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-531117248, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-531117248, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-531117248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-531117248} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:07,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$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~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:07,704 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:14:07,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:14:07,707 INFO L168 Benchmark]: Toolchain (without parser) took 22924.23 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -408.2 MB). Peak memory consumption was 616.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:07,709 INFO L168 Benchmark]: CDTParser took 0.37 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:14:07,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:07,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:07,711 INFO L168 Benchmark]: Boogie Preprocessor took 57.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:07,711 INFO L168 Benchmark]: RCFGBuilder took 769.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:07,715 INFO L168 Benchmark]: TraceAbstraction took 21056.05 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 903.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -349.5 MB). Peak memory consumption was 553.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:07,716 INFO L168 Benchmark]: Witness Printer took 171.29 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:07,718 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.37 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 798.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 769.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21056.05 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 903.3 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -349.5 MB). Peak memory consumption was 553.9 MB. Max. memory is 11.5 GB. * Witness Printer took 171.29 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1010, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1011, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1012, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1705 SDtfs, 1844 SDslu, 2630 SDs, 0 SdLazy, 1558 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24859occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 28386 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 37894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...