/usr/bin/java -Xmx8000000000 -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/safe021_power.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f
[2021-08-12 21:11:34,893 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-08-12 21:11:34,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-08-12 21:11:34,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-08-12 21:11:34,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-08-12 21:11:34,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-08-12 21:11:34,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-08-12 21:11:34,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-08-12 21:11:34,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-08-12 21:11:34,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-08-12 21:11:34,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-08-12 21:11:34,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-08-12 21:11:34,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-08-12 21:11:34,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-08-12 21:11:34,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-08-12 21:11:34,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-08-12 21:11:34,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-08-12 21:11:34,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-08-12 21:11:34,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-08-12 21:11:34,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-08-12 21:11:34,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-08-12 21:11:34,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-08-12 21:11:34,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-08-12 21:11:34,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-08-12 21:11:34,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-08-12 21:11:34,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-08-12 21:11:34,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-08-12 21:11:34,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-08-12 21:11:34,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-08-12 21:11:34,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-08-12 21:11:34,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-08-12 21:11:34,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-08-12 21:11:34,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-08-12 21:11:34,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-08-12 21:11:34,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-08-12 21:11:34,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-08-12 21:11:34,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-08-12 21:11:34,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-08-12 21:11:34,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-08-12 21:11:34,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-08-12 21:11:34,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-08-12 21:11:34,999 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-08-12 21:11:35,034 INFO L113 SettingsManager]: Loading preferences was successful
[2021-08-12 21:11:35,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-08-12 21:11:35,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-08-12 21:11:35,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-08-12 21:11:35,040 INFO L138 SettingsManager]: * Use SBE=true
[2021-08-12 21:11:35,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * sizeof long=4
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-08-12 21:11:35,041 INFO L138 SettingsManager]: * sizeof long double=12
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-08-12 21:11:35,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-08-12 21:11:35,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-08-12 21:11:35,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-08-12 21:11:35,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-08-12 21:11:35,043 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-08-12 21:11:35,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-08-12 21:11:35,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-08-12 21:11:35,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-08-12 21:11:35,404 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-08-12 21:11:35,404 INFO L275 PluginConnector]: CDTParser initialized
[2021-08-12 21:11:35,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i
[2021-08-12 21:11:35,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58c83ccb/081908eeb2b24949bff3868f7254ab80/FLAG7d20b71c2
[2021-08-12 21:11:35,921 INFO L306 CDTParser]: Found 1 translation units.
[2021-08-12 21:11:35,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i
[2021-08-12 21:11:35,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58c83ccb/081908eeb2b24949bff3868f7254ab80/FLAG7d20b71c2
[2021-08-12 21:11:36,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f58c83ccb/081908eeb2b24949bff3868f7254ab80
[2021-08-12 21:11:36,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-08-12 21:11:36,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-08-12 21:11:36,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-08-12 21:11:36,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-08-12 21:11:36,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-08-12 21:11:36,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63057623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36, skipping insertion in model container
[2021-08-12 21:11:36,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-08-12 21:11:36,516 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-08-12 21:11:36,622 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i[952,965]
[2021-08-12 21:11:36,804 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-08-12 21:11:36,811 INFO L203 MainTranslator]: Completed pre-run
[2021-08-12 21:11:36,820 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i[952,965]
[2021-08-12 21:11:36,853 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-08-12 21:11:36,907 INFO L208 MainTranslator]: Completed translation
[2021-08-12 21:11:36,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36 WrapperNode
[2021-08-12 21:11:36,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-08-12 21:11:36,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-08-12 21:11:36,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-08-12 21:11:36,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-08-12 21:11:36,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-08-12 21:11:36,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-08-12 21:11:36,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-08-12 21:11:36,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-08-12 21:11:36,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (1/1) ...
[2021-08-12 21:11:36,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-08-12 21:11:36,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-08-12 21:11:36,980 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-08-12 21:11:36,980 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-08-12 21:11:36,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (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-08-12 21:11:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-08-12 21:11:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-08-12 21:11:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-08-12 21:11:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-08-12 21:11:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-08-12 21:11:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-08-12 21:11:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-08-12 21:11:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-08-12 21:11:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-08-12 21:11:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-08-12 21:11:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-08-12 21:11:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-08-12 21:11:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-08-12 21:11:37,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-08-12 21:11:37,073 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-08-12 21:11:39,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-08-12 21:11:39,028 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-08-12 21:11:39,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:11:39 BoogieIcfgContainer
[2021-08-12 21:11:39,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-08-12 21:11:39,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-08-12 21:11:39,032 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-08-12 21:11:39,034 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-08-12 21:11:39,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 09:11:36" (1/3) ...
[2021-08-12 21:11:39,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2262e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:11:39, skipping insertion in model container
[2021-08-12 21:11:39,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 09:11:36" (2/3) ...
[2021-08-12 21:11:39,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2262e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 09:11:39, skipping insertion in model container
[2021-08-12 21:11:39,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 09:11:39" (3/3) ...
[2021-08-12 21:11:39,036 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i
[2021-08-12 21:11:39,057 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-08-12 21:11:39,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-08-12 21:11:39,058 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-08-12 21:11:39,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,125 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,126 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,148 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,149 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,152 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,153 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,172 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,173 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,174 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,175 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,176 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,178 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-08-12 21:11:39,180 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-08-12 21:11:39,201 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-08-12 21:11:39,221 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-08-12 21:11:39,221 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-08-12 21:11:39,221 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-08-12 21:11:39,221 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-08-12 21:11:39,221 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-08-12 21:11:39,221 INFO L383 AbstractCegarLoop]: Difference is false
[2021-08-12 21:11:39,222 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-08-12 21:11:39,222 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-08-12 21:11:39,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow
[2021-08-12 21:11:39,263 INFO L129 PetriNetUnfolder]: 2/104 cut-off events.
[2021-08-12 21:11:39,264 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-12 21:11:39,267 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place.
[2021-08-12 21:11:39,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow
[2021-08-12 21:11:39,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow
[2021-08-12 21:11:39,279 INFO L129 PetriNetUnfolder]: 0/44 cut-off events.
[2021-08-12 21:11:39,280 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-12 21:11:39,280 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:39,281 INFO L266 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]
[2021-08-12 21:11:39,281 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1070963841, now seen corresponding path program 1 times
[2021-08-12 21:11:39,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:39,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282017755]
[2021-08-12 21:11:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:39,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:39,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:39,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:39,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282017755]
[2021-08-12 21:11:39,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282017755] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:39,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:39,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-08-12 21:11:39,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355025039]
[2021-08-12 21:11:39,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-08-12 21:11:39,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-08-12 21:11:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-08-12 21:11:39,530 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107
[2021-08-12 21:11:39,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-08-12 21:11:39,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:39,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107
[2021-08-12 21:11:39,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:39,667 INFO L129 PetriNetUnfolder]: 49/257 cut-off events.
[2021-08-12 21:11:39,667 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-08-12 21:11:39,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 257 events. 49/257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1023 event pairs, 38 based on Foata normal form. 18/257 useless extension candidates. Maximal degree in co-relation 305. Up to 65 conditions per place.
[2021-08-12 21:11:39,678 INFO L132 encePairwiseOnDemand]: 102/107 looper letters, 9 selfloop transitions, 2 changer transitions 0/104 dead transitions.
[2021-08-12 21:11:39,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 239 flow
[2021-08-12 21:11:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-08-12 21:11:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-08-12 21:11:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions.
[2021-08-12 21:11:39,694 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9470404984423676
[2021-08-12 21:11:39,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions.
[2021-08-12 21:11:39,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions.
[2021-08-12 21:11:39,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:39,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions.
[2021-08-12 21:11:39,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-08-12 21:11:39,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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-08-12 21:11:39,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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-08-12 21:11:39,713 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places.
[2021-08-12 21:11:39,713 INFO L482 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 239 flow
[2021-08-12 21:11:39,713 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-08-12 21:11:39,713 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:39,713 INFO L266 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]
[2021-08-12 21:11:39,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-08-12 21:11:39,714 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1282626385, now seen corresponding path program 1 times
[2021-08-12 21:11:39,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:39,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534041159]
[2021-08-12 21:11:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:39,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:39,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:39,906 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-08-12 21:11:39,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-08-12 21:11:39,917 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-12 21:11:39,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-12 21:11:39,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:39,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:39,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:39,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:39,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:39,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534041159]
[2021-08-12 21:11:39,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534041159] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:39,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:39,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-12 21:11:39,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678629953]
[2021-08-12 21:11:39,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-12 21:11:39,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-12 21:11:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-08-12 21:11:39,970 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107
[2021-08-12 21:11:39,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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-08-12 21:11:39,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:39,971 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107
[2021-08-12 21:11:39,971 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:40,631 INFO L129 PetriNetUnfolder]: 604/2144 cut-off events.
[2021-08-12 21:11:40,631 INFO L130 PetriNetUnfolder]: For 186/244 co-relation queries the response was YES.
[2021-08-12 21:11:40,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 2144 events. 604/2144 cut-off events. For 186/244 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19329 event pairs, 247 based on Foata normal form. 11/1963 useless extension candidates. Maximal degree in co-relation 3450. Up to 539 conditions per place.
[2021-08-12 21:11:40,652 INFO L132 encePairwiseOnDemand]: 98/107 looper letters, 40 selfloop transitions, 22 changer transitions 3/154 dead transitions.
[2021-08-12 21:11:40,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 154 transitions, 489 flow
[2021-08-12 21:11:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-08-12 21:11:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-08-12 21:11:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1234 transitions.
[2021-08-12 21:11:40,657 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8871315600287563
[2021-08-12 21:11:40,657 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1234 transitions.
[2021-08-12 21:11:40,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1234 transitions.
[2021-08-12 21:11:40,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:40,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1234 transitions.
[2021-08-12 21:11:40,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.92307692307692) internal successors, (1234), 13 states have internal predecessors, (1234), 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-08-12 21:11:40,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-12 21:11:40,666 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-12 21:11:40,667 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 12 predicate places.
[2021-08-12 21:11:40,667 INFO L482 AbstractCegarLoop]: Abstraction has has 124 places, 154 transitions, 489 flow
[2021-08-12 21:11:40,667 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.28571428571429) internal successors, (639), 7 states have internal predecessors, (639), 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-08-12 21:11:40,668 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:40,668 INFO L266 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-08-12 21:11:40,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-08-12 21:11:40,668 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1774874034, now seen corresponding path program 1 times
[2021-08-12 21:11:40,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:40,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56353166]
[2021-08-12 21:11:40,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:40,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:40,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:40,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:40,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:40,825 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-08-12 21:11:40,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-08-12 21:11:40,835 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-12 21:11:40,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-12 21:11:40,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:40,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:40,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:40,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:40,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:40,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:40,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:40,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56353166]
[2021-08-12 21:11:40,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56353166] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:40,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:40,907 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-12 21:11:40,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004898188]
[2021-08-12 21:11:40,907 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-12 21:11:40,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:40,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-12 21:11:40,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-08-12 21:11:40,909 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107
[2021-08-12 21:11:40,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 154 transitions, 489 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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-08-12 21:11:40,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:40,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107
[2021-08-12 21:11:40,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:41,708 INFO L129 PetriNetUnfolder]: 920/3421 cut-off events.
[2021-08-12 21:11:41,708 INFO L130 PetriNetUnfolder]: For 474/766 co-relation queries the response was YES.
[2021-08-12 21:11:41,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6580 conditions, 3421 events. 920/3421 cut-off events. For 474/766 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 35693 event pairs, 342 based on Foata normal form. 27/3167 useless extension candidates. Maximal degree in co-relation 6522. Up to 939 conditions per place.
[2021-08-12 21:11:41,730 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 75 selfloop transitions, 63 changer transitions 53/280 dead transitions.
[2021-08-12 21:11:41,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 280 transitions, 1439 flow
[2021-08-12 21:11:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-08-12 21:11:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-08-12 21:11:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1246 transitions.
[2021-08-12 21:11:41,733 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8957584471603163
[2021-08-12 21:11:41,734 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1246 transitions.
[2021-08-12 21:11:41,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1246 transitions.
[2021-08-12 21:11:41,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:41,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1246 transitions.
[2021-08-12 21:11:41,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.84615384615384) internal successors, (1246), 13 states have internal predecessors, (1246), 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-08-12 21:11:41,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-12 21:11:41,740 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-12 21:11:41,740 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 24 predicate places.
[2021-08-12 21:11:41,740 INFO L482 AbstractCegarLoop]: Abstraction has has 136 places, 280 transitions, 1439 flow
[2021-08-12 21:11:41,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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-08-12 21:11:41,741 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:41,741 INFO L266 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]
[2021-08-12 21:11:41,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-08-12 21:11:41,741 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 809114321, now seen corresponding path program 1 times
[2021-08-12 21:11:41,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:41,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493452820]
[2021-08-12 21:11:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:41,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:41,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:41,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:41,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:41,857 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-08-12 21:11:41,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-08-12 21:11:41,868 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-12 21:11:41,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-12 21:11:41,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:41,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:41,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:41,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:41,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:41,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:41,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:41,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493452820]
[2021-08-12 21:11:41,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493452820] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:41,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:41,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-12 21:11:41,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584873027]
[2021-08-12 21:11:41,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-12 21:11:41,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-12 21:11:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-08-12 21:11:41,910 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2021-08-12 21:11:41,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 280 transitions, 1439 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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-08-12 21:11:41,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:41,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2021-08-12 21:11:41,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:43,386 INFO L129 PetriNetUnfolder]: 1986/6854 cut-off events.
[2021-08-12 21:11:43,386 INFO L130 PetriNetUnfolder]: For 2135/4001 co-relation queries the response was YES.
[2021-08-12 21:11:43,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15389 conditions, 6854 events. 1986/6854 cut-off events. For 2135/4001 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 79164 event pairs, 453 based on Foata normal form. 65/6416 useless extension candidates. Maximal degree in co-relation 15325. Up to 1731 conditions per place.
[2021-08-12 21:11:43,434 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 148 selfloop transitions, 139 changer transitions 210/584 dead transitions.
[2021-08-12 21:11:43,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 584 transitions, 4381 flow
[2021-08-12 21:11:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-08-12 21:11:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-08-12 21:11:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1609 transitions.
[2021-08-12 21:11:43,439 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8845519516217702
[2021-08-12 21:11:43,439 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1609 transitions.
[2021-08-12 21:11:43,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1609 transitions.
[2021-08-12 21:11:43,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:43,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1609 transitions.
[2021-08-12 21:11:43,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 94.6470588235294) internal successors, (1609), 17 states have internal predecessors, (1609), 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-08-12 21:11:43,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 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-08-12 21:11:43,448 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 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-08-12 21:11:43,448 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 40 predicate places.
[2021-08-12 21:11:43,448 INFO L482 AbstractCegarLoop]: Abstraction has has 152 places, 584 transitions, 4381 flow
[2021-08-12 21:11:43,449 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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-08-12 21:11:43,449 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:43,449 INFO L266 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]
[2021-08-12 21:11:43,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-08-12 21:11:43,449 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1065349743, now seen corresponding path program 2 times
[2021-08-12 21:11:43,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:43,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533305972]
[2021-08-12 21:11:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:43,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:43,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:43,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:43,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:43,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:43,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:43,541 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-08-12 21:11:43,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-08-12 21:11:43,550 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-08-12 21:11:43,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-08-12 21:11:43,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:43,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:43,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:43,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:43,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:43,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:43,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:43,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533305972]
[2021-08-12 21:11:43,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533305972] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:43,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:43,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-08-12 21:11:43,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143305023]
[2021-08-12 21:11:43,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-08-12 21:11:43,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:43,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-08-12 21:11:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-08-12 21:11:43,591 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107
[2021-08-12 21:11:43,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 584 transitions, 4381 flow. Second operand has 8 states, 8 states have (on average 89.5) internal successors, (716), 8 states have internal predecessors, (716), 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-08-12 21:11:43,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:43,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107
[2021-08-12 21:11:43,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:45,319 INFO L129 PetriNetUnfolder]: 2346/8347 cut-off events.
[2021-08-12 21:11:45,319 INFO L130 PetriNetUnfolder]: For 4020/9325 co-relation queries the response was YES.
[2021-08-12 21:11:45,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21188 conditions, 8347 events. 2346/8347 cut-off events. For 4020/9325 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 101484 event pairs, 582 based on Foata normal form. 209/7951 useless extension candidates. Maximal degree in co-relation 21118. Up to 2232 conditions per place.
[2021-08-12 21:11:45,387 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 116 selfloop transitions, 98 changer transitions 362/663 dead transitions.
[2021-08-12 21:11:45,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 663 transitions, 6207 flow
[2021-08-12 21:11:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-08-12 21:11:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-08-12 21:11:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1577 transitions.
[2021-08-12 21:11:45,392 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8669598680593733
[2021-08-12 21:11:45,392 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1577 transitions.
[2021-08-12 21:11:45,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1577 transitions.
[2021-08-12 21:11:45,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:45,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1577 transitions.
[2021-08-12 21:11:45,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 92.76470588235294) internal successors, (1577), 17 states have internal predecessors, (1577), 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-08-12 21:11:45,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 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-08-12 21:11:45,401 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 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-08-12 21:11:45,402 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 56 predicate places.
[2021-08-12 21:11:45,402 INFO L482 AbstractCegarLoop]: Abstraction has has 168 places, 663 transitions, 6207 flow
[2021-08-12 21:11:45,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 89.5) internal successors, (716), 8 states have internal predecessors, (716), 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-08-12 21:11:45,403 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:45,403 INFO L266 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]
[2021-08-12 21:11:45,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-08-12 21:11:45,404 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -79162727, now seen corresponding path program 1 times
[2021-08-12 21:11:45,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:45,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254962318]
[2021-08-12 21:11:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:45,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:45,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:45,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:45,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:45,485 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-08-12 21:11:45,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-08-12 21:11:45,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:45,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-08-12 21:11:45,513 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-08-12 21:11:45,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:45,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:45,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:45,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:45,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254962318]
[2021-08-12 21:11:45,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254962318] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:45,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:45,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-08-12 21:11:45,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880403367]
[2021-08-12 21:11:45,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-08-12 21:11:45,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-08-12 21:11:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-08-12 21:11:45,536 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2021-08-12 21:11:45,536 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 663 transitions, 6207 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-08-12 21:11:45,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:45,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2021-08-12 21:11:45,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:46,862 INFO L129 PetriNetUnfolder]: 2261/8130 cut-off events.
[2021-08-12 21:11:46,862 INFO L130 PetriNetUnfolder]: For 2245/2687 co-relation queries the response was YES.
[2021-08-12 21:11:46,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19377 conditions, 8130 events. 2261/8130 cut-off events. For 2245/2687 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 95491 event pairs, 281 based on Foata normal form. 23/7590 useless extension candidates. Maximal degree in co-relation 19304. Up to 1291 conditions per place.
[2021-08-12 21:11:46,918 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 24 selfloop transitions, 17 changer transitions 233/480 dead transitions.
[2021-08-12 21:11:46,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 480 transitions, 4081 flow
[2021-08-12 21:11:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-08-12 21:11:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-08-12 21:11:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions.
[2021-08-12 21:11:46,924 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9093457943925234
[2021-08-12 21:11:46,924 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions.
[2021-08-12 21:11:46,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions.
[2021-08-12 21:11:46,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:46,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions.
[2021-08-12 21:11:46,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 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-08-12 21:11:46,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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-08-12 21:11:46,929 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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-08-12 21:11:46,929 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 65 predicate places.
[2021-08-12 21:11:46,929 INFO L482 AbstractCegarLoop]: Abstraction has has 177 places, 480 transitions, 4081 flow
[2021-08-12 21:11:46,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-08-12 21:11:46,930 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:46,930 INFO L266 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-08-12 21:11:46,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-08-12 21:11:46,930 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:46,931 INFO L82 PathProgramCache]: Analyzing trace with hash -387956604, now seen corresponding path program 1 times
[2021-08-12 21:11:46,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:46,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505307193]
[2021-08-12 21:11:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:46,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:46,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:46,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:46,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:46,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:46,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:46,985 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-08-12 21:11:46,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-08-12 21:11:47,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-08-12 21:11:47,008 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-08-12 21:11:47,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:47,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:47,018 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:47,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505307193]
[2021-08-12 21:11:47,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505307193] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:47,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:47,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-08-12 21:11:47,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3192124]
[2021-08-12 21:11:47,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-08-12 21:11:47,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:47,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-08-12 21:11:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-08-12 21:11:47,020 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2021-08-12 21:11:47,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 480 transitions, 4081 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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-08-12 21:11:47,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:47,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2021-08-12 21:11:47,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:47,779 INFO L129 PetriNetUnfolder]: 1251/4553 cut-off events.
[2021-08-12 21:11:47,779 INFO L130 PetriNetUnfolder]: For 1060/3371 co-relation queries the response was YES.
[2021-08-12 21:11:47,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11336 conditions, 4553 events. 1251/4553 cut-off events. For 1060/3371 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 49596 event pairs, 48 based on Foata normal form. 487/4703 useless extension candidates. Maximal degree in co-relation 11260. Up to 937 conditions per place.
[2021-08-12 21:11:47,812 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 22 selfloop transitions, 44 changer transitions 135/324 dead transitions.
[2021-08-12 21:11:47,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 324 transitions, 2329 flow
[2021-08-12 21:11:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-08-12 21:11:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-08-12 21:11:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1266 transitions.
[2021-08-12 21:11:47,816 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.910136592379583
[2021-08-12 21:11:47,816 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1266 transitions.
[2021-08-12 21:11:47,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1266 transitions.
[2021-08-12 21:11:47,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:47,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1266 transitions.
[2021-08-12 21:11:47,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.38461538461539) internal successors, (1266), 13 states have internal predecessors, (1266), 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-08-12 21:11:47,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-12 21:11:47,822 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-12 21:11:47,822 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 74 predicate places.
[2021-08-12 21:11:47,822 INFO L482 AbstractCegarLoop]: Abstraction has has 186 places, 324 transitions, 2329 flow
[2021-08-12 21:11:47,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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-08-12 21:11:47,823 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:47,823 INFO L266 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, 1, 1, 1]
[2021-08-12 21:11:47,823 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-08-12 21:11:47,823 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:47,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:47,823 INFO L82 PathProgramCache]: Analyzing trace with hash -828845586, now seen corresponding path program 1 times
[2021-08-12 21:11:47,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:47,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375925436]
[2021-08-12 21:11:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-08-12 21:11:47,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:47,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:47,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:47,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-08-12 21:11:47,961 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-08-12 21:11:47,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-08-12 21:11:47,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-08-12 21:11:47,986 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-08-12 21:11:47,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-08-12 21:11:47,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-08-12 21:11:47,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-08-12 21:11:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-08-12 21:11:47,996 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-08-12 21:11:47,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375925436]
[2021-08-12 21:11:47,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375925436] provided 1 perfect and 0 imperfect interpolant sequences
[2021-08-12 21:11:47,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-08-12 21:11:47,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-08-12 21:11:47,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587223580]
[2021-08-12 21:11:47,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-08-12 21:11:47,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-08-12 21:11:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-08-12 21:11:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-08-12 21:11:47,998 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107
[2021-08-12 21:11:47,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 324 transitions, 2329 flow. Second operand has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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-08-12 21:11:47,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-08-12 21:11:47,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107
[2021-08-12 21:11:47,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-08-12 21:11:48,623 INFO L129 PetriNetUnfolder]: 1137/3741 cut-off events.
[2021-08-12 21:11:48,623 INFO L130 PetriNetUnfolder]: For 1498/4496 co-relation queries the response was YES.
[2021-08-12 21:11:48,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11430 conditions, 3741 events. 1137/3741 cut-off events. For 1498/4496 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 40816 event pairs, 31 based on Foata normal form. 501/3950 useless extension candidates. Maximal degree in co-relation 11351. Up to 877 conditions per place.
[2021-08-12 21:11:48,650 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 19 selfloop transitions, 48 changer transitions 75/250 dead transitions.
[2021-08-12 21:11:48,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 250 transitions, 1723 flow
[2021-08-12 21:11:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-08-12 21:11:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-08-12 21:11:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1544 transitions.
[2021-08-12 21:11:48,655 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9018691588785047
[2021-08-12 21:11:48,655 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1544 transitions.
[2021-08-12 21:11:48,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1544 transitions.
[2021-08-12 21:11:48,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-08-12 21:11:48,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1544 transitions.
[2021-08-12 21:11:48,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.5) internal successors, (1544), 16 states have internal predecessors, (1544), 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-08-12 21:11:48,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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-08-12 21:11:48,665 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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-08-12 21:11:48,665 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 65 predicate places.
[2021-08-12 21:11:48,665 INFO L482 AbstractCegarLoop]: Abstraction has has 177 places, 250 transitions, 1723 flow
[2021-08-12 21:11:48,665 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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-08-12 21:11:48,665 INFO L258 CegarLoopForPetriNet]: Found error trace
[2021-08-12 21:11:48,665 INFO L266 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-08-12 21:11:48,665 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-08-12 21:11:48,666 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-08-12 21:11:48,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-08-12 21:11:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash -84377346, now seen corresponding path program 1 times
[2021-08-12 21:11:48,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-08-12 21:11:48,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681666030]
[2021-08-12 21:11:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-08-12 21:11:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-12 21:11:48,705 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-12 21:11:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-08-12 21:11:48,742 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-08-12 21:11:48,774 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-08-12 21:11:48,774 INFO L651 BasicCegarLoop]: Counterexample might be feasible
[2021-08-12 21:11:48,774 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-08-12 21:11:48,777 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-08-12 21:11:48,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 09:11:48 BasicIcfg
[2021-08-12 21:11:48,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-08-12 21:11:48,896 INFO L168 Benchmark]: Toolchain (without parser) took 12459.30 ms. Allocated memory was 182.5 MB in the beginning and 707.8 MB in the end (delta: 525.3 MB). Free memory was 145.8 MB in the beginning and 239.9 MB in the end (delta: -94.1 MB). Peak memory consumption was 431.4 MB. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,897 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 182.5 MB. Free memory is still 164.3 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.79 ms. Allocated memory is still 182.5 MB. Free memory was 145.7 MB in the beginning and 142.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.96 ms. Allocated memory is still 182.5 MB. Free memory was 142.0 MB in the beginning and 139.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,898 INFO L168 Benchmark]: Boogie Preprocessor took 29.49 ms. Allocated memory is still 182.5 MB. Free memory was 139.4 MB in the beginning and 137.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,898 INFO L168 Benchmark]: RCFGBuilder took 2049.95 ms. Allocated memory was 182.5 MB in the beginning and 221.2 MB in the end (delta: 38.8 MB). Free memory was 137.3 MB in the beginning and 149.4 MB in the end (delta: -12.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,898 INFO L168 Benchmark]: TraceAbstraction took 9864.04 ms. Allocated memory was 221.2 MB in the beginning and 707.8 MB in the end (delta: 486.5 MB). Free memory was 148.8 MB in the beginning and 239.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 394.9 MB. Max. memory is 8.0 GB.
[2021-08-12 21:11:48,904 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.55 ms. Allocated memory is still 182.5 MB. Free memory is still 164.3 MB. There was no memory consumed. Max. memory is 8.0 GB.
* CACSL2BoogieTranslator took 458.79 ms. Allocated memory is still 182.5 MB. Free memory was 145.7 MB in the beginning and 142.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 8.0 GB.
* Boogie Procedure Inliner took 40.96 ms. Allocated memory is still 182.5 MB. Free memory was 142.0 MB in the beginning and 139.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
* Boogie Preprocessor took 29.49 ms. Allocated memory is still 182.5 MB. Free memory was 139.4 MB in the beginning and 137.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
* RCFGBuilder took 2049.95 ms. Allocated memory was 182.5 MB in the beginning and 221.2 MB in the end (delta: 38.8 MB). Free memory was 137.3 MB in the beginning and 149.4 MB in the end (delta: -12.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 8.0 GB.
* TraceAbstraction took 9864.04 ms. Allocated memory was 221.2 MB in the beginning and 707.8 MB in the end (delta: 486.5 MB). Free memory was 148.8 MB in the beginning and 239.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 394.9 MB. Max. memory is 8.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_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L713] 0 int __unbuffered_p2_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L714] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L715] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L717] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L719] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L721] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L722] 0 _Bool z$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0]
[L723] 0 int z$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0]
[L724] 0 _Bool z$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L725] 0 _Bool z$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L726] 0 _Bool z$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L727] 0 _Bool z$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L728] 0 _Bool z$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L729] 0 _Bool z$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L730] 0 _Bool z$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L731] 0 _Bool z$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L732] 0 _Bool z$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L733] 0 int *z$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}]
[L734] 0 int z$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L735] 0 _Bool z$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L736] 0 int z$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L737] 0 _Bool z$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L738] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L739] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L833] 0 pthread_t t2281;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L743] 1 z$w_buff1 = z$w_buff0
[L744] 1 z$w_buff0 = 1
[L745] 1 z$w_buff1_used = z$w_buff0_used
[L746] 1 z$w_buff0_used = (_Bool)1
[L18] COND FALSE 1 !(!expression)
[L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3
[L752] 1 z$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L835] 0 pthread_t t2282;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L772] 2 x = 2
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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]
[L775] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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]
[L837] 0 pthread_t t2283;
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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]
[L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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]
[L792] 3 __unbuffered_p2_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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]
[L795] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L796] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L797] 3 z$flush_delayed = weak$$choice2
[L798] 3 z$mem_tmp = z
[L799] 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)
[L799] 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)
[L800] 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))
[L800] 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)
[L800] 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))
[L800] 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))
[L801] 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))
[L801] 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)
[L801] 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))
[L801] 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))
[L802] 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))
[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_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)
[L802] 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))
[L802] 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))
[L803] 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))
[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_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L803] 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))
[L803] 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))
[L804] 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))
[L804] 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)
[L804] 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))
[L804] 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))
[L805] 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))
[L805] 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)
[L805] 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))
[L805] 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))
[L806] 3 __unbuffered_p2_EBX = z
[L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z
[L807] 3 z = z$flush_delayed ? z$mem_tmp : z
[L808] 3 z$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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]
[L758] 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)
[L758] 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)
[L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L760] 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
[L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L762] 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
[L778] 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)
[L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L778] 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)
[L778] 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)
[L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L780] 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
[L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L782] 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
[L811] 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)
[L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L811] 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)
[L811] 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)
[L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L813] 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
[L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L815] 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
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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]
[L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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]
[L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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]
[L844] 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)
[L844] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L844] 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)
[L844] 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)
[L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L846] 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
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L848] 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
[L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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_p2_EAX=1, __unbuffered_p2_EBX=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=2, 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 with 1 thread instances
CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9557.5ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 7941.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 49.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 124 SDtfs, 397 SDslu, 451 SDs, 0 SdLazy, 463 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 560.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1243.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6207occurred in iteration=5, InterpolantAutomatonStates: 102, 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: 58.8ms SsaConstructionTime, 339.3ms SatisfiabilityAnalysisTime, 910.7ms InterpolantComputationTime, 633 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 2238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...