/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065
[2021-06-10 12:21:08,775 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-10 12:21:08,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-10 12:21:08,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-10 12:21:08,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-10 12:21:08,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-10 12:21:08,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-10 12:21:08,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-10 12:21:08,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-10 12:21:08,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-10 12:21:08,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-10 12:21:08,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-10 12:21:08,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-10 12:21:08,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-10 12:21:08,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-10 12:21:08,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-10 12:21:08,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-10 12:21:08,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-10 12:21:08,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-10 12:21:08,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-10 12:21:08,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-10 12:21:08,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-10 12:21:08,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-10 12:21:08,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-10 12:21:08,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-10 12:21:08,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-10 12:21:08,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-10 12:21:08,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-10 12:21:08,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-10 12:21:08,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-10 12:21:08,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-10 12:21:08,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-10 12:21:08,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-10 12:21:08,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-10 12:21:08,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-10 12:21:08,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-10 12:21:08,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-10 12:21:08,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-10 12:21:08,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-10 12:21:08,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-10 12:21:08,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-10 12:21:08,817 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf
[2021-06-10 12:21:08,831 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-10 12:21:08,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-10 12:21:08,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-10 12:21:08,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-10 12:21:08,832 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-10 12:21:08,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-10 12:21:08,832 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-10 12:21:08,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-10 12:21:08,832 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-10 12:21:08,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-10 12:21:08,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-10 12:21:08,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 12:21:08,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-06-10 12:21:08,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-10 12:21:09,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-10 12:21:09,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-10 12:21:09,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-10 12:21:09,092 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-10 12:21:09,093 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-10 12:21:09,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i
[2021-06-10 12:21:09,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beba8937e/5fa391702a58480fba3c2756033362fb/FLAG08c7a2396
[2021-06-10 12:21:09,597 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-10 12:21:09,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i
[2021-06-10 12:21:09,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beba8937e/5fa391702a58480fba3c2756033362fb/FLAG08c7a2396
[2021-06-10 12:21:09,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beba8937e/5fa391702a58480fba3c2756033362fb
[2021-06-10 12:21:09,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-10 12:21:09,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-10 12:21:09,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-10 12:21:09,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-10 12:21:09,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-10 12:21:09,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:21:09" (1/1) ...
[2021-06-10 12:21:09,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423bce25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:09, skipping insertion in model container
[2021-06-10 12:21:09,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:21:09" (1/1) ...
[2021-06-10 12:21:09,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-10 12:21:09,683 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-10 12:21:09,860 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i[950,963]
[2021-06-10 12:21:10,019 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 12:21:10,025 INFO L203 MainTranslator]: Completed pre-run
[2021-06-10 12:21:10,032 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i[950,963]
[2021-06-10 12:21:10,057 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 12:21:10,115 INFO L208 MainTranslator]: Completed translation
[2021-06-10 12:21:10,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10 WrapperNode
[2021-06-10 12:21:10,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-10 12:21:10,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-10 12:21:10,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-10 12:21:10,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-10 12:21:10,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-10 12:21:10,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-10 12:21:10,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-10 12:21:10,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-10 12:21:10,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (1/1) ...
[2021-06-10 12:21:10,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-10 12:21:10,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-10 12:21:10,203 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-10 12:21:10,203 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-10 12:21:10,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (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
[2021-06-10 12:21:10,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-10 12:21:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-10 12:21:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-10 12:21:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-10 12:21:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-10 12:21:10,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-10 12:21:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-10 12:21:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-10 12:21:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-10 12:21:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-10 12:21:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-10 12:21:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-10 12:21:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-10 12:21:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-10 12:21:10,282 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-10 12:21:11,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-10 12:21:11,544 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-10 12:21:11,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:21:11 BoogieIcfgContainer
[2021-06-10 12:21:11,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-10 12:21:11,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-10 12:21:11,546 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-10 12:21:11,548 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-10 12:21:11,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:21:09" (1/3) ...
[2021-06-10 12:21:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296209de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:21:11, skipping insertion in model container
[2021-06-10 12:21:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:21:10" (2/3) ...
[2021-06-10 12:21:11,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296209de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:21:11, skipping insertion in model container
[2021-06-10 12:21:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:21:11" (3/3) ...
[2021-06-10 12:21:11,550 INFO L111 eAbstractionObserver]: Analyzing ICFG podwr001_tso.opt.i
[2021-06-10 12:21:11,554 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-10 12:21:11,557 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-06-10 12:21:11,557 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-10 12:21:11,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,587 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:21:11,606 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-10 12:21:11,617 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-06-10 12:21:11,630 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-06-10 12:21:11,630 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-06-10 12:21:11,630 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-10 12:21:11,630 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-10 12:21:11,630 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-10 12:21:11,630 INFO L381 AbstractCegarLoop]: Difference is false
[2021-06-10 12:21:11,630 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-10 12:21:11,630 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-06-10 12:21:11,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow
[2021-06-10 12:21:11,659 INFO L129 PetriNetUnfolder]: 2/96 cut-off events.
[2021-06-10 12:21:11,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:21:11,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place.
[2021-06-10 12:21:11,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow
[2021-06-10 12:21:11,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow
[2021-06-10 12:21:11,669 INFO L129 PetriNetUnfolder]: 0/41 cut-off events.
[2021-06-10 12:21:11,669 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:21:11,669 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:11,670 INFO L263 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]
[2021-06-10 12:21:11,670 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:11,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1705594515, now seen corresponding path program 1 times
[2021-06-10 12:21:11,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:11,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657417417]
[2021-06-10 12:21:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:11,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:11,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:11,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:11,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:11,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657417417]
[2021-06-10 12:21:11,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:11,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-10 12:21:11,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179947028]
[2021-06-10 12:21:11,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-10 12:21:11,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:11,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-10 12:21:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-10 12:21:11,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 99
[2021-06-10 12:21:11,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 96 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:11,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:11,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 99
[2021-06-10 12:21:11,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:11,902 INFO L129 PetriNetUnfolder]: 49/229 cut-off events.
[2021-06-10 12:21:11,902 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:21:11,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 229 events. 49/229 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 937 event pairs, 9 based on Foata normal form. 23/238 useless extension candidates. Maximal degree in co-relation 278. Up to 65 conditions per place.
[2021-06-10 12:21:11,905 INFO L132 encePairwiseOnDemand]: 94/99 looper letters, 9 selfloop transitions, 2 changer transitions 0/96 dead transitions.
[2021-06-10 12:21:11,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 96 transitions, 223 flow
[2021-06-10 12:21:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-10 12:21:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-10 12:21:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions.
[2021-06-10 12:21:11,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9427609427609428
[2021-06-10 12:21:11,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions.
[2021-06-10 12:21:11,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions.
[2021-06-10 12:21:11,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:11,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions.
[2021-06-10 12:21:11,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:11,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:11,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:11,924 INFO L185 Difference]: Start difference. First operand has 104 places, 96 transitions, 201 flow. Second operand 3 states and 280 transitions.
[2021-06-10 12:21:11,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 96 transitions, 223 flow
[2021-06-10 12:21:11,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-06-10 12:21:11,929 INFO L241 Difference]: Finished difference. Result has 101 places, 92 transitions, 194 flow
[2021-06-10 12:21:11,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=101, PETRI_TRANSITIONS=92}
[2021-06-10 12:21:11,931 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, -3 predicate places.
[2021-06-10 12:21:11,931 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 194 flow
[2021-06-10 12:21:11,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:11,931 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:11,931 INFO L263 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]
[2021-06-10 12:21:11,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-10 12:21:11,932 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash -797292975, now seen corresponding path program 1 times
[2021-06-10 12:21:11,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:11,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557442138]
[2021-06-10 12:21:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:12,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,031 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:21:12,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:21:12,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:21:12,054 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:21:12,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:12,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:12,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557442138]
[2021-06-10 12:21:12,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:12,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-10 12:21:12,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092835177]
[2021-06-10 12:21:12,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-10 12:21:12,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-10 12:21:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-10 12:21:12,067 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99
[2021-06-10 12:21:12,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:12,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99
[2021-06-10 12:21:12,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:12,208 INFO L129 PetriNetUnfolder]: 112/416 cut-off events.
[2021-06-10 12:21:12,208 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:21:12,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 416 events. 112/416 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1996 event pairs, 2 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 583. Up to 81 conditions per place.
[2021-06-10 12:21:12,211 INFO L132 encePairwiseOnDemand]: 89/99 looper letters, 10 selfloop transitions, 6 changer transitions 25/122 dead transitions.
[2021-06-10 12:21:12,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 122 transitions, 336 flow
[2021-06-10 12:21:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-10 12:21:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-06-10 12:21:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 893 transitions.
[2021-06-10 12:21:12,215 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.902020202020202
[2021-06-10 12:21:12,215 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 893 transitions.
[2021-06-10 12:21:12,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 893 transitions.
[2021-06-10 12:21:12,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:12,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 893 transitions.
[2021-06-10 12:21:12,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.3) internal successors, (893), 10 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,220 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,220 INFO L185 Difference]: Start difference. First operand has 101 places, 92 transitions, 194 flow. Second operand 10 states and 893 transitions.
[2021-06-10 12:21:12,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 122 transitions, 336 flow
[2021-06-10 12:21:12,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 122 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-10 12:21:12,223 INFO L241 Difference]: Finished difference. Result has 114 places, 94 transitions, 244 flow
[2021-06-10 12:21:12,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=114, PETRI_TRANSITIONS=94}
[2021-06-10 12:21:12,223 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 10 predicate places.
[2021-06-10 12:21:12,223 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 94 transitions, 244 flow
[2021-06-10 12:21:12,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,224 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:12,224 INFO L263 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]
[2021-06-10 12:21:12,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-10 12:21:12,224 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2074653581, now seen corresponding path program 1 times
[2021-06-10 12:21:12,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:12,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152531402]
[2021-06-10 12:21:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:12,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,319 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:21:12,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:21:12,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:21:12,341 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:21:12,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:12,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:12,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152531402]
[2021-06-10 12:21:12,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:12,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:21:12,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684426895]
[2021-06-10 12:21:12,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:21:12,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:12,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:21:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:21:12,352 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99
[2021-06-10 12:21:12,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 94 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:12,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99
[2021-06-10 12:21:12,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:12,510 INFO L129 PetriNetUnfolder]: 52/257 cut-off events.
[2021-06-10 12:21:12,511 INFO L130 PetriNetUnfolder]: For 281/293 co-relation queries the response was YES.
[2021-06-10 12:21:12,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 257 events. 52/257 cut-off events. For 281/293 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 883 event pairs, 0 based on Foata normal form. 12/263 useless extension candidates. Maximal degree in co-relation 581. Up to 75 conditions per place.
[2021-06-10 12:21:12,514 INFO L132 encePairwiseOnDemand]: 90/99 looper letters, 10 selfloop transitions, 9 changer transitions 19/119 dead transitions.
[2021-06-10 12:21:12,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 119 transitions, 497 flow
[2021-06-10 12:21:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-10 12:21:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-06-10 12:21:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 890 transitions.
[2021-06-10 12:21:12,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.898989898989899
[2021-06-10 12:21:12,516 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 890 transitions.
[2021-06-10 12:21:12,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 890 transitions.
[2021-06-10 12:21:12,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:12,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 890 transitions.
[2021-06-10 12:21:12,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,520 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,520 INFO L185 Difference]: Start difference. First operand has 114 places, 94 transitions, 244 flow. Second operand 10 states and 890 transitions.
[2021-06-10 12:21:12,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 119 transitions, 497 flow
[2021-06-10 12:21:12,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 119 transitions, 473 flow, removed 7 selfloop flow, removed 5 redundant places.
[2021-06-10 12:21:12,527 INFO L241 Difference]: Finished difference. Result has 118 places, 97 transitions, 312 flow
[2021-06-10 12:21:12,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=118, PETRI_TRANSITIONS=97}
[2021-06-10 12:21:12,527 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 14 predicate places.
[2021-06-10 12:21:12,527 INFO L480 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 312 flow
[2021-06-10 12:21:12,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,528 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:12,528 INFO L263 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, 1, 1]
[2021-06-10 12:21:12,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-10 12:21:12,528 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 194139735, now seen corresponding path program 1 times
[2021-06-10 12:21:12,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:12,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723229849]
[2021-06-10 12:21:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:12,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,647 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:21:12,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:21:12,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:21:12,665 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:21:12,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:12,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:12,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723229849]
[2021-06-10 12:21:12,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:12,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-10 12:21:12,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894902830]
[2021-06-10 12:21:12,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-10 12:21:12,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-10 12:21:12,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-10 12:21:12,674 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 99
[2021-06-10 12:21:12,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 86.125) internal successors, (689), 8 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:12,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 99
[2021-06-10 12:21:12,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:12,788 INFO L129 PetriNetUnfolder]: 16/137 cut-off events.
[2021-06-10 12:21:12,788 INFO L130 PetriNetUnfolder]: For 338/354 co-relation queries the response was YES.
[2021-06-10 12:21:12,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 137 events. 16/137 cut-off events. For 338/354 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 0 based on Foata normal form. 12/147 useless extension candidates. Maximal degree in co-relation 340. Up to 30 conditions per place.
[2021-06-10 12:21:12,789 INFO L132 encePairwiseOnDemand]: 90/99 looper letters, 4 selfloop transitions, 12 changer transitions 23/110 dead transitions.
[2021-06-10 12:21:12,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 110 transitions, 496 flow
[2021-06-10 12:21:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-10 12:21:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-06-10 12:21:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 966 transitions.
[2021-06-10 12:21:12,791 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8870523415977961
[2021-06-10 12:21:12,791 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 966 transitions.
[2021-06-10 12:21:12,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 966 transitions.
[2021-06-10 12:21:12,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:12,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 966 transitions.
[2021-06-10 12:21:12,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 87.81818181818181) internal successors, (966), 11 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 99.0) internal successors, (1188), 12 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,795 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 99.0) internal successors, (1188), 12 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,795 INFO L185 Difference]: Start difference. First operand has 118 places, 97 transitions, 312 flow. Second operand 11 states and 966 transitions.
[2021-06-10 12:21:12,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 110 transitions, 496 flow
[2021-06-10 12:21:12,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 401 flow, removed 38 selfloop flow, removed 9 redundant places.
[2021-06-10 12:21:12,798 INFO L241 Difference]: Finished difference. Result has 121 places, 87 transitions, 282 flow
[2021-06-10 12:21:12,798 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=121, PETRI_TRANSITIONS=87}
[2021-06-10 12:21:12,798 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 17 predicate places.
[2021-06-10 12:21:12,798 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 87 transitions, 282 flow
[2021-06-10 12:21:12,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 86.125) internal successors, (689), 8 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:12,799 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:12,799 INFO L263 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, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:21:12,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-10 12:21:12,799 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1492182976, now seen corresponding path program 1 times
[2021-06-10 12:21:12,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:12,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436939418]
[2021-06-10 12:21:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:12,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,935 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size
[2021-06-10 12:21:12,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-06-10 12:21:12,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-06-10 12:21:12,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:12,962 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:21:12,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:21:12,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:12,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:12,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:12,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:12,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436939418]
[2021-06-10 12:21:12,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:12,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-10 12:21:12,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202016830]
[2021-06-10 12:21:12,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-10 12:21:12,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-10 12:21:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-06-10 12:21:12,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99
[2021-06-10 12:21:13,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 87 transitions, 282 flow. Second operand has 9 states, 9 states have (on average 77.11111111111111) internal successors, (694), 9 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:13,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99
[2021-06-10 12:21:13,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:13,190 INFO L129 PetriNetUnfolder]: 43/287 cut-off events.
[2021-06-10 12:21:13,190 INFO L130 PetriNetUnfolder]: For 307/327 co-relation queries the response was YES.
[2021-06-10 12:21:13,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 287 events. 43/287 cut-off events. For 307/327 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1280 event pairs, 6 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 601. Up to 51 conditions per place.
[2021-06-10 12:21:13,191 INFO L132 encePairwiseOnDemand]: 89/99 looper letters, 20 selfloop transitions, 6 changer transitions 10/104 dead transitions.
[2021-06-10 12:21:13,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 388 flow
[2021-06-10 12:21:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-10 12:21:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-06-10 12:21:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 787 transitions.
[2021-06-10 12:21:13,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.794949494949495
[2021-06-10 12:21:13,193 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 787 transitions.
[2021-06-10 12:21:13,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 787 transitions.
[2021-06-10 12:21:13,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:13,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 787 transitions.
[2021-06-10 12:21:13,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 78.7) internal successors, (787), 10 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,197 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 99.0) internal successors, (1089), 11 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,197 INFO L185 Difference]: Start difference. First operand has 121 places, 87 transitions, 282 flow. Second operand 10 states and 787 transitions.
[2021-06-10 12:21:13,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 388 flow
[2021-06-10 12:21:13,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 306 flow, removed 22 selfloop flow, removed 15 redundant places.
[2021-06-10 12:21:13,205 INFO L241 Difference]: Finished difference. Result has 108 places, 91 transitions, 244 flow
[2021-06-10 12:21:13,206 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=108, PETRI_TRANSITIONS=91}
[2021-06-10 12:21:13,206 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 4 predicate places.
[2021-06-10 12:21:13,206 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 244 flow
[2021-06-10 12:21:13,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 77.11111111111111) internal successors, (694), 9 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,206 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:13,206 INFO L263 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, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:21:13,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-10 12:21:13,206 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1120279684, now seen corresponding path program 2 times
[2021-06-10 12:21:13,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:13,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794003566]
[2021-06-10 12:21:13,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:13,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:13,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:13,327 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-06-10 12:21:13,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 12:21:13,333 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:21:13,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:21:13,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:13,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:13,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:13,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794003566]
[2021-06-10 12:21:13,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:13,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:21:13,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929283268]
[2021-06-10 12:21:13,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:21:13,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:21:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:21:13,362 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 99
[2021-06-10 12:21:13,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 91 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:13,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 99
[2021-06-10 12:21:13,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:13,467 INFO L129 PetriNetUnfolder]: 43/298 cut-off events.
[2021-06-10 12:21:13,467 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES.
[2021-06-10 12:21:13,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 298 events. 43/298 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1369 event pairs, 1 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 483. Up to 36 conditions per place.
[2021-06-10 12:21:13,469 INFO L132 encePairwiseOnDemand]: 91/99 looper letters, 14 selfloop transitions, 4 changer transitions 4/99 dead transitions.
[2021-06-10 12:21:13,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 314 flow
[2021-06-10 12:21:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-10 12:21:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-06-10 12:21:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions.
[2021-06-10 12:21:13,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8513708513708513
[2021-06-10 12:21:13,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions.
[2021-06-10 12:21:13,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions.
[2021-06-10 12:21:13,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:13,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions.
[2021-06-10 12:21:13,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,472 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,472 INFO L185 Difference]: Start difference. First operand has 108 places, 91 transitions, 244 flow. Second operand 7 states and 590 transitions.
[2021-06-10 12:21:13,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 314 flow
[2021-06-10 12:21:13,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 297 flow, removed 8 selfloop flow, removed 6 redundant places.
[2021-06-10 12:21:13,474 INFO L241 Difference]: Finished difference. Result has 108 places, 94 transitions, 270 flow
[2021-06-10 12:21:13,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=108, PETRI_TRANSITIONS=94}
[2021-06-10 12:21:13,475 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 4 predicate places.
[2021-06-10 12:21:13,475 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 94 transitions, 270 flow
[2021-06-10 12:21:13,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,476 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:13,476 INFO L263 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, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:21:13,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-10 12:21:13,476 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1349272832, now seen corresponding path program 3 times
[2021-06-10 12:21:13,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:13,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481855002]
[2021-06-10 12:21:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:21:13,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:13,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:21:13,568 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-06-10 12:21:13,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 12:21:13,575 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:21:13,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:21:13,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:13,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:21:13,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:21:13,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:21:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:21:13,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481855002]
[2021-06-10 12:21:13,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:21:13,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:21:13,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733394072]
[2021-06-10 12:21:13,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:21:13,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:21:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:21:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:21:13,605 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 99
[2021-06-10 12:21:13,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 94 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:21:13,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 99
[2021-06-10 12:21:13,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:21:13,713 INFO L129 PetriNetUnfolder]: 62/404 cut-off events.
[2021-06-10 12:21:13,713 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES.
[2021-06-10 12:21:13,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 404 events. 62/404 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2282 event pairs, 1 based on Foata normal form. 1/391 useless extension candidates. Maximal degree in co-relation 710. Up to 52 conditions per place.
[2021-06-10 12:21:13,715 INFO L132 encePairwiseOnDemand]: 91/99 looper letters, 18 selfloop transitions, 5 changer transitions 4/104 dead transitions.
[2021-06-10 12:21:13,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 104 transitions, 370 flow
[2021-06-10 12:21:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-10 12:21:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-06-10 12:21:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions.
[2021-06-10 12:21:13,717 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8513708513708513
[2021-06-10 12:21:13,717 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions.
[2021-06-10 12:21:13,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions.
[2021-06-10 12:21:13,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:21:13,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions.
[2021-06-10 12:21:13,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 99.0) internal successors, (792), 8 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,719 INFO L185 Difference]: Start difference. First operand has 108 places, 94 transitions, 270 flow. Second operand 7 states and 590 transitions.
[2021-06-10 12:21:13,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 104 transitions, 370 flow
[2021-06-10 12:21:13,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 359 flow, removed 5 selfloop flow, removed 4 redundant places.
[2021-06-10 12:21:13,721 INFO L241 Difference]: Finished difference. Result has 112 places, 98 transitions, 320 flow
[2021-06-10 12:21:13,721 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=112, PETRI_TRANSITIONS=98}
[2021-06-10 12:21:13,722 INFO L343 CegarLoopForPetriNet]: 104 programPoint places, 8 predicate places.
[2021-06-10 12:21:13,722 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 98 transitions, 320 flow
[2021-06-10 12:21:13,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:21:13,722 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:21:13,722 INFO L263 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, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:21:13,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-10 12:21:13,722 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:21:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:21:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash 478011052, now seen corresponding path program 4 times
[2021-06-10 12:21:13,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:21:13,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693470595]
[2021-06-10 12:21:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:21:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 12:21:13,752 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 12:21:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 12:21:13,813 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 12:21:13,837 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-10 12:21:13,837 INFO L634 BasicCegarLoop]: Counterexample might be feasible
[2021-06-10 12:21:13,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-10 12:21:13,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:21:13 BasicIcfg
[2021-06-10 12:21:13,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-10 12:21:13,914 INFO L168 Benchmark]: Toolchain (without parser) took 4281.37 ms. Allocated memory was 325.1 MB in the beginning and 434.1 MB in the end (delta: 109.1 MB). Free memory was 287.3 MB in the beginning and 361.4 MB in the end (delta: -74.0 MB). Peak memory consumption was 233.9 MB. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,914 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 325.1 MB. Free memory is still 305.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.44 ms. Allocated memory is still 325.1 MB. Free memory was 287.1 MB in the beginning and 283.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.03 ms. Allocated memory is still 325.1 MB. Free memory was 282.7 MB in the beginning and 280.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,915 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 325.1 MB. Free memory was 280.6 MB in the beginning and 278.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,915 INFO L168 Benchmark]: RCFGBuilder took 1342.57 ms. Allocated memory is still 325.1 MB. Free memory was 278.5 MB in the beginning and 201.1 MB in the end (delta: 77.3 MB). Peak memory consumption was 126.6 MB. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,915 INFO L168 Benchmark]: TraceAbstraction took 2367.18 ms. Allocated memory was 325.1 MB in the beginning and 434.1 MB in the end (delta: 109.1 MB). Free memory was 201.1 MB in the beginning and 361.4 MB in the end (delta: -160.2 MB). Peak memory consumption was 145.9 MB. Max. memory is 16.0 GB.
[2021-06-10 12:21:13,917 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.10 ms. Allocated memory is still 325.1 MB. Free memory is still 305.5 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 482.44 ms. Allocated memory is still 325.1 MB. Free memory was 287.1 MB in the beginning and 283.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 53.03 ms. Allocated memory is still 325.1 MB. Free memory was 282.7 MB in the beginning and 280.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 29.55 ms. Allocated memory is still 325.1 MB. Free memory was 280.6 MB in the beginning and 278.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1342.57 ms. Allocated memory is still 325.1 MB. Free memory was 278.5 MB in the beginning and 201.1 MB in the end (delta: 77.3 MB). Peak memory consumption was 126.6 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 2367.18 ms. Allocated memory was 325.1 MB in the beginning and 434.1 MB in the end (delta: 109.1 MB). Free memory was 201.1 MB in the beginning and 361.4 MB in the end (delta: -160.2 MB). Peak memory consumption was 145.9 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L711] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L713] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L715] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0]
[L716] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0]
[L717] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L719] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L721] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L723] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L724] 0 _Bool z$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0]
[L725] 0 int z$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0]
[L726] 0 _Bool z$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0]
[L727] 0 _Bool z$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0]
[L728] 0 _Bool z$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0]
[L729] 0 _Bool z$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0]
[L730] 0 _Bool z$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0]
[L731] 0 _Bool z$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0]
[L732] 0 _Bool z$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0]
[L733] 0 _Bool z$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0]
[L734] 0 _Bool z$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0]
[L735] 0 int *z$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}]
[L736] 0 int z$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0]
[L737] 0 _Bool z$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0]
[L738] 0 int z$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0]
[L739] 0 _Bool z$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L740] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L741] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L835] 0 pthread_t t1582;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L836] FCALL, FORK 0 pthread_create(&t1582, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837] 0 pthread_t t1583;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L838] FCALL, FORK 0 pthread_create(&t1583, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839] 0 pthread_t t1584;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L840] FCALL, FORK 0 pthread_create(&t1584, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L745] 1 z$w_buff1 = z$w_buff0
[L746] 1 z$w_buff0 = 1
[L747] 1 z$w_buff1_used = z$w_buff0_used
[L748] 1 z$w_buff0_used = (_Bool)1
[L18] COND FALSE 1 !(!expression)
[L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3
[L754] 1 z$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L757] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L774] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L794] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L797] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L798] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L799] 3 z$flush_delayed = weak$$choice2
[L800] 3 z$mem_tmp = z
[L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L801] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L802] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)
[L802] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L802] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)
[L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L803] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L804] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L804] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L804] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L805] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L805] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L805] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L806] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)
[L806] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L806] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L807] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L808] 3 __unbuffered_p2_EAX = z
[L809] EXPR 3 z$flush_delayed ? z$mem_tmp : z
[L809] 3 z = z$flush_delayed ? z$mem_tmp : z
[L810] 3 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L813] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L813] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L814] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L815] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L816] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L817] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2210.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1001.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 33.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 66 SDtfs, 108 SDslu, 234 SDs, 0 SdLazy, 364 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 237.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 510.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.7ms SsaConstructionTime, 316.1ms SatisfiabilityAnalysisTime, 620.2ms InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 1457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...