./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix009_power.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/mix009_power.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 2b59928740dd0fd5a2cef73aee39584dec80c210 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:02:47,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:02:47,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:02:47,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:02:47,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:02:47,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:02:47,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:02:47,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:02:47,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:02:47,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:02:47,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:02:47,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:02:47,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:02:47,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:02:47,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:02:47,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:02:47,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:02:47,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:02:47,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:02:47,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:02:47,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:02:47,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:02:47,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:02:47,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:02:47,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:02:47,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:02:47,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:02:47,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:02:47,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:02:47,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:02:47,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:02:47,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:02:47,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:02:47,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:02:47,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:02:47,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:02:47,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:02:47,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:02:47,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:02:47,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:02:47,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:02:47,375 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:02:47,395 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:02:47,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:02:47,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:02:47,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:02:47,400 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:02:47,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:02:47,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:02:47,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:02:47,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:02:47,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:02:47,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:02:47,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:02:47,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:02:47,404 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:02:47,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:02:47,405 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:02:47,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:02:47,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:02:47,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:02:47,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:02:47,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:02:47,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:02:47,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:02:47,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:02:47,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:02:47,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:02:47,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:02:47,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:02:47,409 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:02:47,409 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 -> 2b59928740dd0fd5a2cef73aee39584dec80c210 [2019-11-28 18:02:47,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:02:47,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:02:47,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:02:47,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:02:47,758 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:02:47,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix009_power.opt.i [2019-11-28 18:02:47,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95021a81b/ad47bb06a432455bbd8c8b17608026e0/FLAG32d8a5968 [2019-11-28 18:02:48,332 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:02:48,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix009_power.opt.i [2019-11-28 18:02:48,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95021a81b/ad47bb06a432455bbd8c8b17608026e0/FLAG32d8a5968 [2019-11-28 18:02:48,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95021a81b/ad47bb06a432455bbd8c8b17608026e0 [2019-11-28 18:02:48,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:02:48,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:02:48,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:02:48,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:02:48,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:02:48,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:02:48" (1/1) ... [2019-11-28 18:02:48,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8bbb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:48, skipping insertion in model container [2019-11-28 18:02:48,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:02:48" (1/1) ... [2019-11-28 18:02:48,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:02:48,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:02:49,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:02:49,312 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:02:49,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:02:49,534 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:02:49,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49 WrapperNode [2019-11-28 18:02:49,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:02:49,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:02:49,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:02:49,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:02:49,550 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:02:49" (1/1) ... [2019-11-28 18:02:49,598 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:02:49" (1/1) ... [2019-11-28 18:02:49,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:02:49,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:02:49,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:02:49,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:02:49,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:02:49,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:02:49,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:02:49,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:02:49,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (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:02:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:02:49,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:02:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:02:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:02:49,796 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:02:49,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:02:49,797 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:02:49,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:02:49,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:02:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:02:49,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:02:49,800 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:02:50,635 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:02:50,635 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:02:50,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:50 BoogieIcfgContainer [2019-11-28 18:02:50,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:02:50,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:02:50,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:02:50,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:02:50,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:02:48" (1/3) ... [2019-11-28 18:02:50,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705f3b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:02:50, skipping insertion in model container [2019-11-28 18:02:50,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (2/3) ... [2019-11-28 18:02:50,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705f3b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:02:50, skipping insertion in model container [2019-11-28 18:02:50,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:50" (3/3) ... [2019-11-28 18:02:50,647 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.opt.i [2019-11-28 18:02:50,656 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:02:50,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:02:50,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:02:50,665 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:02:50,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:02:50,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:02:50,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:02:50,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:02:50,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:02:50,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:02:50,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:02:50,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:02:50,818 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:02:50,837 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 229 transitions [2019-11-28 18:02:50,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 229 transitions [2019-11-28 18:02:50,948 INFO L134 PetriNetUnfolder]: 56/227 cut-off events. [2019-11-28 18:02:50,948 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:02:50,970 INFO L76 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 56/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 912 event pairs. 6/175 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 18:02:51,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 229 transitions [2019-11-28 18:02:51,074 INFO L134 PetriNetUnfolder]: 56/227 cut-off events. [2019-11-28 18:02:51,074 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:02:51,096 INFO L76 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 227 events. 56/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 912 event pairs. 6/175 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 18:02:51,128 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-11-28 18:02:51,130 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:02:56,244 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:02:56,363 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:02:56,423 INFO L206 etLargeBlockEncoding]: Checked pairs total: 118733 [2019-11-28 18:02:56,423 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-11-28 18:02:56,427 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 123 transitions [2019-11-28 18:02:58,357 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22250 states. [2019-11-28 18:02:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22250 states. [2019-11-28 18:02:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:02:58,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:02:58,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:02:58,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:02:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:02:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash 967970267, now seen corresponding path program 1 times [2019-11-28 18:02:58,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:02:58,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446587829] [2019-11-28 18:02:58,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:02:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:02:58,634 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:02:58,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446587829] [2019-11-28 18:02:58,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:02:58,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:02:58,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359881207] [2019-11-28 18:02:58,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:02:58,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:02:58,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:02:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:02:58,664 INFO L87 Difference]: Start difference. First operand 22250 states. Second operand 3 states. [2019-11-28 18:02:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:02:59,105 INFO L93 Difference]: Finished difference Result 22082 states and 78296 transitions. [2019-11-28 18:02:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:02:59,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:02:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:02:59,319 INFO L225 Difference]: With dead ends: 22082 [2019-11-28 18:02:59,319 INFO L226 Difference]: Without dead ends: 20570 [2019-11-28 18:02:59,320 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:02:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2019-11-28 18:03:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20570. [2019-11-28 18:03:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20570 states. [2019-11-28 18:03:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20570 states to 20570 states and 72872 transitions. [2019-11-28 18:03:00,821 INFO L78 Accepts]: Start accepts. Automaton has 20570 states and 72872 transitions. Word has length 5 [2019-11-28 18:03:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:00,821 INFO L462 AbstractCegarLoop]: Abstraction has 20570 states and 72872 transitions. [2019-11-28 18:03:00,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20570 states and 72872 transitions. [2019-11-28 18:03:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:03:00,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:00,826 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:00,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:00,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:00,827 INFO L82 PathProgramCache]: Analyzing trace with hash 488138773, now seen corresponding path program 1 times [2019-11-28 18:03:00,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:00,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216271378] [2019-11-28 18:03:00,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:00,932 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:03:00,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216271378] [2019-11-28 18:03:00,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:00,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:00,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767271349] [2019-11-28 18:03:00,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:00,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:00,936 INFO L87 Difference]: Start difference. First operand 20570 states and 72872 transitions. Second operand 4 states. [2019-11-28 18:03:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:01,515 INFO L93 Difference]: Finished difference Result 32746 states and 111276 transitions. [2019-11-28 18:03:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:01,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:03:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:01,664 INFO L225 Difference]: With dead ends: 32746 [2019-11-28 18:03:01,664 INFO L226 Difference]: Without dead ends: 32730 [2019-11-28 18:03:01,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32730 states. [2019-11-28 18:03:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32730 to 31357. [2019-11-28 18:03:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31357 states. [2019-11-28 18:03:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31357 states to 31357 states and 107493 transitions. [2019-11-28 18:03:03,517 INFO L78 Accepts]: Start accepts. Automaton has 31357 states and 107493 transitions. Word has length 11 [2019-11-28 18:03:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:03,518 INFO L462 AbstractCegarLoop]: Abstraction has 31357 states and 107493 transitions. [2019-11-28 18:03:03,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 31357 states and 107493 transitions. [2019-11-28 18:03:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:03:03,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:03,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:03,527 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:03,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -708377534, now seen corresponding path program 1 times [2019-11-28 18:03:03,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:03,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961023482] [2019-11-28 18:03:03,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:03,632 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:03:03,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961023482] [2019-11-28 18:03:03,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:03,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:03,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47002443] [2019-11-28 18:03:03,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:03,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:03,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:03,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:03,635 INFO L87 Difference]: Start difference. First operand 31357 states and 107493 transitions. Second operand 4 states. [2019-11-28 18:03:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:04,113 INFO L93 Difference]: Finished difference Result 41141 states and 138603 transitions. [2019-11-28 18:03:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:04,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:03:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:04,271 INFO L225 Difference]: With dead ends: 41141 [2019-11-28 18:03:04,271 INFO L226 Difference]: Without dead ends: 41125 [2019-11-28 18:03:04,272 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:03:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41125 states. [2019-11-28 18:03:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41125 to 36115. [2019-11-28 18:03:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36115 states. [2019-11-28 18:03:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36115 states to 36115 states and 123093 transitions. [2019-11-28 18:03:06,176 INFO L78 Accepts]: Start accepts. Automaton has 36115 states and 123093 transitions. Word has length 14 [2019-11-28 18:03:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:06,179 INFO L462 AbstractCegarLoop]: Abstraction has 36115 states and 123093 transitions. [2019-11-28 18:03:06,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36115 states and 123093 transitions. [2019-11-28 18:03:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 18:03:06,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:06,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:06,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -484837769, now seen corresponding path program 1 times [2019-11-28 18:03:06,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:06,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012476495] [2019-11-28 18:03:06,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:06,236 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:03:06,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012476495] [2019-11-28 18:03:06,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:06,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:06,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755136565] [2019-11-28 18:03:06,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:06,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:06,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:06,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:06,238 INFO L87 Difference]: Start difference. First operand 36115 states and 123093 transitions. Second operand 3 states. [2019-11-28 18:03:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:06,576 INFO L93 Difference]: Finished difference Result 60120 states and 195578 transitions. [2019-11-28 18:03:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:06,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 18:03:06,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:06,737 INFO L225 Difference]: With dead ends: 60120 [2019-11-28 18:03:06,738 INFO L226 Difference]: Without dead ends: 60120 [2019-11-28 18:03:06,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60120 states. [2019-11-28 18:03:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60120 to 53845. [2019-11-28 18:03:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53845 states. [2019-11-28 18:03:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53845 states to 53845 states and 177890 transitions. [2019-11-28 18:03:09,273 INFO L78 Accepts]: Start accepts. Automaton has 53845 states and 177890 transitions. Word has length 15 [2019-11-28 18:03:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:09,274 INFO L462 AbstractCegarLoop]: Abstraction has 53845 states and 177890 transitions. [2019-11-28 18:03:09,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 53845 states and 177890 transitions. [2019-11-28 18:03:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:03:09,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:09,281 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:03:09,281 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:09,282 INFO L82 PathProgramCache]: Analyzing trace with hash -738389870, now seen corresponding path program 1 times [2019-11-28 18:03:09,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:09,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084813909] [2019-11-28 18:03:09,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:09,325 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:03:09,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084813909] [2019-11-28 18:03:09,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:09,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:09,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697594592] [2019-11-28 18:03:09,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:09,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:09,328 INFO L87 Difference]: Start difference. First operand 53845 states and 177890 transitions. Second operand 3 states. [2019-11-28 18:03:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:09,355 INFO L93 Difference]: Finished difference Result 5497 states and 12822 transitions. [2019-11-28 18:03:09,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:09,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:03:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:09,364 INFO L225 Difference]: With dead ends: 5497 [2019-11-28 18:03:09,364 INFO L226 Difference]: Without dead ends: 5497 [2019-11-28 18:03:09,365 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:03:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2019-11-28 18:03:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5497. [2019-11-28 18:03:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-11-28 18:03:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 12822 transitions. [2019-11-28 18:03:09,447 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 12822 transitions. Word has length 16 [2019-11-28 18:03:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:09,447 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 12822 transitions. [2019-11-28 18:03:09,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 12822 transitions. [2019-11-28 18:03:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:03:09,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:09,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:09,449 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash -884985628, now seen corresponding path program 1 times [2019-11-28 18:03:09,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:09,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867956616] [2019-11-28 18:03:09,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:09,511 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:03:09,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867956616] [2019-11-28 18:03:09,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:09,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:09,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180639745] [2019-11-28 18:03:09,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:09,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:09,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:09,515 INFO L87 Difference]: Start difference. First operand 5497 states and 12822 transitions. Second operand 4 states. [2019-11-28 18:03:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:09,835 INFO L93 Difference]: Finished difference Result 6995 states and 16059 transitions. [2019-11-28 18:03:09,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:09,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:03:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:09,845 INFO L225 Difference]: With dead ends: 6995 [2019-11-28 18:03:09,845 INFO L226 Difference]: Without dead ends: 6995 [2019-11-28 18:03:09,846 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:03:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-11-28 18:03:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 5527. [2019-11-28 18:03:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5527 states. [2019-11-28 18:03:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 12893 transitions. [2019-11-28 18:03:09,917 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 12893 transitions. Word has length 17 [2019-11-28 18:03:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:09,918 INFO L462 AbstractCegarLoop]: Abstraction has 5527 states and 12893 transitions. [2019-11-28 18:03:09,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 12893 transitions. [2019-11-28 18:03:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:03:09,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:09,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:09,925 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash 54448529, now seen corresponding path program 1 times [2019-11-28 18:03:09,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:09,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256586860] [2019-11-28 18:03:09,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:10,054 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:03:10,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256586860] [2019-11-28 18:03:10,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:10,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:10,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092064] [2019-11-28 18:03:10,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:10,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:10,057 INFO L87 Difference]: Start difference. First operand 5527 states and 12893 transitions. Second operand 4 states. [2019-11-28 18:03:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:10,084 INFO L93 Difference]: Finished difference Result 3628 states and 8422 transitions. [2019-11-28 18:03:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:10,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:03:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:10,090 INFO L225 Difference]: With dead ends: 3628 [2019-11-28 18:03:10,090 INFO L226 Difference]: Without dead ends: 3628 [2019-11-28 18:03:10,094 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:03:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-11-28 18:03:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3406. [2019-11-28 18:03:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3406 states. [2019-11-28 18:03:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 7992 transitions. [2019-11-28 18:03:10,135 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 7992 transitions. Word has length 28 [2019-11-28 18:03:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:10,135 INFO L462 AbstractCegarLoop]: Abstraction has 3406 states and 7992 transitions. [2019-11-28 18:03:10,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 7992 transitions. [2019-11-28 18:03:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 18:03:10,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:10,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:10,144 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1031189716, now seen corresponding path program 1 times [2019-11-28 18:03:10,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:10,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799298158] [2019-11-28 18:03:10,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:10,274 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:03:10,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799298158] [2019-11-28 18:03:10,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:10,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:03:10,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857152179] [2019-11-28 18:03:10,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:10,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:10,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:10,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:10,277 INFO L87 Difference]: Start difference. First operand 3406 states and 7992 transitions. Second operand 5 states. [2019-11-28 18:03:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:10,663 INFO L93 Difference]: Finished difference Result 4056 states and 9299 transitions. [2019-11-28 18:03:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:03:10,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-28 18:03:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:10,669 INFO L225 Difference]: With dead ends: 4056 [2019-11-28 18:03:10,669 INFO L226 Difference]: Without dead ends: 4056 [2019-11-28 18:03:10,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-11-28 18:03:10,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3792. [2019-11-28 18:03:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3792 states. [2019-11-28 18:03:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 8800 transitions. [2019-11-28 18:03:10,715 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 8800 transitions. Word has length 58 [2019-11-28 18:03:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:10,716 INFO L462 AbstractCegarLoop]: Abstraction has 3792 states and 8800 transitions. [2019-11-28 18:03:10,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 8800 transitions. [2019-11-28 18:03:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 18:03:10,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:10,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:10,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -850921972, now seen corresponding path program 2 times [2019-11-28 18:03:10,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:10,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954287626] [2019-11-28 18:03:10,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:10,931 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:03:10,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954287626] [2019-11-28 18:03:10,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:10,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:03:10,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786554232] [2019-11-28 18:03:10,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:03:10,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:03:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:03:10,934 INFO L87 Difference]: Start difference. First operand 3792 states and 8800 transitions. Second operand 9 states. [2019-11-28 18:03:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:11,851 INFO L93 Difference]: Finished difference Result 5454 states and 12284 transitions. [2019-11-28 18:03:11,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:03:11,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-11-28 18:03:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:11,861 INFO L225 Difference]: With dead ends: 5454 [2019-11-28 18:03:11,861 INFO L226 Difference]: Without dead ends: 5454 [2019-11-28 18:03:11,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:03:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2019-11-28 18:03:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4374. [2019-11-28 18:03:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-11-28 18:03:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 10022 transitions. [2019-11-28 18:03:11,923 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 10022 transitions. Word has length 58 [2019-11-28 18:03:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:11,923 INFO L462 AbstractCegarLoop]: Abstraction has 4374 states and 10022 transitions. [2019-11-28 18:03:11,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:03:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 10022 transitions. [2019-11-28 18:03:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:03:11,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:11,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:11,931 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1929768525, now seen corresponding path program 1 times [2019-11-28 18:03:11,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:11,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420772852] [2019-11-28 18:03:11,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:12,102 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:03:12,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420772852] [2019-11-28 18:03:12,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:12,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:03:12,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607165980] [2019-11-28 18:03:12,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:03:12,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:03:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:03:12,107 INFO L87 Difference]: Start difference. First operand 4374 states and 10022 transitions. Second operand 8 states. [2019-11-28 18:03:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:13,275 INFO L93 Difference]: Finished difference Result 13038 states and 30199 transitions. [2019-11-28 18:03:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:03:13,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-28 18:03:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:13,298 INFO L225 Difference]: With dead ends: 13038 [2019-11-28 18:03:13,299 INFO L226 Difference]: Without dead ends: 12714 [2019-11-28 18:03:13,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:03:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12714 states. [2019-11-28 18:03:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12714 to 6423. [2019-11-28 18:03:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6423 states. [2019-11-28 18:03:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 14943 transitions. [2019-11-28 18:03:14,177 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 14943 transitions. Word has length 59 [2019-11-28 18:03:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:14,177 INFO L462 AbstractCegarLoop]: Abstraction has 6423 states and 14943 transitions. [2019-11-28 18:03:14,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:03:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 14943 transitions. [2019-11-28 18:03:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:03:14,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:14,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:14,188 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1531172365, now seen corresponding path program 2 times [2019-11-28 18:03:14,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:14,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499301102] [2019-11-28 18:03:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:14,287 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:03:14,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499301102] [2019-11-28 18:03:14,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:14,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:14,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983957348] [2019-11-28 18:03:14,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:14,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:14,290 INFO L87 Difference]: Start difference. First operand 6423 states and 14943 transitions. Second operand 3 states. [2019-11-28 18:03:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:14,322 INFO L93 Difference]: Finished difference Result 6423 states and 14942 transitions. [2019-11-28 18:03:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:14,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-28 18:03:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:14,334 INFO L225 Difference]: With dead ends: 6423 [2019-11-28 18:03:14,334 INFO L226 Difference]: Without dead ends: 6423 [2019-11-28 18:03:14,335 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:03:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2019-11-28 18:03:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 6139. [2019-11-28 18:03:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6139 states. [2019-11-28 18:03:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6139 states to 6139 states and 14388 transitions. [2019-11-28 18:03:14,424 INFO L78 Accepts]: Start accepts. Automaton has 6139 states and 14388 transitions. Word has length 59 [2019-11-28 18:03:14,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:14,424 INFO L462 AbstractCegarLoop]: Abstraction has 6139 states and 14388 transitions. [2019-11-28 18:03:14,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6139 states and 14388 transitions. [2019-11-28 18:03:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:03:14,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:14,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:14,433 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash 257297660, now seen corresponding path program 1 times [2019-11-28 18:03:14,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:14,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915775280] [2019-11-28 18:03:14,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:14,557 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:03:14,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915775280] [2019-11-28 18:03:14,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:14,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:03:14,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054420965] [2019-11-28 18:03:14,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:14,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:14,561 INFO L87 Difference]: Start difference. First operand 6139 states and 14388 transitions. Second operand 5 states. [2019-11-28 18:03:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:14,844 INFO L93 Difference]: Finished difference Result 7208 states and 16626 transitions. [2019-11-28 18:03:14,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:03:14,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-28 18:03:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:14,857 INFO L225 Difference]: With dead ends: 7208 [2019-11-28 18:03:14,857 INFO L226 Difference]: Without dead ends: 7208 [2019-11-28 18:03:14,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7208 states. [2019-11-28 18:03:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7208 to 6491. [2019-11-28 18:03:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2019-11-28 18:03:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 15147 transitions. [2019-11-28 18:03:14,992 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 15147 transitions. Word has length 59 [2019-11-28 18:03:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:14,993 INFO L462 AbstractCegarLoop]: Abstraction has 6491 states and 15147 transitions. [2019-11-28 18:03:14,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 15147 transitions. [2019-11-28 18:03:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:03:15,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:15,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:15,008 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1405271357, now seen corresponding path program 1 times [2019-11-28 18:03:15,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:15,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313067635] [2019-11-28 18:03:15,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:03:15,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313067635] [2019-11-28 18:03:15,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:15,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:03:15,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299581053] [2019-11-28 18:03:15,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:03:15,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:03:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:03:15,154 INFO L87 Difference]: Start difference. First operand 6491 states and 15147 transitions. Second operand 5 states. [2019-11-28 18:03:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:15,201 INFO L93 Difference]: Finished difference Result 7139 states and 16582 transitions. [2019-11-28 18:03:15,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:03:15,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-28 18:03:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:15,202 INFO L225 Difference]: With dead ends: 7139 [2019-11-28 18:03:15,202 INFO L226 Difference]: Without dead ends: 717 [2019-11-28 18:03:15,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-28 18:03:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2019-11-28 18:03:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-11-28 18:03:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1525 transitions. [2019-11-28 18:03:15,211 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1525 transitions. Word has length 60 [2019-11-28 18:03:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:15,212 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 1525 transitions. [2019-11-28 18:03:15,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:03:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1525 transitions. [2019-11-28 18:03:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:03:15,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:15,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:15,213 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash 506493247, now seen corresponding path program 2 times [2019-11-28 18:03:15,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:15,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505493730] [2019-11-28 18:03:15,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:15,341 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:03:15,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505493730] [2019-11-28 18:03:15,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:15,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:03:15,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944099107] [2019-11-28 18:03:15,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:03:15,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:03:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:03:15,344 INFO L87 Difference]: Start difference. First operand 711 states and 1525 transitions. Second operand 8 states. [2019-11-28 18:03:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:15,582 INFO L93 Difference]: Finished difference Result 1341 states and 2822 transitions. [2019-11-28 18:03:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:03:15,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-28 18:03:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:15,586 INFO L225 Difference]: With dead ends: 1341 [2019-11-28 18:03:15,586 INFO L226 Difference]: Without dead ends: 979 [2019-11-28 18:03:15,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:03:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-11-28 18:03:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 775. [2019-11-28 18:03:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-11-28 18:03:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1632 transitions. [2019-11-28 18:03:15,598 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1632 transitions. Word has length 60 [2019-11-28 18:03:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:15,599 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1632 transitions. [2019-11-28 18:03:15,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:03:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1632 transitions. [2019-11-28 18:03:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:03:15,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:15,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:15,601 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1329242083, now seen corresponding path program 3 times [2019-11-28 18:03:15,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:15,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130974458] [2019-11-28 18:03:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:15,770 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:03:15,771 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:03:15,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~weak$$choice2~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t243~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t243~0.base_32|) |v_ULTIMATE.start_main_~#t243~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_165 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_471 0) (= v_~y$r_buff1_thd1~0_243 0) (= 0 v_~y$r_buff0_thd2~0_451) (= v_~y$r_buff1_thd0~0_188 0) (= v_~z~0_63 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t243~0.base_32|) (= v_~main$tmp_guard1~0_35 0) (= v_~y$r_buff0_thd0~0_109 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= (store .cse0 |v_ULTIMATE.start_main_~#t243~0.base_32| 1) |v_#valid_54|) (= 0 v_~y$r_buff1_thd2~0_323) (= 0 |v_ULTIMATE.start_main_~#t243~0.offset_23|) (= 0 |v_#NULL.base_4|) (= v_~x~0_41 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t243~0.base_32|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_290 0) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_43 0) (= 0 v_~y$w_buff0~0_198) (= 0 v_~__unbuffered_cnt~0_59) (= v_~y~0_230 0) (= v_~y$flush_delayed~0_205 0) (= 0 v_~weak$$choice0~0_154) (= v_~main$tmp_guard0~0_22 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t243~0.base_32| 4)) (= v_~y$w_buff0_used~0_808 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_808, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ULTIMATE.start_main_~#t244~0.base=|v_ULTIMATE.start_main_~#t244~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_243, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_198, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_205, #length=|v_#length_17|, ~y~0=v_~y~0_230, ULTIMATE.start_main_~#t244~0.offset=|v_ULTIMATE.start_main_~#t244~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_43, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_100|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_64|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t243~0.offset=|v_ULTIMATE.start_main_~#t243~0.offset_23|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_323, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_164|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, #valid=|v_#valid_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_451, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t243~0.base=|v_ULTIMATE.start_main_~#t243~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_237, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~x~0=v_~x~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t244~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t244~0.offset, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t243~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t243~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:03:15,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-1-->L820: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t244~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t244~0.base_11|) |v_ULTIMATE.start_main_~#t244~0.offset_10| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t244~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t244~0.base_11|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t244~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t244~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t244~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t244~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t244~0.base=|v_ULTIMATE.start_main_~#t244~0.base_11|, ULTIMATE.start_main_~#t244~0.offset=|v_ULTIMATE.start_main_~#t244~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t244~0.base, ULTIMATE.start_main_~#t244~0.offset] because there is no mapped edge [2019-11-28 18:03:15,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_50 v_~y$w_buff1~0_43) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~y$w_buff0_used~0_173 1) (= 1 v_~y$w_buff0~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_102 256))) (not (= 0 (mod v_~y$w_buff0_used~0_173 256))))) 1 0)) (= v_~y$w_buff0_used~0_174 v_~y$w_buff1_used~0_102)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_50, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_43, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_49, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:03:15,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L780-2-->L780-5: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In336086767 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out336086767| |P1Thread1of1ForFork1_#t~ite28_Out336086767|)) (.cse1 (= (mod ~y$w_buff0_used~0_In336086767 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y$w_buff1~0_In336086767 |P1Thread1of1ForFork1_#t~ite28_Out336086767|)) (and (not .cse0) .cse2 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out336086767| ~y$w_buff0~0_In336086767)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In336086767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In336086767, ~y$w_buff0~0=~y$w_buff0~0_In336086767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In336086767} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out336086767|, ~y$w_buff1~0=~y$w_buff1~0_In336086767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In336086767, ~y$w_buff0~0=~y$w_buff0~0_In336086767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In336086767, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out336086767|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:03:15,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_57 256) 0)) (= v_~y$r_buff0_thd2~0_101 v_~y$r_buff0_thd2~0_100)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_57} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-11-28 18:03:15,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In929137767 256)))) (or (and .cse0 (= ~y~0_In929137767 |P1Thread1of1ForFork1_#t~ite48_Out929137767|)) (and (= ~y$mem_tmp~0_In929137767 |P1Thread1of1ForFork1_#t~ite48_Out929137767|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In929137767, ~y$flush_delayed~0=~y$flush_delayed~0_In929137767, ~y~0=~y~0_In929137767} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In929137767, ~y$flush_delayed~0=~y$flush_delayed~0_In929137767, ~y~0=~y~0_In929137767, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out929137767|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 18:03:15,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1948075113 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1948075113 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out1948075113|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1948075113 |P1Thread1of1ForFork1_#t~ite51_Out1948075113|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1948075113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1948075113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1948075113, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1948075113|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1948075113} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 18:03:15,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1887310838 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1887310838 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1887310838 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1887310838 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out-1887310838| ~y$w_buff1_used~0_In-1887310838)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-1887310838| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887310838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887310838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887310838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887310838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887310838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887310838, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1887310838|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887310838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887310838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 18:03:15,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-135302098 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-135302098 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_Out-135302098 ~y$r_buff0_thd2~0_In-135302098))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-135302098 0)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-135302098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-135302098} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-135302098|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-135302098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-135302098} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:03:15,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1032542856 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1032542856 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1032542856 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1032542856 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1032542856 |P1Thread1of1ForFork1_#t~ite54_Out1032542856|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out1032542856|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1032542856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1032542856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1032542856, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1032542856} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1032542856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1032542856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1032542856, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1032542856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1032542856} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:03:15,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L799-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite54_26|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:03:15,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-403230550 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-403230550| ~y~0_In-403230550) .cse0) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-403230550| ~y$mem_tmp~0_In-403230550)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-403230550, ~y$flush_delayed~0=~y$flush_delayed~0_In-403230550, ~y~0=~y~0_In-403230550} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-403230550, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-403230550|, ~y$flush_delayed~0=~y$flush_delayed~0_In-403230550, ~y~0=~y~0_In-403230550} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 18:03:15,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L752-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y~0_147 |v_P0Thread1of1ForFork0_#t~ite25_28|) (= v_~y$flush_delayed~0_155 0) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_27|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~y~0=v_~y~0_147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:03:15,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:03:15,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In480814495 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out480814495| |ULTIMATE.start_main_#t~ite57_Out480814495|)) (.cse2 (= (mod ~y$w_buff1_used~0_In480814495 256) 0))) (or (and .cse0 (= ~y~0_In480814495 |ULTIMATE.start_main_#t~ite57_Out480814495|) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= ~y$w_buff1~0_In480814495 |ULTIMATE.start_main_#t~ite57_Out480814495|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In480814495, ~y~0=~y~0_In480814495, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In480814495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In480814495} OutVars{~y$w_buff1~0=~y$w_buff1~0_In480814495, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out480814495|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out480814495|, ~y~0=~y~0_In480814495, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In480814495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In480814495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 18:03:15,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1031172163 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1031172163 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-1031172163|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1031172163 |ULTIMATE.start_main_#t~ite59_Out-1031172163|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1031172163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1031172163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1031172163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1031172163, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1031172163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:03:15,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In513100166 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In513100166 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In513100166 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In513100166 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out513100166| 0)) (and (= ~y$w_buff1_used~0_In513100166 |ULTIMATE.start_main_#t~ite60_Out513100166|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In513100166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In513100166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In513100166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In513100166} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out513100166|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In513100166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In513100166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In513100166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In513100166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:03:15,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In521287948 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In521287948 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out521287948| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out521287948| ~y$r_buff0_thd0~0_In521287948)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In521287948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521287948} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out521287948|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521287948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521287948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:03:15,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2131150465 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2131150465 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2131150465 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2131150465 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2131150465|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In2131150465 |ULTIMATE.start_main_#t~ite62_Out2131150465|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2131150465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131150465, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131150465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131150465} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2131150465|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2131150465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131150465, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131150465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131150465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:03:15,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_178 |v_ULTIMATE.start_main_#t~ite62_44|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_25 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_33 0) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_39 0) (= 1 v_~__unbuffered_p0_EAX~0_52))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_43|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_178, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~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:03:15,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:03:15 BasicIcfg [2019-11-28 18:03:15,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:03:15,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:03:15,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:03:15,940 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:03:15,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:50" (3/4) ... [2019-11-28 18:03:15,943 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:03:15,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~weak$$choice2~0_237 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t243~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t243~0.base_32|) |v_ULTIMATE.start_main_~#t243~0.offset_23| 0)) |v_#memory_int_17|) (= v_~y$mem_tmp~0_165 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_471 0) (= v_~y$r_buff1_thd1~0_243 0) (= 0 v_~y$r_buff0_thd2~0_451) (= v_~y$r_buff1_thd0~0_188 0) (= v_~z~0_63 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t243~0.base_32|) (= v_~main$tmp_guard1~0_35 0) (= v_~y$r_buff0_thd0~0_109 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= (store .cse0 |v_ULTIMATE.start_main_~#t243~0.base_32| 1) |v_#valid_54|) (= 0 v_~y$r_buff1_thd2~0_323) (= 0 |v_ULTIMATE.start_main_~#t243~0.offset_23|) (= 0 |v_#NULL.base_4|) (= v_~x~0_41 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t243~0.base_32|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_290 0) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_43 0) (= 0 v_~y$w_buff0~0_198) (= 0 v_~__unbuffered_cnt~0_59) (= v_~y~0_230 0) (= v_~y$flush_delayed~0_205 0) (= 0 v_~weak$$choice0~0_154) (= v_~main$tmp_guard0~0_22 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t243~0.base_32| 4)) (= v_~y$w_buff0_used~0_808 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_808, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ULTIMATE.start_main_~#t244~0.base=|v_ULTIMATE.start_main_~#t244~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_243, ~y$mem_tmp~0=v_~y$mem_tmp~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ~y$w_buff0~0=v_~y$w_buff0~0_198, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_205, #length=|v_#length_17|, ~y~0=v_~y~0_230, ULTIMATE.start_main_~#t244~0.offset=|v_ULTIMATE.start_main_~#t244~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_43, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_100|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_64|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_50|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t243~0.offset=|v_ULTIMATE.start_main_~#t243~0.offset_23|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_62|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_323, ~weak$$choice0~0=v_~weak$$choice0~0_154, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_164|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, #valid=|v_#valid_54|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_451, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t243~0.base=|v_ULTIMATE.start_main_~#t243~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~z~0=v_~z~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_237, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ~x~0=v_~x~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_471} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t244~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t244~0.offset, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t243~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t243~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:03:15,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L818-1-->L820: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t244~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t244~0.base_11|) |v_ULTIMATE.start_main_~#t244~0.offset_10| 1))) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t244~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t244~0.base_11|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t244~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t244~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t244~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t244~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t244~0.base=|v_ULTIMATE.start_main_~#t244~0.base_11|, ULTIMATE.start_main_~#t244~0.offset=|v_ULTIMATE.start_main_~#t244~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t244~0.base, ULTIMATE.start_main_~#t244~0.offset] because there is no mapped edge [2019-11-28 18:03:15,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_50 v_~y$w_buff1~0_43) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= v_~y$w_buff0_used~0_173 1) (= 1 v_~y$w_buff0~0_49) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_4) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_102 256))) (not (= 0 (mod v_~y$w_buff0_used~0_173 256))))) 1 0)) (= v_~y$w_buff0_used~0_174 v_~y$w_buff1_used~0_102)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_50, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$w_buff1~0=v_~y$w_buff1~0_43, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_49, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:03:15,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L780-2-->L780-5: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In336086767 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out336086767| |P1Thread1of1ForFork1_#t~ite28_Out336086767|)) (.cse1 (= (mod ~y$w_buff0_used~0_In336086767 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y$w_buff1~0_In336086767 |P1Thread1of1ForFork1_#t~ite28_Out336086767|)) (and (not .cse0) .cse2 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out336086767| ~y$w_buff0~0_In336086767)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In336086767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In336086767, ~y$w_buff0~0=~y$w_buff0~0_In336086767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In336086767} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out336086767|, ~y$w_buff1~0=~y$w_buff1~0_In336086767, ~y$w_buff0_used~0=~y$w_buff0_used~0_In336086767, ~y$w_buff0~0=~y$w_buff0~0_In336086767, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In336086767, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out336086767|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:03:15,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_57 256) 0)) (= v_~y$r_buff0_thd2~0_101 v_~y$r_buff0_thd2~0_100)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_57} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_100, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-11-28 18:03:15,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In929137767 256)))) (or (and .cse0 (= ~y~0_In929137767 |P1Thread1of1ForFork1_#t~ite48_Out929137767|)) (and (= ~y$mem_tmp~0_In929137767 |P1Thread1of1ForFork1_#t~ite48_Out929137767|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In929137767, ~y$flush_delayed~0=~y$flush_delayed~0_In929137767, ~y~0=~y~0_In929137767} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In929137767, ~y$flush_delayed~0=~y$flush_delayed~0_In929137767, ~y~0=~y~0_In929137767, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out929137767|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 18:03:15,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1948075113 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1948075113 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out1948075113|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1948075113 |P1Thread1of1ForFork1_#t~ite51_Out1948075113|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1948075113, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1948075113} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1948075113, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1948075113|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1948075113} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 18:03:15,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1887310838 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1887310838 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1887310838 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1887310838 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out-1887310838| ~y$w_buff1_used~0_In-1887310838)) (and (= |P1Thread1of1ForFork1_#t~ite52_Out-1887310838| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887310838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887310838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887310838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887310838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887310838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887310838, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-1887310838|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887310838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887310838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 18:03:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-135302098 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-135302098 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_Out-135302098 ~y$r_buff0_thd2~0_In-135302098))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out-135302098 0)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-135302098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-135302098} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-135302098|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-135302098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-135302098} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:03:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1032542856 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1032542856 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1032542856 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1032542856 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1032542856 |P1Thread1of1ForFork1_#t~ite54_Out1032542856|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out1032542856|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1032542856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1032542856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1032542856, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1032542856} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1032542856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1032542856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1032542856, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1032542856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1032542856} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:03:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L799-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite54_26|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_25|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:03:15,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-403230550 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-403230550| ~y~0_In-403230550) .cse0) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-403230550| ~y$mem_tmp~0_In-403230550)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-403230550, ~y$flush_delayed~0=~y$flush_delayed~0_In-403230550, ~y~0=~y~0_In-403230550} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-403230550, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-403230550|, ~y$flush_delayed~0=~y$flush_delayed~0_In-403230550, ~y~0=~y~0_In-403230550} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 18:03:15,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L752-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y~0_147 |v_P0Thread1of1ForFork0_#t~ite25_28|) (= v_~y$flush_delayed~0_155 0) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_27|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_155, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~y~0=v_~y~0_147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:03:15,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:03:15,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In480814495 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out480814495| |ULTIMATE.start_main_#t~ite57_Out480814495|)) (.cse2 (= (mod ~y$w_buff1_used~0_In480814495 256) 0))) (or (and .cse0 (= ~y~0_In480814495 |ULTIMATE.start_main_#t~ite57_Out480814495|) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= ~y$w_buff1~0_In480814495 |ULTIMATE.start_main_#t~ite57_Out480814495|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In480814495, ~y~0=~y~0_In480814495, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In480814495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In480814495} OutVars{~y$w_buff1~0=~y$w_buff1~0_In480814495, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out480814495|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out480814495|, ~y~0=~y~0_In480814495, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In480814495, ~y$w_buff1_used~0=~y$w_buff1_used~0_In480814495} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 18:03:15,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1031172163 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1031172163 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite59_Out-1031172163|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1031172163 |ULTIMATE.start_main_#t~ite59_Out-1031172163|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1031172163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1031172163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1031172163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1031172163, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1031172163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:03:15,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In513100166 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In513100166 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In513100166 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In513100166 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite60_Out513100166| 0)) (and (= ~y$w_buff1_used~0_In513100166 |ULTIMATE.start_main_#t~ite60_Out513100166|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In513100166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In513100166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In513100166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In513100166} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out513100166|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In513100166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In513100166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In513100166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In513100166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:03:15,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In521287948 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In521287948 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out521287948| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out521287948| ~y$r_buff0_thd0~0_In521287948)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In521287948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521287948} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out521287948|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521287948, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In521287948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:03:15,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2131150465 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2131150465 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2131150465 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2131150465 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2131150465|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In2131150465 |ULTIMATE.start_main_#t~ite62_Out2131150465|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2131150465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131150465, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131150465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131150465} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2131150465|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2131150465, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2131150465, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2131150465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2131150465} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:03:15,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_178 |v_ULTIMATE.start_main_#t~ite62_44|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_25 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_33 0) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_39 0) (= 1 v_~__unbuffered_p0_EAX~0_52))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_43|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_33, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_178, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~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:03:16,111 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:03:16,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:03:16,113 INFO L168 Benchmark]: Toolchain (without parser) took 27477.74 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -233.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-28 18:03:16,114 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:03:16,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:16,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.42 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:16,115 INFO L168 Benchmark]: Boogie Preprocessor took 82.56 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:03:16,116 INFO L168 Benchmark]: RCFGBuilder took 903.09 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:16,116 INFO L168 Benchmark]: TraceAbstraction took 25300.42 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-28 18:03:16,117 INFO L168 Benchmark]: Witness Printer took 172.25 ms. Allocated memory is still 2.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:16,119 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 899.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -135.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.42 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.56 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 903.09 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25300.42 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -188.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 172.25 ms. Allocated memory is still 2.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 180 ProgramPointsBefore, 101 ProgramPointsAfterwards, 229 TransitionsBefore, 123 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 30 ChoiceCompositions, 9541 VarBasedMoverChecksPositive, 277 VarBasedMoverChecksNegative, 72 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 118733 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 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) [L781] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 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)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 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)) [L783] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 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)) [L784] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 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)) [L786] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 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)) [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 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 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2702 SDtfs, 2982 SDslu, 4982 SDs, 0 SdLazy, 2734 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53845occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23194 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 129781 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...