/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:25:46,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:25:46,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:25:46,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:25:46,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:25:46,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:25:46,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:25:46,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:25:46,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:25:46,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:25:46,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:25:46,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:25:46,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:25:46,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:25:46,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:25:46,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:25:46,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:25:46,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:25:46,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:25:46,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:25:46,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:25:46,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:25:46,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:25:46,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:25:46,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:25:46,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:25:46,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:25:46,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:25:46,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:25:46,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:25:46,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:25:46,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:25:46,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:25:46,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:25:46,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:25:46,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:25:46,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:25:46,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:25:46,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:25:46,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:25:46,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:25:46,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:25:46,259 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:25:46,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:25:46,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:25:46,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:25:46,261 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:25:46,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:25:46,262 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:25:46,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:25:46,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:25:46,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:25:46,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:25:46,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:25:46,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:25:46,263 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:25:46,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:25:46,263 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:25:46,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:25:46,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:25:46,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:25:46,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:25:46,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:25:46,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:25:46,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:25:46,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:25:46,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:25:46,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:25:46,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:25:46,266 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:25:46,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:25:46,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:25:46,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:25:46,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:25:46,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:25:46,559 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:25:46,559 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:25:46,560 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2020-10-11 18:25:46,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0237e76/cc21a103a86f420b8dcce5589b43c020/FLAG5796d3780 [2020-10-11 18:25:47,240 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:25:47,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2020-10-11 18:25:47,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0237e76/cc21a103a86f420b8dcce5589b43c020/FLAG5796d3780 [2020-10-11 18:25:47,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0237e76/cc21a103a86f420b8dcce5589b43c020 [2020-10-11 18:25:47,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:25:47,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:25:47,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:47,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:25:47,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:25:47,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:47" (1/1) ... [2020-10-11 18:25:47,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:47, skipping insertion in model container [2020-10-11 18:25:47,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:25:47" (1/1) ... [2020-10-11 18:25:47,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:25:47,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:25:48,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:48,131 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:25:48,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:25:48,259 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:25:48,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48 WrapperNode [2020-10-11 18:25:48,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:25:48,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:48,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:25:48,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:25:48,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:25:48,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:25:48,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:25:48,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:25:48,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (1/1) ... [2020-10-11 18:25:48,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:25:48,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:25:48,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:25:48,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:25:48,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (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 [2020-10-11 18:25:48,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:25:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:25:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:25:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:25:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:25:48,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:25:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:25:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:25:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:25:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:25:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:25:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:25:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:25:48,451 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:25:50,283 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:25:50,284 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:25:50,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:50 BoogieIcfgContainer [2020-10-11 18:25:50,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:25:50,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:25:50,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:25:50,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:25:50,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:25:47" (1/3) ... [2020-10-11 18:25:50,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f57612a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:50, skipping insertion in model container [2020-10-11 18:25:50,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:25:48" (2/3) ... [2020-10-11 18:25:50,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f57612a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:25:50, skipping insertion in model container [2020-10-11 18:25:50,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:25:50" (3/3) ... [2020-10-11 18:25:50,294 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt.i [2020-10-11 18:25:50,305 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:25:50,312 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:25:50,313 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:25:50,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,346 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,346 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,354 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:25:50,380 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:25:50,400 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:25:50,401 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:25:50,401 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:25:50,401 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:25:50,401 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:25:50,401 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:25:50,401 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:25:50,401 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:25:50,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-11 18:25:50,459 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-11 18:25:50,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:50,464 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:25:50,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 197 flow [2020-10-11 18:25:50,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2020-10-11 18:25:50,488 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:25:50,489 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:50,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:50,490 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:50,491 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1064364671, now seen corresponding path program 1 times [2020-10-11 18:25:50,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:50,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602639279] [2020-10-11 18:25:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:50,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602639279] [2020-10-11 18:25:50,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:50,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:25:50,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691436715] [2020-10-11 18:25:50,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:25:50,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:25:50,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:25:51,007 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 91 [2020-10-11 18:25:51,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states. [2020-10-11 18:25:51,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:51,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 91 [2020-10-11 18:25:51,011 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:51,077 INFO L129 PetriNetUnfolder]: 0/85 cut-off events. [2020-10-11 18:25:51,077 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:51,077 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 0/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:25:51,079 INFO L132 encePairwiseOnDemand]: 86/91 looper letters, 0 selfloop transitions, 2 changer transitions 11/85 dead transitions. [2020-10-11 18:25:51,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 85 transitions, 183 flow [2020-10-11 18:25:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:25:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:25:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2020-10-11 18:25:51,096 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9706959706959707 [2020-10-11 18:25:51,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2020-10-11 18:25:51,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2020-10-11 18:25:51,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:51,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2020-10-11 18:25:51,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:25:51,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:25:51,113 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:25:51,115 INFO L185 Difference]: Start difference. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states and 265 transitions. [2020-10-11 18:25:51,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 85 transitions, 183 flow [2020-10-11 18:25:51,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:25:51,124 INFO L241 Difference]: Finished difference. Result has 94 places, 74 transitions, 158 flow [2020-10-11 18:25:51,127 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2020-10-11 18:25:51,128 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2020-10-11 18:25:51,129 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 158 flow [2020-10-11 18:25:51,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:25:51,129 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:51,129 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:51,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:25:51,130 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1361861819, now seen corresponding path program 1 times [2020-10-11 18:25:51,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:51,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078326865] [2020-10-11 18:25:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:51,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078326865] [2020-10-11 18:25:51,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:51,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:51,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836944079] [2020-10-11 18:25:51,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:51,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:51,576 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2020-10-11 18:25:51,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 158 flow. Second operand 6 states. [2020-10-11 18:25:51,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:51,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2020-10-11 18:25:51,577 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:51,727 INFO L129 PetriNetUnfolder]: 24/170 cut-off events. [2020-10-11 18:25:51,727 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:25:51,728 INFO L80 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 170 events. 24/170 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 568 event pairs, 5 based on Foata normal form. 4/172 useless extension candidates. Maximal degree in co-relation 205. Up to 31 conditions per place. [2020-10-11 18:25:51,729 INFO L132 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 19/95 dead transitions. [2020-10-11 18:25:51,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 260 flow [2020-10-11 18:25:51,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2020-10-11 18:25:51,736 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9181929181929182 [2020-10-11 18:25:51,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 752 transitions. [2020-10-11 18:25:51,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 752 transitions. [2020-10-11 18:25:51,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:51,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 752 transitions. [2020-10-11 18:25:51,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:51,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:51,745 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:51,745 INFO L185 Difference]: Start difference. First operand has 94 places, 74 transitions, 158 flow. Second operand 9 states and 752 transitions. [2020-10-11 18:25:51,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 260 flow [2020-10-11 18:25:51,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:25:51,749 INFO L241 Difference]: Finished difference. Result has 96 places, 76 transitions, 197 flow [2020-10-11 18:25:51,749 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=96, PETRI_TRANSITIONS=76} [2020-10-11 18:25:51,750 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 0 predicate places. [2020-10-11 18:25:51,750 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 197 flow [2020-10-11 18:25:51,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:51,751 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:51,751 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:51,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:25:51,751 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1452302852, now seen corresponding path program 1 times [2020-10-11 18:25:51,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:51,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137798306] [2020-10-11 18:25:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:52,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137798306] [2020-10-11 18:25:52,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:52,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:25:52,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899142901] [2020-10-11 18:25:52,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:25:52,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:25:52,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:25:52,665 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2020-10-11 18:25:52,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 197 flow. Second operand 10 states. [2020-10-11 18:25:52,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:52,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2020-10-11 18:25:52,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:53,158 INFO L129 PetriNetUnfolder]: 282/716 cut-off events. [2020-10-11 18:25:53,159 INFO L130 PetriNetUnfolder]: For 557/557 co-relation queries the response was YES. [2020-10-11 18:25:53,165 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 716 events. 282/716 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4384 event pairs, 107 based on Foata normal form. 21/712 useless extension candidates. Maximal degree in co-relation 1566. Up to 258 conditions per place. [2020-10-11 18:25:53,170 INFO L132 encePairwiseOnDemand]: 79/91 looper letters, 12 selfloop transitions, 10 changer transitions 34/117 dead transitions. [2020-10-11 18:25:53,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 117 transitions, 419 flow [2020-10-11 18:25:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:25:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:25:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1154 transitions. [2020-10-11 18:25:53,175 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8454212454212454 [2020-10-11 18:25:53,175 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1154 transitions. [2020-10-11 18:25:53,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1154 transitions. [2020-10-11 18:25:53,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:53,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1154 transitions. [2020-10-11 18:25:53,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:25:53,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:25:53,183 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:25:53,183 INFO L185 Difference]: Start difference. First operand has 96 places, 76 transitions, 197 flow. Second operand 15 states and 1154 transitions. [2020-10-11 18:25:53,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 117 transitions, 419 flow [2020-10-11 18:25:53,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 117 transitions, 398 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-11 18:25:53,191 INFO L241 Difference]: Finished difference. Result has 111 places, 82 transitions, 274 flow [2020-10-11 18:25:53,191 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=274, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2020-10-11 18:25:53,191 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2020-10-11 18:25:53,192 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 274 flow [2020-10-11 18:25:53,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:25:53,192 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:53,192 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:53,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:25:53,193 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -33637938, now seen corresponding path program 1 times [2020-10-11 18:25:53,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:53,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818237520] [2020-10-11 18:25:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:53,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818237520] [2020-10-11 18:25:53,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:53,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:25:53,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252137902] [2020-10-11 18:25:53,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:25:53,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:25:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:25:54,099 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2020-10-11 18:25:54,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 274 flow. Second operand 9 states. [2020-10-11 18:25:54,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:54,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2020-10-11 18:25:54,101 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:54,495 INFO L129 PetriNetUnfolder]: 215/513 cut-off events. [2020-10-11 18:25:54,495 INFO L130 PetriNetUnfolder]: For 1606/1627 co-relation queries the response was YES. [2020-10-11 18:25:54,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1865 conditions, 513 events. 215/513 cut-off events. For 1606/1627 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2685 event pairs, 34 based on Foata normal form. 15/511 useless extension candidates. Maximal degree in co-relation 1802. Up to 209 conditions per place. [2020-10-11 18:25:54,503 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 22 selfloop transitions, 7 changer transitions 25/116 dead transitions. [2020-10-11 18:25:54,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 618 flow [2020-10-11 18:25:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:25:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:25:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1088 transitions. [2020-10-11 18:25:54,508 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8540031397174255 [2020-10-11 18:25:54,508 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1088 transitions. [2020-10-11 18:25:54,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1088 transitions. [2020-10-11 18:25:54,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:54,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1088 transitions. [2020-10-11 18:25:54,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:25:54,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:25:54,514 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:25:54,514 INFO L185 Difference]: Start difference. First operand has 111 places, 82 transitions, 274 flow. Second operand 14 states and 1088 transitions. [2020-10-11 18:25:54,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 618 flow [2020-10-11 18:25:54,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 590 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-11 18:25:54,522 INFO L241 Difference]: Finished difference. Result has 120 places, 84 transitions, 321 flow [2020-10-11 18:25:54,522 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=321, PETRI_PLACES=120, PETRI_TRANSITIONS=84} [2020-10-11 18:25:54,523 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2020-10-11 18:25:54,523 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 84 transitions, 321 flow [2020-10-11 18:25:54,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:25:54,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:54,523 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:54,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:25:54,524 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:54,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1958184037, now seen corresponding path program 1 times [2020-10-11 18:25:54,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:54,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824706736] [2020-10-11 18:25:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:54,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824706736] [2020-10-11 18:25:54,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:54,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:25:54,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764532035] [2020-10-11 18:25:54,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:25:54,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:25:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:25:56,943 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:25:56,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 84 transitions, 321 flow. Second operand 13 states. [2020-10-11 18:25:56,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:56,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:25:56,945 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:57,729 INFO L129 PetriNetUnfolder]: 189/592 cut-off events. [2020-10-11 18:25:57,729 INFO L130 PetriNetUnfolder]: For 3130/3223 co-relation queries the response was YES. [2020-10-11 18:25:57,734 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 592 events. 189/592 cut-off events. For 3130/3223 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3600 event pairs, 13 based on Foata normal form. 22/597 useless extension candidates. Maximal degree in co-relation 2294. Up to 119 conditions per place. [2020-10-11 18:25:57,739 INFO L132 encePairwiseOnDemand]: 79/91 looper letters, 17 selfloop transitions, 12 changer transitions 23/113 dead transitions. [2020-10-11 18:25:57,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 113 transitions, 725 flow [2020-10-11 18:25:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:25:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:25:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1347 transitions. [2020-10-11 18:25:57,746 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8223443223443223 [2020-10-11 18:25:57,746 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1347 transitions. [2020-10-11 18:25:57,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1347 transitions. [2020-10-11 18:25:57,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:57,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1347 transitions. [2020-10-11 18:25:57,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:25:57,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:25:57,762 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:25:57,762 INFO L185 Difference]: Start difference. First operand has 120 places, 84 transitions, 321 flow. Second operand 18 states and 1347 transitions. [2020-10-11 18:25:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 113 transitions, 725 flow [2020-10-11 18:25:57,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 113 transitions, 652 flow, removed 32 selfloop flow, removed 8 redundant places. [2020-10-11 18:25:57,774 INFO L241 Difference]: Finished difference. Result has 131 places, 85 transitions, 365 flow [2020-10-11 18:25:57,775 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=365, PETRI_PLACES=131, PETRI_TRANSITIONS=85} [2020-10-11 18:25:57,775 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2020-10-11 18:25:57,775 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 85 transitions, 365 flow [2020-10-11 18:25:57,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:25:57,775 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:57,775 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:57,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:25:57,776 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1309483742, now seen corresponding path program 1 times [2020-10-11 18:25:57,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:57,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72300552] [2020-10-11 18:25:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:58,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72300552] [2020-10-11 18:25:58,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:58,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:25:58,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319620978] [2020-10-11 18:25:58,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:25:58,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:58,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:25:58,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:25:58,676 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:25:58,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 85 transitions, 365 flow. Second operand 11 states. [2020-10-11 18:25:58,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:58,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:25:58,678 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:59,091 INFO L129 PetriNetUnfolder]: 151/549 cut-off events. [2020-10-11 18:25:59,091 INFO L130 PetriNetUnfolder]: For 3536/3566 co-relation queries the response was YES. [2020-10-11 18:25:59,097 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 549 events. 151/549 cut-off events. For 3536/3566 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3483 event pairs, 30 based on Foata normal form. 24/554 useless extension candidates. Maximal degree in co-relation 2130. Up to 149 conditions per place. [2020-10-11 18:25:59,100 INFO L132 encePairwiseOnDemand]: 79/91 looper letters, 15 selfloop transitions, 11 changer transitions 23/109 dead transitions. [2020-10-11 18:25:59,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 109 transitions, 721 flow [2020-10-11 18:25:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:25:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:25:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1054 transitions. [2020-10-11 18:25:59,105 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8273155416012559 [2020-10-11 18:25:59,105 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1054 transitions. [2020-10-11 18:25:59,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1054 transitions. [2020-10-11 18:25:59,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:59,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1054 transitions. [2020-10-11 18:25:59,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:25:59,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:25:59,112 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:25:59,112 INFO L185 Difference]: Start difference. First operand has 131 places, 85 transitions, 365 flow. Second operand 14 states and 1054 transitions. [2020-10-11 18:25:59,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 109 transitions, 721 flow [2020-10-11 18:25:59,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 109 transitions, 609 flow, removed 51 selfloop flow, removed 17 redundant places. [2020-10-11 18:25:59,124 INFO L241 Difference]: Finished difference. Result has 125 places, 85 transitions, 364 flow [2020-10-11 18:25:59,124 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=364, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2020-10-11 18:25:59,125 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 29 predicate places. [2020-10-11 18:25:59,125 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 364 flow [2020-10-11 18:25:59,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:25:59,125 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:59,126 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-11 18:25:59,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:25:59,126 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:59,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1187129503, now seen corresponding path program 1 times [2020-10-11 18:25:59,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:59,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995978160] [2020-10-11 18:25:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:59,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995978160] [2020-10-11 18:25:59,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:59,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:25:59,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946696930] [2020-10-11 18:25:59,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:25:59,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:59,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:25:59,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:25:59,377 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:25:59,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 364 flow. Second operand 6 states. [2020-10-11 18:25:59,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:59,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:25:59,378 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:25:59,653 INFO L129 PetriNetUnfolder]: 349/972 cut-off events. [2020-10-11 18:25:59,654 INFO L130 PetriNetUnfolder]: For 2157/2183 co-relation queries the response was YES. [2020-10-11 18:25:59,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 972 events. 349/972 cut-off events. For 2157/2183 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6910 event pairs, 46 based on Foata normal form. 26/927 useless extension candidates. Maximal degree in co-relation 2573. Up to 240 conditions per place. [2020-10-11 18:25:59,668 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 19 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2020-10-11 18:25:59,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 110 transitions, 484 flow [2020-10-11 18:25:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:25:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:25:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 739 transitions. [2020-10-11 18:25:59,672 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2020-10-11 18:25:59,672 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 739 transitions. [2020-10-11 18:25:59,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 739 transitions. [2020-10-11 18:25:59,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:25:59,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 739 transitions. [2020-10-11 18:25:59,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:25:59,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:25:59,677 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:25:59,677 INFO L185 Difference]: Start difference. First operand has 125 places, 85 transitions, 364 flow. Second operand 9 states and 739 transitions. [2020-10-11 18:25:59,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 110 transitions, 484 flow [2020-10-11 18:25:59,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 445 flow, removed 11 selfloop flow, removed 12 redundant places. [2020-10-11 18:25:59,685 INFO L241 Difference]: Finished difference. Result has 120 places, 99 transitions, 436 flow [2020-10-11 18:25:59,686 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=436, PETRI_PLACES=120, PETRI_TRANSITIONS=99} [2020-10-11 18:25:59,686 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2020-10-11 18:25:59,686 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 99 transitions, 436 flow [2020-10-11 18:25:59,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:25:59,686 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:25:59,687 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:25:59,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:25:59,687 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:25:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:25:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1282505755, now seen corresponding path program 1 times [2020-10-11 18:25:59,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:25:59,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561505596] [2020-10-11 18:25:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:25:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:25:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:25:59,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561505596] [2020-10-11 18:25:59,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:25:59,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:25:59,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141533420] [2020-10-11 18:25:59,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:25:59,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:25:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:25:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:25:59,993 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:25:59,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 99 transitions, 436 flow. Second operand 7 states. [2020-10-11 18:25:59,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:25:59,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:25:59,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:00,323 INFO L129 PetriNetUnfolder]: 268/805 cut-off events. [2020-10-11 18:26:00,324 INFO L130 PetriNetUnfolder]: For 2026/3163 co-relation queries the response was YES. [2020-10-11 18:26:00,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 805 events. 268/805 cut-off events. For 2026/3163 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 5708 event pairs, 20 based on Foata normal form. 134/876 useless extension candidates. Maximal degree in co-relation 2645. Up to 270 conditions per place. [2020-10-11 18:26:00,336 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 15 selfloop transitions, 31 changer transitions 6/124 dead transitions. [2020-10-11 18:26:00,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 701 flow [2020-10-11 18:26:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:26:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:26:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 986 transitions. [2020-10-11 18:26:00,340 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2020-10-11 18:26:00,340 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 986 transitions. [2020-10-11 18:26:00,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 986 transitions. [2020-10-11 18:26:00,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:00,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 986 transitions. [2020-10-11 18:26:00,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:26:00,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:26:00,346 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:26:00,346 INFO L185 Difference]: Start difference. First operand has 120 places, 99 transitions, 436 flow. Second operand 12 states and 986 transitions. [2020-10-11 18:26:00,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 701 flow [2020-10-11 18:26:00,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 124 transitions, 689 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-11 18:26:00,354 INFO L241 Difference]: Finished difference. Result has 131 places, 115 transitions, 634 flow [2020-10-11 18:26:00,354 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=634, PETRI_PLACES=131, PETRI_TRANSITIONS=115} [2020-10-11 18:26:00,355 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2020-10-11 18:26:00,355 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 115 transitions, 634 flow [2020-10-11 18:26:00,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:26:00,355 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:00,355 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:00,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:26:00,356 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash -12921326, now seen corresponding path program 1 times [2020-10-11 18:26:00,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:00,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844574422] [2020-10-11 18:26:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:00,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844574422] [2020-10-11 18:26:00,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:00,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:00,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788416992] [2020-10-11 18:26:00,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:00,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:00,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:00,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:00,568 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2020-10-11 18:26:00,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 115 transitions, 634 flow. Second operand 6 states. [2020-10-11 18:26:00,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:00,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2020-10-11 18:26:00,569 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:00,863 INFO L129 PetriNetUnfolder]: 284/1030 cut-off events. [2020-10-11 18:26:00,863 INFO L130 PetriNetUnfolder]: For 3760/4651 co-relation queries the response was YES. [2020-10-11 18:26:00,870 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3597 conditions, 1030 events. 284/1030 cut-off events. For 3760/4651 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8319 event pairs, 16 based on Foata normal form. 16/968 useless extension candidates. Maximal degree in co-relation 3524. Up to 320 conditions per place. [2020-10-11 18:26:00,874 INFO L132 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 3 changer transitions 14/129 dead transitions. [2020-10-11 18:26:00,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 129 transitions, 790 flow [2020-10-11 18:26:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2020-10-11 18:26:00,877 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9108669108669109 [2020-10-11 18:26:00,877 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 746 transitions. [2020-10-11 18:26:00,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 746 transitions. [2020-10-11 18:26:00,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:00,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 746 transitions. [2020-10-11 18:26:00,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:00,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:00,882 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:00,882 INFO L185 Difference]: Start difference. First operand has 131 places, 115 transitions, 634 flow. Second operand 9 states and 746 transitions. [2020-10-11 18:26:00,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 129 transitions, 790 flow [2020-10-11 18:26:00,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 129 transitions, 668 flow, removed 48 selfloop flow, removed 6 redundant places. [2020-10-11 18:26:00,902 INFO L241 Difference]: Finished difference. Result has 140 places, 111 transitions, 518 flow [2020-10-11 18:26:00,903 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=140, PETRI_TRANSITIONS=111} [2020-10-11 18:26:00,903 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2020-10-11 18:26:00,903 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 111 transitions, 518 flow [2020-10-11 18:26:00,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:00,903 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:00,903 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:00,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:26:00,904 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 933061678, now seen corresponding path program 1 times [2020-10-11 18:26:00,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:00,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764602644] [2020-10-11 18:26:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:01,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764602644] [2020-10-11 18:26:01,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:01,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:26:01,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178498513] [2020-10-11 18:26:01,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:26:01,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:26:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:26:01,217 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:26:01,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 111 transitions, 518 flow. Second operand 8 states. [2020-10-11 18:26:01,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:01,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:26:01,219 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:01,619 INFO L129 PetriNetUnfolder]: 255/901 cut-off events. [2020-10-11 18:26:01,619 INFO L130 PetriNetUnfolder]: For 1157/2222 co-relation queries the response was YES. [2020-10-11 18:26:01,626 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 901 events. 255/901 cut-off events. For 1157/2222 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7452 event pairs, 0 based on Foata normal form. 178/999 useless extension candidates. Maximal degree in co-relation 2562. Up to 164 conditions per place. [2020-10-11 18:26:01,628 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 10 selfloop transitions, 32 changer transitions 18/130 dead transitions. [2020-10-11 18:26:01,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 130 transitions, 732 flow [2020-10-11 18:26:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:26:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:26:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1217 transitions. [2020-10-11 18:26:01,632 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8915750915750916 [2020-10-11 18:26:01,633 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1217 transitions. [2020-10-11 18:26:01,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1217 transitions. [2020-10-11 18:26:01,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:01,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1217 transitions. [2020-10-11 18:26:01,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:26:01,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:26:01,640 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:26:01,640 INFO L185 Difference]: Start difference. First operand has 140 places, 111 transitions, 518 flow. Second operand 15 states and 1217 transitions. [2020-10-11 18:26:01,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 130 transitions, 732 flow [2020-10-11 18:26:01,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 660 flow, removed 33 selfloop flow, removed 17 redundant places. [2020-10-11 18:26:01,649 INFO L241 Difference]: Finished difference. Result has 137 places, 109 transitions, 538 flow [2020-10-11 18:26:01,650 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=538, PETRI_PLACES=137, PETRI_TRANSITIONS=109} [2020-10-11 18:26:01,650 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 41 predicate places. [2020-10-11 18:26:01,650 INFO L481 AbstractCegarLoop]: Abstraction has has 137 places, 109 transitions, 538 flow [2020-10-11 18:26:01,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:26:01,651 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:01,651 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:01,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:26:01,651 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1144707436, now seen corresponding path program 1 times [2020-10-11 18:26:01,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:01,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266408519] [2020-10-11 18:26:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:26:01,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266408519] [2020-10-11 18:26:01,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:01,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:26:01,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405217010] [2020-10-11 18:26:01,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:26:01,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:01,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:26:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:26:01,964 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2020-10-11 18:26:01,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 109 transitions, 538 flow. Second operand 7 states. [2020-10-11 18:26:01,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:01,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2020-10-11 18:26:01,967 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:02,177 INFO L129 PetriNetUnfolder]: 151/711 cut-off events. [2020-10-11 18:26:02,179 INFO L130 PetriNetUnfolder]: For 1471/1638 co-relation queries the response was YES. [2020-10-11 18:26:02,182 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 711 events. 151/711 cut-off events. For 1471/1638 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5733 event pairs, 0 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 1952. Up to 114 conditions per place. [2020-10-11 18:26:02,183 INFO L132 encePairwiseOnDemand]: 85/91 looper letters, 9 selfloop transitions, 1 changer transitions 34/114 dead transitions. [2020-10-11 18:26:02,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 114 transitions, 582 flow [2020-10-11 18:26:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:26:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:26:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 569 transitions. [2020-10-11 18:26:02,185 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8932496075353218 [2020-10-11 18:26:02,185 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 569 transitions. [2020-10-11 18:26:02,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 569 transitions. [2020-10-11 18:26:02,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:02,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 569 transitions. [2020-10-11 18:26:02,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:26:02,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:26:02,188 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:26:02,188 INFO L185 Difference]: Start difference. First operand has 137 places, 109 transitions, 538 flow. Second operand 7 states and 569 transitions. [2020-10-11 18:26:02,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 114 transitions, 582 flow [2020-10-11 18:26:02,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 114 transitions, 510 flow, removed 8 selfloop flow, removed 16 redundant places. [2020-10-11 18:26:02,199 INFO L241 Difference]: Finished difference. Result has 130 places, 80 transitions, 274 flow [2020-10-11 18:26:02,199 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=130, PETRI_TRANSITIONS=80} [2020-10-11 18:26:02,200 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 34 predicate places. [2020-10-11 18:26:02,200 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 80 transitions, 274 flow [2020-10-11 18:26:02,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:26:02,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:02,200 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:26:02,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:26:02,200 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:26:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1147866130, now seen corresponding path program 2 times [2020-10-11 18:26:02,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:02,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404743196] [2020-10-11 18:26:02,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:26:02,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:26:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:26:02,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:26:02,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:26:02,403 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:26:02,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:26:02,444 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,445 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,445 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,448 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,448 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,448 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,448 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,451 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,452 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,452 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,452 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,452 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,453 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,463 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:26:02,463 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:26:02,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:26:02 BasicIcfg [2020-10-11 18:26:02,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:26:02,572 INFO L168 Benchmark]: Toolchain (without parser) took 15094.12 ms. Allocated memory was 252.7 MB in the beginning and 609.7 MB in the end (delta: 357.0 MB). Free memory was 208.7 MB in the beginning and 506.0 MB in the end (delta: -297.4 MB). Peak memory consumption was 59.7 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:02,572 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:26:02,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.65 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 208.7 MB in the beginning and 269.0 MB in the end (delta: -60.3 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:02,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.90 ms. Allocated memory is still 318.8 MB. Free memory was 269.0 MB in the beginning and 266.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:02,575 INFO L168 Benchmark]: Boogie Preprocessor took 43.12 ms. Allocated memory is still 318.8 MB. Free memory was 266.5 MB in the beginning and 263.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:02,575 INFO L168 Benchmark]: RCFGBuilder took 1906.25 ms. Allocated memory was 318.8 MB in the beginning and 361.2 MB in the end (delta: 42.5 MB). Free memory was 263.9 MB in the beginning and 217.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. [2020-10-11 18:26:02,576 INFO L168 Benchmark]: TraceAbstraction took 12282.46 ms. Allocated memory was 361.2 MB in the beginning and 609.7 MB in the end (delta: 248.5 MB). Free memory was 217.8 MB in the beginning and 506.0 MB in the end (delta: -288.3 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:26:02,580 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 782.65 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 208.7 MB in the beginning and 269.0 MB in the end (delta: -60.3 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 74.90 ms. Allocated memory is still 318.8 MB. Free memory was 269.0 MB in the beginning and 266.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.12 ms. Allocated memory is still 318.8 MB. Free memory was 266.5 MB in the beginning and 263.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1906.25 ms. Allocated memory was 318.8 MB in the beginning and 361.2 MB in the end (delta: 42.5 MB). Free memory was 263.9 MB in the beginning and 217.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12282.46 ms. Allocated memory was 361.2 MB in the beginning and 609.7 MB in the end (delta: 248.5 MB). Free memory was 217.8 MB in the beginning and 506.0 MB in the end (delta: -288.3 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L712] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L717] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L718] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L719] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L720] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L721] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L722] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t1498; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK 0 pthread_create(&t1498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1499; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t1499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t1500; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t1500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 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) [L751] 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) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 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 [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 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) [L813] 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) [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 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 [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 283 SDtfs, 451 SDslu, 1226 SDs, 0 SdLazy, 1243 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 172785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...