/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065
[2021-06-10 20:52:41,491 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-10 20:52:41,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-10 20:52:41,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-10 20:52:41,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-10 20:52:41,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-10 20:52:41,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-10 20:52:41,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-10 20:52:41,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-10 20:52:41,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-10 20:52:41,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-10 20:52:41,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-10 20:52:41,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-10 20:52:41,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-10 20:52:41,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-10 20:52:41,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-10 20:52:41,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-10 20:52:41,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-10 20:52:41,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-10 20:52:41,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-10 20:52:41,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-10 20:52:41,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-10 20:52:41,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-10 20:52:41,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-10 20:52:41,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-10 20:52:41,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-10 20:52:41,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-10 20:52:41,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-10 20:52:41,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-10 20:52:41,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-10 20:52:41,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-10 20:52:41,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-10 20:52:41,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-10 20:52:41,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-10 20:52:41,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-10 20:52:41,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-10 20:52:41,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-10 20:52:41,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-10 20:52:41,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-10 20:52:41,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-10 20:52:41,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-10 20:52:41,562 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-SemanticLbe.epf
[2021-06-10 20:52:41,588 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-10 20:52:41,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-10 20:52:41,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-10 20:52:41,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-10 20:52:41,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-10 20:52:41,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 20:52:41,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-10 20:52:41,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-10 20:52:41,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-10 20:52:41,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-10 20:52:41,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-10 20:52:41,592 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-06-10 20:52:41,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-10 20:52:41,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-10 20:52:41,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-10 20:52:41,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-10 20:52:41,840 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-10 20:52:41,840 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-10 20:52:41,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i
[2021-06-10 20:52:41,890 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91fa8100/fc41e179e5864ef8a300351bfa384280/FLAGbb9d2b372
[2021-06-10 20:52:42,307 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-10 20:52:42,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i
[2021-06-10 20:52:42,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91fa8100/fc41e179e5864ef8a300351bfa384280/FLAGbb9d2b372
[2021-06-10 20:52:42,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91fa8100/fc41e179e5864ef8a300351bfa384280
[2021-06-10 20:52:42,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-10 20:52:42,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-10 20:52:42,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-10 20:52:42,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-10 20:52:42,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-10 20:52:42,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5777e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42, skipping insertion in model container
[2021-06-10 20:52:42,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-10 20:52:42,372 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-10 20:52:42,502 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i[991,1004]
[2021-06-10 20:52:42,636 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 20:52:42,644 INFO L203 MainTranslator]: Completed pre-run
[2021-06-10 20:52:42,655 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i[991,1004]
[2021-06-10 20:52:42,679 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 20:52:42,733 INFO L208 MainTranslator]: Completed translation
[2021-06-10 20:52:42,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42 WrapperNode
[2021-06-10 20:52:42,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-10 20:52:42,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-10 20:52:42,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-10 20:52:42,736 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-10 20:52:42,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-10 20:52:42,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-10 20:52:42,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-10 20:52:42,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-10 20:52:42,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
[2021-06-10 20:52:42,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-10 20:52:42,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-10 20:52:42,784 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-10 20:52:42,785 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-10 20:52:42,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 20:52:42,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-10 20:52:42,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-10 20:52:42,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-10 20:52:42,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-10 20:52:42,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-10 20:52:42,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-10 20:52:42,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-10 20:52:42,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-10 20:52:42,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-10 20:52:42,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-10 20:52:42,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-10 20:52:42,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-10 20:52:42,834 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-10 20:52:43,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-10 20:52:43,780 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-10 20:52:43,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:52:43 BoogieIcfgContainer
[2021-06-10 20:52:43,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-10 20:52:43,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-10 20:52:43,783 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-10 20:52:43,785 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-10 20:52:43,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 08:52:42" (1/3) ...
[2021-06-10 20:52:43,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76981bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:52:43, skipping insertion in model container
[2021-06-10 20:52:43,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 08:52:42" (2/3) ...
[2021-06-10 20:52:43,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76981bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 08:52:43, skipping insertion in model container
[2021-06-10 20:52:43,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 08:52:43" (3/3) ...
[2021-06-10 20:52:43,787 INFO L111 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i
[2021-06-10 20:52:43,791 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-10 20:52:43,794 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-06-10 20:52:43,795 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-10 20:52:43,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,818 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,818 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,818 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,823 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,825 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,826 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,832 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,832 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,832 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,833 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,838 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,842 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 20:52:43,849 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-10 20:52:43,860 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-10 20:52:43,881 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-06-10 20:52:43,881 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-06-10 20:52:43,881 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-10 20:52:43,881 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-10 20:52:43,881 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-10 20:52:43,882 INFO L381 AbstractCegarLoop]: Difference is false
[2021-06-10 20:52:43,882 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-10 20:52:43,882 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-06-10 20:52:43,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 186 flow
[2021-06-10 20:52:43,920 INFO L129 PetriNetUnfolder]: 2/86 cut-off events.
[2021-06-10 20:52:43,920 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 20:52:43,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place.
[2021-06-10 20:52:43,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 88 transitions, 186 flow
[2021-06-10 20:52:43,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 178 flow
[2021-06-10 20:52:43,931 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-06-10 20:52:43,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 178 flow
[2021-06-10 20:52:43,941 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 86 transitions, 178 flow
[2021-06-10 20:52:43,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 178 flow
[2021-06-10 20:52:43,962 INFO L129 PetriNetUnfolder]: 2/86 cut-off events.
[2021-06-10 20:52:43,962 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 20:52:43,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place.
[2021-06-10 20:52:43,965 INFO L151 LiptonReduction]: Number of co-enabled transitions 1124
[2021-06-10 20:52:44,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,040 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:44,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:44,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-10 20:52:44,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:44,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:44,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:44,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:44,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:44,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,256 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:44,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50
[2021-06-10 20:52:44,263 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:44,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,272 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-06-10 20:52:44,272 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-10 20:52:44,292 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,297 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87
[2021-06-10 20:52:44,297 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:44,299 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size
[2021-06-10 20:52:44,300 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term
[2021-06-10 20:52:44,300 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-10 20:52:44,302 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,308 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50
[2021-06-10 20:52:44,309 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term
[2021-06-10 20:52:44,309 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-10 20:52:44,312 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:44,320 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88
[2021-06-10 20:52:44,483 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-06-10 20:52:44,900 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88
[2021-06-10 20:52:45,032 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2021-06-10 20:52:45,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,183 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:45,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:45,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-10 20:52:45,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,482 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-06-10 20:52:45,483 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-06-10 20:52:45,484 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,593 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:45,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:45,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-10 20:52:45,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,712 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:45,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:45,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24
[2021-06-10 20:52:45,792 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size
[2021-06-10 20:52:45,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,832 INFO L147 QuantifierPusher]: treesize reduction 29, result has 3.3 percent of original size 1
[2021-06-10 20:52:45,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:45,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:45,984 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size
[2021-06-10 20:52:45,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,374 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:46,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:46,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-10 20:52:46,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,641 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:46,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,644 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:46,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-06-10 20:52:46,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-06-10 20:52:46,646 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:46,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,647 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:46,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35
[2021-06-10 20:52:46,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36
[2021-06-10 20:52:46,650 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:46,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42
[2021-06-10 20:52:46,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43
[2021-06-10 20:52:46,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:46,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:46,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:47,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:47,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:47,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:47,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:47,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:47,253 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:47,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:47,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:47,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-10 20:52:47,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:47,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:47,766 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116
[2021-06-10 20:52:47,902 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 112
[2021-06-10 20:52:48,172 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116
[2021-06-10 20:52:48,310 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 112
[2021-06-10 20:52:48,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,316 WARN L159 QuantifierPusher]: Ignoring assumption.
[2021-06-10 20:52:48,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 20:52:48,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-06-10 20:52:48,326 INFO L163 LiptonReduction]: Checked pairs total: 2902
[2021-06-10 20:52:48,326 INFO L165 LiptonReduction]: Total number of compositions: 81
[2021-06-10 20:52:48,328 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4398
[2021-06-10 20:52:48,333 INFO L129 PetriNetUnfolder]: 0/7 cut-off events.
[2021-06-10 20:52:48,333 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 20:52:48,333 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:48,334 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2021-06-10 20:52:48,334 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:48,337 INFO L82 PathProgramCache]: Analyzing trace with hash 818203062, now seen corresponding path program 1 times
[2021-06-10 20:52:48,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:48,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746311041]
[2021-06-10 20:52:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:48,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 20:52:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:48,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746311041]
[2021-06-10 20:52:48,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:48,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-06-10 20:52:48,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237953613]
[2021-06-10 20:52:48,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-10 20:52:48,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:48,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-10 20:52:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-10 20:52:48,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 169
[2021-06-10 20:52:48,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:48,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 169
[2021-06-10 20:52:48,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:48,494 INFO L129 PetriNetUnfolder]: 9/45 cut-off events.
[2021-06-10 20:52:48,494 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 20:52:48,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 45 events. 9/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 1 based on Foata normal form. 12/54 useless extension candidates. Maximal degree in co-relation 65. Up to 17 conditions per place.
[2021-06-10 20:52:48,495 INFO L132 encePairwiseOnDemand]: 164/169 looper letters, 5 selfloop transitions, 2 changer transitions 0/21 dead transitions.
[2021-06-10 20:52:48,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 62 flow
[2021-06-10 20:52:48,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-10 20:52:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-10 20:52:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions.
[2021-06-10 20:52:48,504 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8520710059171598
[2021-06-10 20:52:48,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions.
[2021-06-10 20:52:48,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions.
[2021-06-10 20:52:48,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:48,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions.
[2021-06-10 20:52:48,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,515 INFO L185 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 432 transitions.
[2021-06-10 20:52:48,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 62 flow
[2021-06-10 20:52:48,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-10 20:52:48,517 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow
[2021-06-10 20:52:48,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19}
[2021-06-10 20:52:48,519 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places.
[2021-06-10 20:52:48,519 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow
[2021-06-10 20:52:48,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,519 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:48,519 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:48,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-10 20:52:48,519 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1149780952, now seen corresponding path program 1 times
[2021-06-10 20:52:48,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:48,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269866276]
[2021-06-10 20:52:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:48,597 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size
[2021-06-10 20:52:48,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-06-10 20:52:48,605 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 20:52:48,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 20:52:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:48,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269866276]
[2021-06-10 20:52:48,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:48,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-10 20:52:48,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553789518]
[2021-06-10 20:52:48,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-06-10 20:52:48,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-06-10 20:52:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-06-10 20:52:48,624 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169
[2021-06-10 20:52:48,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:48,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169
[2021-06-10 20:52:48,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:48,684 INFO L129 PetriNetUnfolder]: 50/140 cut-off events.
[2021-06-10 20:52:48,684 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 20:52:48,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 140 events. 50/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 622 event pairs, 30 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 241. Up to 67 conditions per place.
[2021-06-10 20:52:48,689 INFO L132 encePairwiseOnDemand]: 164/169 looper letters, 6 selfloop transitions, 3 changer transitions 10/30 dead transitions.
[2021-06-10 20:52:48,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 106 flow
[2021-06-10 20:52:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-06-10 20:52:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-06-10 20:52:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions.
[2021-06-10 20:52:48,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7881656804733728
[2021-06-10 20:52:48,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions.
[2021-06-10 20:52:48,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions.
[2021-06-10 20:52:48,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:48,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions.
[2021-06-10 20:52:48,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,697 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,697 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 5 states and 666 transitions.
[2021-06-10 20:52:48,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 106 flow
[2021-06-10 20:52:48,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-10 20:52:48,698 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 67 flow
[2021-06-10 20:52:48,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=20}
[2021-06-10 20:52:48,699 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places.
[2021-06-10 20:52:48,699 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 67 flow
[2021-06-10 20:52:48,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,699 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:48,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:48,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-10 20:52:48,699 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1136919055, now seen corresponding path program 1 times
[2021-06-10 20:52:48,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:48,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003944765]
[2021-06-10 20:52:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:48,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:48,772 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size
[2021-06-10 20:52:48,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17
[2021-06-10 20:52:48,782 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 20:52:48,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 20:52:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:48,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003944765]
[2021-06-10 20:52:48,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:48,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-06-10 20:52:48,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113686808]
[2021-06-10 20:52:48,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-06-10 20:52:48,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-06-10 20:52:48,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-06-10 20:52:48,795 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169
[2021-06-10 20:52:48,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:48,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169
[2021-06-10 20:52:48,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:48,831 INFO L129 PetriNetUnfolder]: 21/67 cut-off events.
[2021-06-10 20:52:48,831 INFO L130 PetriNetUnfolder]: For 39/43 co-relation queries the response was YES.
[2021-06-10 20:52:48,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 67 events. 21/67 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 205 event pairs, 6 based on Foata normal form. 6/70 useless extension candidates. Maximal degree in co-relation 158. Up to 37 conditions per place.
[2021-06-10 20:52:48,832 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 7 selfloop transitions, 3 changer transitions 5/26 dead transitions.
[2021-06-10 20:52:48,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 115 flow
[2021-06-10 20:52:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-06-10 20:52:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-06-10 20:52:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions.
[2021-06-10 20:52:48,834 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7822485207100591
[2021-06-10 20:52:48,834 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions.
[2021-06-10 20:52:48,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions.
[2021-06-10 20:52:48,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:48,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions.
[2021-06-10 20:52:48,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,837 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 67 flow. Second operand 5 states and 661 transitions.
[2021-06-10 20:52:48,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 115 flow
[2021-06-10 20:52:48,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 3 selfloop flow, removed 2 redundant places.
[2021-06-10 20:52:48,839 INFO L241 Difference]: Finished difference. Result has 33 places, 20 transitions, 75 flow
[2021-06-10 20:52:48,839 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=20}
[2021-06-10 20:52:48,839 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places.
[2021-06-10 20:52:48,839 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 75 flow
[2021-06-10 20:52:48,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,840 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:48,840 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:48,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-10 20:52:48,840 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash 156466493, now seen corresponding path program 1 times
[2021-06-10 20:52:48,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:48,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518351959]
[2021-06-10 20:52:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:48,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:48,882 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 20:52:48,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 20:52:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:48,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518351959]
[2021-06-10 20:52:48,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:48,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-10 20:52:48,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798383804]
[2021-06-10 20:52:48,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-06-10 20:52:48,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-06-10 20:52:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-06-10 20:52:48,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 169
[2021-06-10 20:52:48,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:48,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 169
[2021-06-10 20:52:48,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:48,909 INFO L129 PetriNetUnfolder]: 1/27 cut-off events.
[2021-06-10 20:52:48,909 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES.
[2021-06-10 20:52:48,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 27 events. 1/27 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 2/28 useless extension candidates. Maximal degree in co-relation 53. Up to 8 conditions per place.
[2021-06-10 20:52:48,909 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 2 selfloop transitions, 3 changer transitions 2/22 dead transitions.
[2021-06-10 20:52:48,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 22 transitions, 101 flow
[2021-06-10 20:52:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-06-10 20:52:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-06-10 20:52:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions.
[2021-06-10 20:52:48,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8201183431952662
[2021-06-10 20:52:48,911 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions.
[2021-06-10 20:52:48,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions.
[2021-06-10 20:52:48,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:48,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions.
[2021-06-10 20:52:48,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,914 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,914 INFO L185 Difference]: Start difference. First operand has 33 places, 20 transitions, 75 flow. Second operand 5 states and 693 transitions.
[2021-06-10 20:52:48,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 22 transitions, 101 flow
[2021-06-10 20:52:48,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 87 flow, removed 4 selfloop flow, removed 4 redundant places.
[2021-06-10 20:52:48,915 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 78 flow
[2021-06-10 20:52:48,915 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=20}
[2021-06-10 20:52:48,915 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places.
[2021-06-10 20:52:48,915 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 78 flow
[2021-06-10 20:52:48,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,916 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:48,916 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:48,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-10 20:52:48,916 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1199495436, now seen corresponding path program 1 times
[2021-06-10 20:52:48,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:48,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467957154]
[2021-06-10 20:52:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:48,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:48,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:48,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:48,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:48,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467957154]
[2021-06-10 20:52:48,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:48,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-06-10 20:52:48,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935876156]
[2021-06-10 20:52:48,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-06-10 20:52:48,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-06-10 20:52:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-06-10 20:52:48,962 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 169
[2021-06-10 20:52:48,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:48,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 169
[2021-06-10 20:52:48,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:48,987 INFO L129 PetriNetUnfolder]: 12/54 cut-off events.
[2021-06-10 20:52:48,987 INFO L130 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES.
[2021-06-10 20:52:48,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 54 events. 12/54 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 162 event pairs, 2 based on Foata normal form. 5/49 useless extension candidates. Maximal degree in co-relation 115. Up to 18 conditions per place.
[2021-06-10 20:52:48,987 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 4 selfloop transitions, 7 changer transitions 3/28 dead transitions.
[2021-06-10 20:52:48,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 122 flow
[2021-06-10 20:52:48,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-06-10 20:52:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-06-10 20:52:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions.
[2021-06-10 20:52:48,989 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8
[2021-06-10 20:52:48,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions.
[2021-06-10 20:52:48,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions.
[2021-06-10 20:52:48,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:48,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions.
[2021-06-10 20:52:48,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,992 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,992 INFO L185 Difference]: Start difference. First operand has 34 places, 20 transitions, 78 flow. Second operand 5 states and 676 transitions.
[2021-06-10 20:52:48,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 122 flow
[2021-06-10 20:52:48,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 110 flow, removed 3 selfloop flow, removed 5 redundant places.
[2021-06-10 20:52:48,993 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 112 flow
[2021-06-10 20:52:48,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=34, PETRI_TRANSITIONS=25}
[2021-06-10 20:52:48,993 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places.
[2021-06-10 20:52:48,993 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 112 flow
[2021-06-10 20:52:48,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:48,994 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:48,994 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:48,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-10 20:52:48,994 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash 329402686, now seen corresponding path program 1 times
[2021-06-10 20:52:48,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:48,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319484914]
[2021-06-10 20:52:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:49,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:49,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:49,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:49,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:49,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319484914]
[2021-06-10 20:52:49,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:49,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-06-10 20:52:49,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852789853]
[2021-06-10 20:52:49,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-06-10 20:52:49,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-06-10 20:52:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-06-10 20:52:49,082 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 169
[2021-06-10 20:52:49,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:49,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 169
[2021-06-10 20:52:49,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:49,120 INFO L129 PetriNetUnfolder]: 6/41 cut-off events.
[2021-06-10 20:52:49,120 INFO L130 PetriNetUnfolder]: For 43/67 co-relation queries the response was YES.
[2021-06-10 20:52:49,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 41 events. 6/41 cut-off events. For 43/67 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 95 event pairs, 0 based on Foata normal form. 14/52 useless extension candidates. Maximal degree in co-relation 114. Up to 14 conditions per place.
[2021-06-10 20:52:49,121 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 2 selfloop transitions, 10 changer transitions 3/29 dead transitions.
[2021-06-10 20:52:49,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 161 flow
[2021-06-10 20:52:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-10 20:52:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-06-10 20:52:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions.
[2021-06-10 20:52:49,124 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7954353338968724
[2021-06-10 20:52:49,124 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions.
[2021-06-10 20:52:49,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions.
[2021-06-10 20:52:49,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:49,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions.
[2021-06-10 20:52:49,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,127 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 169.0) internal successors, (1352), 8 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,127 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 112 flow. Second operand 7 states and 941 transitions.
[2021-06-10 20:52:49,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 161 flow
[2021-06-10 20:52:49,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 149 flow, removed 3 selfloop flow, removed 2 redundant places.
[2021-06-10 20:52:49,129 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 139 flow
[2021-06-10 20:52:49,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=41, PETRI_TRANSITIONS=26}
[2021-06-10 20:52:49,129 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places.
[2021-06-10 20:52:49,129 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 139 flow
[2021-06-10 20:52:49,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,129 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:49,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:49,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-10 20:52:49,129 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1545833368, now seen corresponding path program 1 times
[2021-06-10 20:52:49,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:49,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758908684]
[2021-06-10 20:52:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 20:52:49,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 20:52:49,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:49,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 20:52:49,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 20:52:49,176 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 20:52:49,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 20:52:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 20:52:49,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758908684]
[2021-06-10 20:52:49,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 20:52:49,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-06-10 20:52:49,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806396798]
[2021-06-10 20:52:49,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-06-10 20:52:49,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 20:52:49,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-06-10 20:52:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-06-10 20:52:49,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 169
[2021-06-10 20:52:49,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 20:52:49,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 169
[2021-06-10 20:52:49,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 20:52:49,217 INFO L129 PetriNetUnfolder]: 6/54 cut-off events.
[2021-06-10 20:52:49,217 INFO L130 PetriNetUnfolder]: For 102/112 co-relation queries the response was YES.
[2021-06-10 20:52:49,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 54 events. 6/54 cut-off events. For 102/112 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 168 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 162. Up to 17 conditions per place.
[2021-06-10 20:52:49,219 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 4 selfloop transitions, 1 changer transitions 9/28 dead transitions.
[2021-06-10 20:52:49,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 157 flow
[2021-06-10 20:52:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-06-10 20:52:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-06-10 20:52:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions.
[2021-06-10 20:52:49,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7964497041420119
[2021-06-10 20:52:49,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions.
[2021-06-10 20:52:49,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions.
[2021-06-10 20:52:49,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 20:52:49,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions.
[2021-06-10 20:52:49,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,223 INFO L185 Difference]: Start difference. First operand has 41 places, 26 transitions, 139 flow. Second operand 5 states and 673 transitions.
[2021-06-10 20:52:49,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 157 flow
[2021-06-10 20:52:49,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 128 flow, removed 6 selfloop flow, removed 6 redundant places.
[2021-06-10 20:52:49,226 INFO L241 Difference]: Finished difference. Result has 41 places, 19 transitions, 79 flow
[2021-06-10 20:52:49,226 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=41, PETRI_TRANSITIONS=19}
[2021-06-10 20:52:49,226 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places.
[2021-06-10 20:52:49,226 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 19 transitions, 79 flow
[2021-06-10 20:52:49,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 20:52:49,227 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 20:52:49,227 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 20:52:49,227 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-10 20:52:49,227 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 20:52:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 20:52:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash -2110852982, now seen corresponding path program 2 times
[2021-06-10 20:52:49,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 20:52:49,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672332428]
[2021-06-10 20:52:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 20:52:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 20:52:49,278 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 20:52:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 20:52:49,303 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 20:52:49,320 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-10 20:52:49,320 INFO L634 BasicCegarLoop]: Counterexample might be feasible
[2021-06-10 20:52:49,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-10 20:52:49,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 08:52:49 BasicIcfg
[2021-06-10 20:52:49,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-10 20:52:49,391 INFO L168 Benchmark]: Toolchain (without parser) took 7062.21 ms. Allocated memory was 350.2 MB in the beginning and 574.6 MB in the end (delta: 224.4 MB). Free memory was 312.3 MB in the beginning and 543.9 MB in the end (delta: -231.6 MB). Peak memory consumption was 261.9 MB. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,391 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 350.2 MB. Free memory is still 330.4 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.52 ms. Allocated memory is still 350.2 MB. Free memory was 312.1 MB in the beginning and 310.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.63 ms. Allocated memory is still 350.2 MB. Free memory was 310.1 MB in the beginning and 307.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,396 INFO L168 Benchmark]: Boogie Preprocessor took 19.05 ms. Allocated memory is still 350.2 MB. Free memory was 307.9 MB in the beginning and 305.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,396 INFO L168 Benchmark]: RCFGBuilder took 997.53 ms. Allocated memory is still 350.2 MB. Free memory was 305.9 MB in the beginning and 272.4 MB in the end (delta: 33.5 MB). Peak memory consumption was 126.7 MB. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,397 INFO L168 Benchmark]: TraceAbstraction took 5607.12 ms. Allocated memory was 350.2 MB in the beginning and 574.6 MB in the end (delta: 224.4 MB). Free memory was 272.4 MB in the beginning and 543.9 MB in the end (delta: -271.5 MB). Peak memory consumption was 220.3 MB. Max. memory is 16.0 GB.
[2021-06-10 20:52:49,401 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.09 ms. Allocated memory is still 350.2 MB. Free memory is still 330.4 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 404.52 ms. Allocated memory is still 350.2 MB. Free memory was 312.1 MB in the beginning and 310.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 29.63 ms. Allocated memory is still 350.2 MB. Free memory was 310.1 MB in the beginning and 307.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 19.05 ms. Allocated memory is still 350.2 MB. Free memory was 307.9 MB in the beginning and 305.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 997.53 ms. Allocated memory is still 350.2 MB. Free memory was 305.9 MB in the beginning and 272.4 MB in the end (delta: 33.5 MB). Peak memory consumption was 126.7 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 5607.12 ms. Allocated memory was 350.2 MB in the beginning and 574.6 MB in the end (delta: 224.4 MB). Free memory was 272.4 MB in the beginning and 543.9 MB in the end (delta: -271.5 MB). Peak memory consumption was 220.3 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 4385.0ms, 91 PlacesBefore, 28 PlacesAfterwards, 86 TransitionsBefore, 22 TransitionsAfterwards, 1124 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 2902 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1533, positive: 1413, positive conditional: 0, positive unconditional: 1413, negative: 120, negative conditional: 0, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 829, positive: 795, positive conditional: 0, positive unconditional: 795, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 829, positive: 795, positive conditional: 0, positive unconditional: 795, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 829, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 311, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 283, negative conditional: 0, negative unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1533, positive: 618, positive conditional: 0, positive unconditional: 618, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 829, unknown conditional: 0, unknown unconditional: 829] , Statistics on independence cache: Total cache size (in pairs): 1476, Positive cache size: 1442, Positive conditional cache size: 0, Positive unconditional cache size: 1442, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34
- CounterExampleResult [Line: 19]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 int __unbuffered_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L719] 0 int a = 0;
[L720] 0 _Bool main$tmp_guard0;
[L721] 0 _Bool main$tmp_guard1;
[L723] 0 int x = 0;
[L725] 0 int y = 0;
[L726] 0 _Bool y$flush_delayed;
[L727] 0 int y$mem_tmp;
[L728] 0 _Bool y$r_buff0_thd0;
[L729] 0 _Bool y$r_buff0_thd1;
[L730] 0 _Bool y$r_buff0_thd2;
[L731] 0 _Bool y$r_buff1_thd0;
[L732] 0 _Bool y$r_buff1_thd1;
[L733] 0 _Bool y$r_buff1_thd2;
[L734] 0 _Bool y$read_delayed;
[L735] 0 int *y$read_delayed_var;
[L736] 0 int y$w_buff0;
[L737] 0 _Bool y$w_buff0_used;
[L738] 0 int y$w_buff1;
[L739] 0 _Bool y$w_buff1_used;
[L741] 0 int z = 0;
[L742] 0 _Bool weak$$choice0;
[L743] 0 _Bool weak$$choice2;
[L823] 0 pthread_t t847;
[L824] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L825] 0 pthread_t t848;
[L826] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L781] 2 y$w_buff1 = y$w_buff0
[L782] 2 y$w_buff0 = 1
[L783] 2 y$w_buff1_used = y$w_buff0_used
[L784] 2 y$w_buff0_used = (_Bool)1
[L19] COND FALSE 2 !(!expression)
[L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L789] 2 y$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L792] 2 z = 1
[L795] 2 __unbuffered_p1_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L798] 2 __unbuffered_p1_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L747] 1 a = 1
[L750] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L753] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L756] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L757] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L758] 1 y$flush_delayed = weak$$choice2
[L759] 1 y$mem_tmp = y
[L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)
[L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L767] 1 __unbuffered_p0_EBX = y
[L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L768] 1 y = y$flush_delayed ? y$mem_tmp : y
[L769] 1 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L776] 1 return 0;
[L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L804] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L810] 2 return 0;
[L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2
[L4] COND FALSE 0 !(!cond)
[L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L832] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L19] COND TRUE 0 !expression
[L19] 0 reach_error()
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 87 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5443.8ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 318.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4448.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 32 SDslu, 29 SDs, 0 SdLazy, 95 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 115.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=6, InterpolantAutomatonStates: 35, 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: 24.8ms SsaConstructionTime, 195.0ms SatisfiabilityAnalysisTime, 302.6ms InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...