/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/mix036_power.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8
[2021-03-11 20:08:26,465 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-03-11 20:08:26,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-11 20:08:26,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-11 20:08:26,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-11 20:08:26,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-11 20:08:26,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-11 20:08:26,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-11 20:08:26,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-11 20:08:26,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-11 20:08:26,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-03-11 20:08:26,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-11 20:08:26,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-11 20:08:26,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-11 20:08:26,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-11 20:08:26,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-11 20:08:26,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-11 20:08:26,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-11 20:08:26,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-11 20:08:26,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-11 20:08:26,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-11 20:08:26,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-11 20:08:26,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-03-11 20:08:26,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-11 20:08:26,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-11 20:08:26,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-11 20:08:26,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-11 20:08:26,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-11 20:08:26,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-11 20:08:26,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-11 20:08:26,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-11 20:08:26,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-11 20:08:26,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-11 20:08:26,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-11 20:08:26,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-11 20:08:26,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-11 20:08:26,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-11 20:08:26,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-11 20:08:26,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-11 20:08:26,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-11 20:08:26,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-03-11 20:08:26,577 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-03-11 20:08:26,611 INFO L113 SettingsManager]: Loading preferences was successful
[2021-03-11 20:08:26,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-11 20:08:26,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-11 20:08:26,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-03-11 20:08:26,615 INFO L138 SettingsManager]: * Use SBE=true
[2021-03-11 20:08:26,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-11 20:08:26,615 INFO L138 SettingsManager]: * sizeof long=4
[2021-03-11 20:08:26,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-03-11 20:08:26,616 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-03-11 20:08:26,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-03-11 20:08:26,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-03-11 20:08:26,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-11 20:08:26,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-03-11 20:08:26,617 INFO L138 SettingsManager]: * sizeof long double=12
[2021-03-11 20:08:26,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-03-11 20:08:26,617 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-03-11 20:08:26,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-03-11 20:08:26,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-11 20:08:26,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-03-11 20:08:26,618 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-03-11 20:08:26,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-03-11 20:08:26,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-11 20:08:26,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-11 20:08:26,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-03-11 20:08:26,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-11 20:08:26,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-03-11 20:08:26,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-11 20:08:26,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-03-11 20:08:26,619 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-03-11 20:08:26,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-11 20:08:26,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-11 20:08:26,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-11 20:08:26,934 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-03-11 20:08:26,935 INFO L275 PluginConnector]: CDTParser initialized
[2021-03-11 20:08:26,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i
[2021-03-11 20:08:26,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d867eb11e/0ff69d74b5564cf58a852c65e5a55a39/FLAG40d96c2dd
[2021-03-11 20:08:27,433 INFO L306 CDTParser]: Found 1 translation units.
[2021-03-11 20:08:27,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i
[2021-03-11 20:08:27,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d867eb11e/0ff69d74b5564cf58a852c65e5a55a39/FLAG40d96c2dd
[2021-03-11 20:08:27,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d867eb11e/0ff69d74b5564cf58a852c65e5a55a39
[2021-03-11 20:08:27,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-11 20:08:27,466 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-11 20:08:27,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-11 20:08:27,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-11 20:08:27,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-11 20:08:27,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:08:27" (1/1) ...
[2021-03-11 20:08:27,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c54303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:27, skipping insertion in model container
[2021-03-11 20:08:27,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:08:27" (1/1) ...
[2021-03-11 20:08:27,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-03-11 20:08:27,520 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-03-11 20:08:27,685 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/mix036_power.opt.i[950,963]
[2021-03-11 20:08:27,850 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-03-11 20:08:27,860 INFO L203 MainTranslator]: Completed pre-run
[2021-03-11 20:08:27,871 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/mix036_power.opt.i[950,963]
[2021-03-11 20:08:27,933 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-03-11 20:08:28,014 INFO L208 MainTranslator]: Completed translation
[2021-03-11 20:08:28,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28 WrapperNode
[2021-03-11 20:08:28,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-11 20:08:28,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-11 20:08:28,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-11 20:08:28,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-11 20:08:28,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-11 20:08:28,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-11 20:08:28,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-11 20:08:28,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-03-11 20:08:28,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ...
[2021-03-11 20:08:28,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-11 20:08:28,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-11 20:08:28,153 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-03-11 20:08:28,153 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-03-11 20:08:28,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (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-03-11 20:08:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-03-11 20:08:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-11 20:08:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-11 20:08:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-11 20:08:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-03-11 20:08:28,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-03-11 20:08:28,255 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-03-11 20:08:28,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-03-11 20:08:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-03-11 20:08:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-03-11 20:08:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-03-11 20:08:28,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-03-11 20:08:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-11 20:08:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-11 20:08:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-11 20:08:28,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-11 20:08:28,258 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-11 20:08:29,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-11 20:08:29,899 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-03-11 20:08:29,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:08:29 BoogieIcfgContainer
[2021-03-11 20:08:29,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-11 20:08:29,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-11 20:08:29,902 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-03-11 20:08:29,905 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-03-11 20:08:29,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:08:27" (1/3) ...
[2021-03-11 20:08:29,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5148e11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:08:29, skipping insertion in model container
[2021-03-11 20:08:29,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (2/3) ...
[2021-03-11 20:08:29,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5148e11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:08:29, skipping insertion in model container
[2021-03-11 20:08:29,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:08:29" (3/3) ...
[2021-03-11 20:08:29,907 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_power.opt.i
[2021-03-11 20:08:29,912 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-11 20:08:29,916 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-03-11 20:08:29,917 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-11 20:08:29,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,951 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,964 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,971 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,973 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,973 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 20:08:29,984 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-11 20:08:30,000 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2021-03-11 20:08:30,017 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-03-11 20:08:30,017 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-03-11 20:08:30,017 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-11 20:08:30,017 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-11 20:08:30,017 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-11 20:08:30,017 INFO L381 AbstractCegarLoop]: Difference is false
[2021-03-11 20:08:30,018 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-11 20:08:30,018 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-11 20:08:30,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow
[2021-03-11 20:08:30,062 INFO L129 PetriNetUnfolder]: 2/115 cut-off events.
[2021-03-11 20:08:30,062 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:08:30,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2021-03-11 20:08:30,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow
[2021-03-11 20:08:30,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow
[2021-03-11 20:08:30,074 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-11 20:08:30,081 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow
[2021-03-11 20:08:30,083 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow
[2021-03-11 20:08:30,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow
[2021-03-11 20:08:30,102 INFO L129 PetriNetUnfolder]: 2/115 cut-off events.
[2021-03-11 20:08:30,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:08:30,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2021-03-11 20:08:30,105 INFO L116 LiptonReduction]: Number of co-enabled transitions 2610
[2021-03-11 20:08:31,445 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-03-11 20:08:31,812 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2021-03-11 20:08:31,932 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-03-11 20:08:32,408 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-03-11 20:08:32,550 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-03-11 20:08:34,076 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56
[2021-03-11 20:08:35,280 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128
[2021-03-11 20:08:35,458 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2021-03-11 20:08:35,872 WARN L205 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128
[2021-03-11 20:08:36,031 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 124
[2021-03-11 20:08:36,046 INFO L131 LiptonReduction]: Checked pairs total: 6523
[2021-03-11 20:08:36,046 INFO L133 LiptonReduction]: Total number of compositions: 97
[2021-03-11 20:08:36,047 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5976
[2021-03-11 20:08:36,065 INFO L129 PetriNetUnfolder]: 0/13 cut-off events.
[2021-03-11 20:08:36,065 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:08:36,065 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:36,066 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:36,066 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash 112300261, now seen corresponding path program 1 times
[2021-03-11 20:08:36,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:36,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789280651]
[2021-03-11 20:08:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:36,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:08:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:36,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789280651]
[2021-03-11 20:08:36,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:36,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-03-11 20:08:36,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953987227]
[2021-03-11 20:08:36,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-11 20:08:36,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-11 20:08:36,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 20:08:36,346 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 216
[2021-03-11 20:08:36,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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-03-11 20:08:36,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:36,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 216
[2021-03-11 20:08:36,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:36,407 INFO L129 PetriNetUnfolder]: 29/109 cut-off events.
[2021-03-11 20:08:36,407 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:08:36,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 109 events. 29/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 412 event pairs, 15 based on Foata normal form. 11/102 useless extension candidates. Maximal degree in co-relation 165. Up to 41 conditions per place.
[2021-03-11 20:08:36,410 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions.
[2021-03-11 20:08:36,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow
[2021-03-11 20:08:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-03-11 20:08:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-03-11 20:08:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions.
[2021-03-11 20:08:36,422 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.875
[2021-03-11 20:08:36,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions.
[2021-03-11 20:08:36,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions.
[2021-03-11 20:08:36,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:36,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions.
[2021-03-11 20:08:36,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-03-11 20:08:36,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-03-11 20:08:36,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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-03-11 20:08:36,439 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 567 transitions.
[2021-03-11 20:08:36,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow
[2021-03-11 20:08:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places.
[2021-03-11 20:08:36,443 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow
[2021-03-11 20:08:36,444 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28}
[2021-03-11 20:08:36,445 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2021-03-11 20:08:36,445 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow
[2021-03-11 20:08:36,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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-03-11 20:08:36,446 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:36,446 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:36,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-11 20:08:36,446 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:36,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1302507092, now seen corresponding path program 1 times
[2021-03-11 20:08:36,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:36,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26172107]
[2021-03-11 20:08:36,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:36,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:36,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:36,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26172107]
[2021-03-11 20:08:36,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:36,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-11 20:08:36,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057142742]
[2021-03-11 20:08:36,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 20:08:36,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:36,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 20:08:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 20:08:36,572 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216
[2021-03-11 20:08:36,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 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-03-11 20:08:36,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:36,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216
[2021-03-11 20:08:36,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:36,620 INFO L129 PetriNetUnfolder]: 1/39 cut-off events.
[2021-03-11 20:08:36,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 20:08:36,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 5 conditions per place.
[2021-03-11 20:08:36,626 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 2 selfloop transitions, 2 changer transitions 5/32 dead transitions.
[2021-03-11 20:08:36,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 94 flow
[2021-03-11 20:08:36,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-03-11 20:08:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-11 20:08:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 926 transitions.
[2021-03-11 20:08:36,630 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8574074074074074
[2021-03-11 20:08:36,630 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 926 transitions.
[2021-03-11 20:08:36,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 926 transitions.
[2021-03-11 20:08:36,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:36,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 926 transitions.
[2021-03-11 20:08:36,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 185.2) internal successors, (926), 5 states have internal predecessors, (926), 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-03-11 20:08:36,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-03-11 20:08:36,637 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-03-11 20:08:36,637 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 926 transitions.
[2021-03-11 20:08:36,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 94 flow
[2021-03-11 20:08:36,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-03-11 20:08:36,638 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 74 flow
[2021-03-11 20:08:36,638 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=27}
[2021-03-11 20:08:36,640 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2021-03-11 20:08:36,641 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 74 flow
[2021-03-11 20:08:36,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 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-03-11 20:08:36,641 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:36,642 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:36,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-11 20:08:36,644 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1873837417, now seen corresponding path program 1 times
[2021-03-11 20:08:36,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:36,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343529276]
[2021-03-11 20:08:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:36,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:36,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:08:36,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:36,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343529276]
[2021-03-11 20:08:36,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:36,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-11 20:08:36,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673750490]
[2021-03-11 20:08:36,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 20:08:36,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 20:08:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 20:08:36,735 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216
[2021-03-11 20:08:36,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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-03-11 20:08:36,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:36,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216
[2021-03-11 20:08:36,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:36,789 INFO L129 PetriNetUnfolder]: 90/200 cut-off events.
[2021-03-11 20:08:36,789 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES.
[2021-03-11 20:08:36,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 200 events. 90/200 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 935 event pairs, 46 based on Foata normal form. 16/208 useless extension candidates. Maximal degree in co-relation 402. Up to 119 conditions per place.
[2021-03-11 20:08:36,791 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 5 changer transitions 9/40 dead transitions.
[2021-03-11 20:08:36,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 140 flow
[2021-03-11 20:08:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-03-11 20:08:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-11 20:08:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions.
[2021-03-11 20:08:36,794 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8490740740740741
[2021-03-11 20:08:36,794 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions.
[2021-03-11 20:08:36,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions.
[2021-03-11 20:08:36,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:36,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions.
[2021-03-11 20:08:36,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 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-03-11 20:08:36,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-03-11 20:08:36,800 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-03-11 20:08:36,800 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states and 917 transitions.
[2021-03-11 20:08:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 140 flow
[2021-03-11 20:08:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 132 flow, removed 2 selfloop flow, removed 4 redundant places.
[2021-03-11 20:08:36,802 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow
[2021-03-11 20:08:36,802 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31}
[2021-03-11 20:08:36,802 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2021-03-11 20:08:36,802 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 111 flow
[2021-03-11 20:08:36,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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-03-11 20:08:36,803 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:36,803 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:36,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-11 20:08:36,803 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1865275878, now seen corresponding path program 1 times
[2021-03-11 20:08:36,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:36,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791945981]
[2021-03-11 20:08:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:36,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:36,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:36,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:08:36,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:36,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:36,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791945981]
[2021-03-11 20:08:36,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:36,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 20:08:36,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613050878]
[2021-03-11 20:08:36,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 20:08:36,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:36,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 20:08:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-11 20:08:36,878 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216
[2021-03-11 20:08:36,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 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-03-11 20:08:36,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:36,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216
[2021-03-11 20:08:36,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:36,959 INFO L129 PetriNetUnfolder]: 66/159 cut-off events.
[2021-03-11 20:08:36,959 INFO L130 PetriNetUnfolder]: For 110/171 co-relation queries the response was YES.
[2021-03-11 20:08:36,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 159 events. 66/159 cut-off events. For 110/171 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 641 event pairs, 14 based on Foata normal form. 24/178 useless extension candidates. Maximal degree in co-relation 514. Up to 108 conditions per place.
[2021-03-11 20:08:36,964 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 9 changer transitions 9/44 dead transitions.
[2021-03-11 20:08:36,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 235 flow
[2021-03-11 20:08:36,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-03-11 20:08:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:08:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1100 transitions.
[2021-03-11 20:08:36,967 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8487654320987654
[2021-03-11 20:08:36,967 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1100 transitions.
[2021-03-11 20:08:36,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1100 transitions.
[2021-03-11 20:08:36,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:36,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1100 transitions.
[2021-03-11 20:08:36,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 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-03-11 20:08:36,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-03-11 20:08:36,974 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-03-11 20:08:36,974 INFO L185 Difference]: Start difference. First operand has 44 places, 31 transitions, 111 flow. Second operand 6 states and 1100 transitions.
[2021-03-11 20:08:36,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 235 flow
[2021-03-11 20:08:36,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places.
[2021-03-11 20:08:36,977 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow
[2021-03-11 20:08:36,977 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35}
[2021-03-11 20:08:36,977 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places.
[2021-03-11 20:08:36,977 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 176 flow
[2021-03-11 20:08:36,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 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-03-11 20:08:36,978 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:36,978 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:36,978 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-11 20:08:36,979 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash -308183217, now seen corresponding path program 1 times
[2021-03-11 20:08:36,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:36,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885355620]
[2021-03-11 20:08:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:37,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:08:37,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:37,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885355620]
[2021-03-11 20:08:37,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:37,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:08:37,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10562846]
[2021-03-11 20:08:37,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 20:08:37,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:37,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 20:08:37,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-11 20:08:37,176 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216
[2021-03-11 20:08:37,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 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-03-11 20:08:37,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:37,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216
[2021-03-11 20:08:37,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:37,251 INFO L129 PetriNetUnfolder]: 36/101 cut-off events.
[2021-03-11 20:08:37,251 INFO L130 PetriNetUnfolder]: For 232/319 co-relation queries the response was YES.
[2021-03-11 20:08:37,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 101 events. 36/101 cut-off events. For 232/319 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 308 event pairs, 2 based on Foata normal form. 27/125 useless extension candidates. Maximal degree in co-relation 436. Up to 68 conditions per place.
[2021-03-11 20:08:37,253 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 6 selfloop transitions, 13 changer transitions 9/48 dead transitions.
[2021-03-11 20:08:37,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 358 flow
[2021-03-11 20:08:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-11 20:08:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:08:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1283 transitions.
[2021-03-11 20:08:37,256 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8485449735449735
[2021-03-11 20:08:37,256 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1283 transitions.
[2021-03-11 20:08:37,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1283 transitions.
[2021-03-11 20:08:37,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:37,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1283 transitions.
[2021-03-11 20:08:37,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.28571428571428) internal successors, (1283), 7 states have internal predecessors, (1283), 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-03-11 20:08:37,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-03-11 20:08:37,263 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-03-11 20:08:37,263 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 176 flow. Second operand 7 states and 1283 transitions.
[2021-03-11 20:08:37,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 358 flow
[2021-03-11 20:08:37,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 26 selfloop flow, removed 4 redundant places.
[2021-03-11 20:08:37,269 INFO L241 Difference]: Finished difference. Result has 51 places, 39 transitions, 226 flow
[2021-03-11 20:08:37,269 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=51, PETRI_TRANSITIONS=39}
[2021-03-11 20:08:37,269 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2021-03-11 20:08:37,269 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 226 flow
[2021-03-11 20:08:37,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 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-03-11 20:08:37,270 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:37,270 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:37,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-11 20:08:37,270 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:37,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash -940530033, now seen corresponding path program 1 times
[2021-03-11 20:08:37,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:37,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030678934]
[2021-03-11 20:08:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:37,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 20:08:37,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:37,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030678934]
[2021-03-11 20:08:37,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:37,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 20:08:37,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724958821]
[2021-03-11 20:08:37,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 20:08:37,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 20:08:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-03-11 20:08:37,429 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216
[2021-03-11 20:08:37,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 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-03-11 20:08:37,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:37,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216
[2021-03-11 20:08:37,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:37,512 INFO L129 PetriNetUnfolder]: 20/63 cut-off events.
[2021-03-11 20:08:37,512 INFO L130 PetriNetUnfolder]: For 174/247 co-relation queries the response was YES.
[2021-03-11 20:08:37,512 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 63 events. 20/63 cut-off events. For 174/247 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 0 based on Foata normal form. 24/84 useless extension candidates. Maximal degree in co-relation 265. Up to 38 conditions per place.
[2021-03-11 20:08:37,513 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 2 selfloop transitions, 17 changer transitions 5/44 dead transitions.
[2021-03-11 20:08:37,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 330 flow
[2021-03-11 20:08:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-03-11 20:08:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:08:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1458 transitions.
[2021-03-11 20:08:37,517 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.84375
[2021-03-11 20:08:37,517 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1458 transitions.
[2021-03-11 20:08:37,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1458 transitions.
[2021-03-11 20:08:37,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:37,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1458 transitions.
[2021-03-11 20:08:37,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.25) internal successors, (1458), 8 states have internal predecessors, (1458), 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-03-11 20:08:37,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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-03-11 20:08:37,523 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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-03-11 20:08:37,523 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 226 flow. Second operand 8 states and 1458 transitions.
[2021-03-11 20:08:37,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 330 flow
[2021-03-11 20:08:37,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 264 flow, removed 23 selfloop flow, removed 6 redundant places.
[2021-03-11 20:08:37,527 INFO L241 Difference]: Finished difference. Result has 53 places, 39 transitions, 216 flow
[2021-03-11 20:08:37,527 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=39}
[2021-03-11 20:08:37,527 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2021-03-11 20:08:37,528 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 216 flow
[2021-03-11 20:08:37,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 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-03-11 20:08:37,530 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:37,530 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:37,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-11 20:08:37,531 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash 644486534, now seen corresponding path program 1 times
[2021-03-11 20:08:37,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:37,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031088248]
[2021-03-11 20:08:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:37,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:37,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:37,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-03-11 20:08:37,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:37,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031088248]
[2021-03-11 20:08:37,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:37,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 20:08:37,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649803511]
[2021-03-11 20:08:37,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 20:08:37,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 20:08:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-03-11 20:08:37,654 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216
[2021-03-11 20:08:37,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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-03-11 20:08:37,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:37,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216
[2021-03-11 20:08:37,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:37,750 INFO L129 PetriNetUnfolder]: 129/308 cut-off events.
[2021-03-11 20:08:37,751 INFO L130 PetriNetUnfolder]: For 366/391 co-relation queries the response was YES.
[2021-03-11 20:08:37,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 308 events. 129/308 cut-off events. For 366/391 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1490 event pairs, 14 based on Foata normal form. 2/297 useless extension candidates. Maximal degree in co-relation 914. Up to 91 conditions per place.
[2021-03-11 20:08:37,754 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 10 selfloop transitions, 11 changer transitions 1/52 dead transitions.
[2021-03-11 20:08:37,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 286 flow
[2021-03-11 20:08:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-03-11 20:08:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-03-11 20:08:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1019 transitions.
[2021-03-11 20:08:37,757 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7862654320987654
[2021-03-11 20:08:37,757 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1019 transitions.
[2021-03-11 20:08:37,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1019 transitions.
[2021-03-11 20:08:37,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:37,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1019 transitions.
[2021-03-11 20:08:37,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 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-03-11 20:08:37,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-03-11 20:08:37,762 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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-03-11 20:08:37,762 INFO L185 Difference]: Start difference. First operand has 53 places, 39 transitions, 216 flow. Second operand 6 states and 1019 transitions.
[2021-03-11 20:08:37,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 286 flow
[2021-03-11 20:08:37,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 222 flow, removed 19 selfloop flow, removed 7 redundant places.
[2021-03-11 20:08:37,767 INFO L241 Difference]: Finished difference. Result has 53 places, 48 transitions, 229 flow
[2021-03-11 20:08:37,767 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=229, PETRI_PLACES=53, PETRI_TRANSITIONS=48}
[2021-03-11 20:08:37,768 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2021-03-11 20:08:37,768 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 229 flow
[2021-03-11 20:08:37,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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-03-11 20:08:37,768 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:37,768 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:37,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-11 20:08:37,768 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1139114752, now seen corresponding path program 2 times
[2021-03-11 20:08:37,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:37,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625421594]
[2021-03-11 20:08:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:37,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:37,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:37,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:37,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-03-11 20:08:37,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:37,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:37,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625421594]
[2021-03-11 20:08:37,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:37,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:08:37,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687722614]
[2021-03-11 20:08:37,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 20:08:37,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 20:08:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-03-11 20:08:37,898 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 216
[2021-03-11 20:08:37,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-03-11 20:08:37,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:37,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 216
[2021-03-11 20:08:37,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:38,013 INFO L129 PetriNetUnfolder]: 201/476 cut-off events.
[2021-03-11 20:08:38,014 INFO L130 PetriNetUnfolder]: For 406/457 co-relation queries the response was YES.
[2021-03-11 20:08:38,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 476 events. 201/476 cut-off events. For 406/457 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2702 event pairs, 1 based on Foata normal form. 12/461 useless extension candidates. Maximal degree in co-relation 1411. Up to 129 conditions per place.
[2021-03-11 20:08:38,018 INFO L132 encePairwiseOnDemand]: 208/216 looper letters, 19 selfloop transitions, 17 changer transitions 1/68 dead transitions.
[2021-03-11 20:08:38,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 409 flow
[2021-03-11 20:08:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-11 20:08:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:08:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1167 transitions.
[2021-03-11 20:08:38,021 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7718253968253969
[2021-03-11 20:08:38,021 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1167 transitions.
[2021-03-11 20:08:38,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1167 transitions.
[2021-03-11 20:08:38,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:38,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1167 transitions.
[2021-03-11 20:08:38,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.71428571428572) internal successors, (1167), 7 states have internal predecessors, (1167), 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-03-11 20:08:38,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-03-11 20:08:38,027 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-03-11 20:08:38,027 INFO L185 Difference]: Start difference. First operand has 53 places, 48 transitions, 229 flow. Second operand 7 states and 1167 transitions.
[2021-03-11 20:08:38,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 409 flow
[2021-03-11 20:08:38,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places.
[2021-03-11 20:08:38,035 INFO L241 Difference]: Finished difference. Result has 62 places, 58 transitions, 356 flow
[2021-03-11 20:08:38,035 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=62, PETRI_TRANSITIONS=58}
[2021-03-11 20:08:38,036 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places.
[2021-03-11 20:08:38,036 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 356 flow
[2021-03-11 20:08:38,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-03-11 20:08:38,036 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:38,036 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:38,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-11 20:08:38,037 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1356999862, now seen corresponding path program 3 times
[2021-03-11 20:08:38,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:38,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966263511]
[2021-03-11 20:08:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:38,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:38,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:38,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:38,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-03-11 20:08:38,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:38,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966263511]
[2021-03-11 20:08:38,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:38,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 20:08:38,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292623594]
[2021-03-11 20:08:38,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 20:08:38,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:38,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 20:08:38,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-03-11 20:08:38,149 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216
[2021-03-11 20:08:38,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 167.5) internal successors, (1005), 6 states have internal predecessors, (1005), 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-03-11 20:08:38,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:38,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216
[2021-03-11 20:08:38,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:38,263 INFO L129 PetriNetUnfolder]: 252/577 cut-off events.
[2021-03-11 20:08:38,263 INFO L130 PetriNetUnfolder]: For 779/860 co-relation queries the response was YES.
[2021-03-11 20:08:38,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 577 events. 252/577 cut-off events. For 779/860 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3470 event pairs, 15 based on Foata normal form. 28/567 useless extension candidates. Maximal degree in co-relation 1832. Up to 167 conditions per place.
[2021-03-11 20:08:38,267 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 8 selfloop transitions, 4 changer transitions 24/66 dead transitions.
[2021-03-11 20:08:38,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 482 flow
[2021-03-11 20:08:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-03-11 20:08:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2021-03-11 20:08:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1188 transitions.
[2021-03-11 20:08:38,270 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857
[2021-03-11 20:08:38,270 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1188 transitions.
[2021-03-11 20:08:38,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1188 transitions.
[2021-03-11 20:08:38,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:38,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1188 transitions.
[2021-03-11 20:08:38,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.71428571428572) internal successors, (1188), 7 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-03-11 20:08:38,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-03-11 20:08:38,276 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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-03-11 20:08:38,277 INFO L185 Difference]: Start difference. First operand has 62 places, 58 transitions, 356 flow. Second operand 7 states and 1188 transitions.
[2021-03-11 20:08:38,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 482 flow
[2021-03-11 20:08:38,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 480 flow, removed 1 selfloop flow, removed 1 redundant places.
[2021-03-11 20:08:38,286 INFO L241 Difference]: Finished difference. Result has 68 places, 41 transitions, 214 flow
[2021-03-11 20:08:38,286 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=68, PETRI_TRANSITIONS=41}
[2021-03-11 20:08:38,286 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places.
[2021-03-11 20:08:38,286 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 214 flow
[2021-03-11 20:08:38,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 167.5) internal successors, (1005), 6 states have internal predecessors, (1005), 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-03-11 20:08:38,287 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:38,287 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:38,287 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-11 20:08:38,287 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:38,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1207877216, now seen corresponding path program 4 times
[2021-03-11 20:08:38,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:38,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862081550]
[2021-03-11 20:08:38,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:38,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 20:08:38,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:38,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:38,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:38,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862081550]
[2021-03-11 20:08:38,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:38,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 20:08:38,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098403133]
[2021-03-11 20:08:38,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 20:08:38,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 20:08:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-03-11 20:08:38,366 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 216
[2021-03-11 20:08:38,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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-03-11 20:08:38,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:38,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 216
[2021-03-11 20:08:38,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:38,414 INFO L129 PetriNetUnfolder]: 66/180 cut-off events.
[2021-03-11 20:08:38,414 INFO L130 PetriNetUnfolder]: For 180/184 co-relation queries the response was YES.
[2021-03-11 20:08:38,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 180 events. 66/180 cut-off events. For 180/184 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 762 event pairs, 6 based on Foata normal form. 2/171 useless extension candidates. Maximal degree in co-relation 517. Up to 53 conditions per place.
[2021-03-11 20:08:38,416 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 4 selfloop transitions, 2 changer transitions 3/43 dead transitions.
[2021-03-11 20:08:38,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 43 transitions, 240 flow
[2021-03-11 20:08:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-03-11 20:08:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2021-03-11 20:08:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 903 transitions.
[2021-03-11 20:08:38,418 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8361111111111111
[2021-03-11 20:08:38,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 903 transitions.
[2021-03-11 20:08:38,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 903 transitions.
[2021-03-11 20:08:38,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:38,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 903 transitions.
[2021-03-11 20:08:38,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.6) internal successors, (903), 5 states have internal predecessors, (903), 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-03-11 20:08:38,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-03-11 20:08:38,422 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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-03-11 20:08:38,422 INFO L185 Difference]: Start difference. First operand has 68 places, 41 transitions, 214 flow. Second operand 5 states and 903 transitions.
[2021-03-11 20:08:38,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 43 transitions, 240 flow
[2021-03-11 20:08:38,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 43 transitions, 213 flow, removed 7 selfloop flow, removed 7 redundant places.
[2021-03-11 20:08:38,425 INFO L241 Difference]: Finished difference. Result has 62 places, 40 transitions, 196 flow
[2021-03-11 20:08:38,426 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=40}
[2021-03-11 20:08:38,426 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places.
[2021-03-11 20:08:38,426 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 196 flow
[2021-03-11 20:08:38,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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-03-11 20:08:38,427 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:38,427 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:38,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-11 20:08:38,427 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:38,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1567912314, now seen corresponding path program 5 times
[2021-03-11 20:08:38,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:38,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904964712]
[2021-03-11 20:08:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 20:08:38,562 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.8 percent of original size
[2021-03-11 20:08:38,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30
[2021-03-11 20:08:38,582 INFO L142 QuantifierPusher]: treesize reduction 3, result has 93.5 percent of original size
[2021-03-11 20:08:38,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43
[2021-03-11 20:08:38,612 INFO L142 QuantifierPusher]: treesize reduction 9, result has 64.0 percent of original size
[2021-03-11 20:08:38,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 20:08:38,624 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size
[2021-03-11 20:08:38,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32
[2021-03-11 20:08:38,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 20:08:38,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 20:08:38,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 20:08:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 20:08:38,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904964712]
[2021-03-11 20:08:38,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 20:08:38,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 20:08:38,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495384278]
[2021-03-11 20:08:38,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 20:08:38,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 20:08:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 20:08:38,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2021-03-11 20:08:38,667 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 216
[2021-03-11 20:08:38,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 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-03-11 20:08:38,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-03-11 20:08:38,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 216
[2021-03-11 20:08:38,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-03-11 20:08:38,839 INFO L129 PetriNetUnfolder]: 183/399 cut-off events.
[2021-03-11 20:08:38,839 INFO L130 PetriNetUnfolder]: For 419/439 co-relation queries the response was YES.
[2021-03-11 20:08:38,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 399 events. 183/399 cut-off events. For 419/439 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2171 event pairs, 16 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1181. Up to 133 conditions per place.
[2021-03-11 20:08:38,842 INFO L132 encePairwiseOnDemand]: 208/216 looper letters, 7 selfloop transitions, 7 changer transitions 3/49 dead transitions.
[2021-03-11 20:08:38,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 49 transitions, 258 flow
[2021-03-11 20:08:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-03-11 20:08:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2021-03-11 20:08:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1298 transitions.
[2021-03-11 20:08:38,845 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7511574074074074
[2021-03-11 20:08:38,845 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1298 transitions.
[2021-03-11 20:08:38,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1298 transitions.
[2021-03-11 20:08:38,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-03-11 20:08:38,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1298 transitions.
[2021-03-11 20:08:38,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.25) internal successors, (1298), 8 states have internal predecessors, (1298), 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-03-11 20:08:38,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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-03-11 20:08:38,851 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 216.0) internal successors, (1944), 9 states have internal predecessors, (1944), 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-03-11 20:08:38,852 INFO L185 Difference]: Start difference. First operand has 62 places, 40 transitions, 196 flow. Second operand 8 states and 1298 transitions.
[2021-03-11 20:08:38,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 49 transitions, 258 flow
[2021-03-11 20:08:38,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 49 transitions, 252 flow, removed 1 selfloop flow, removed 4 redundant places.
[2021-03-11 20:08:38,856 INFO L241 Difference]: Finished difference. Result has 69 places, 45 transitions, 245 flow
[2021-03-11 20:08:38,856 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=245, PETRI_PLACES=69, PETRI_TRANSITIONS=45}
[2021-03-11 20:08:38,857 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places.
[2021-03-11 20:08:38,857 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 245 flow
[2021-03-11 20:08:38,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 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-03-11 20:08:38,869 INFO L247 CegarLoopForPetriNet]: Found error trace
[2021-03-11 20:08:38,869 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 20:08:38,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-03-11 20:08:38,869 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 20:08:38,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 20:08:38,870 INFO L82 PathProgramCache]: Analyzing trace with hash 101262844, now seen corresponding path program 6 times
[2021-03-11 20:08:38,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 20:08:38,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968861087]
[2021-03-11 20:08:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 20:08:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 20:08:38,918 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 20:08:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 20:08:38,952 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 20:08:38,979 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-11 20:08:38,979 INFO L620 BasicCegarLoop]: Counterexample might be feasible
[2021-03-11 20:08:38,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-03-11 20:08:39,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:08:39 BasicIcfg
[2021-03-11 20:08:39,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-11 20:08:39,077 INFO L168 Benchmark]: Toolchain (without parser) took 11614.04 ms. Allocated memory was 255.9 MB in the beginning and 557.8 MB in the end (delta: 302.0 MB). Free memory was 232.6 MB in the beginning and 403.3 MB in the end (delta: -170.7 MB). Peak memory consumption was 131.1 MB. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,078 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.80 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 232.2 MB in the beginning and 311.4 MB in the end (delta: -79.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.40 ms. Allocated memory is still 352.3 MB. Free memory was 311.4 MB in the beginning and 308.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,078 INFO L168 Benchmark]: Boogie Preprocessor took 64.00 ms. Allocated memory is still 352.3 MB. Free memory was 308.8 MB in the beginning and 306.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,079 INFO L168 Benchmark]: RCFGBuilder took 1748.05 ms. Allocated memory is still 352.3 MB. Free memory was 306.7 MB in the beginning and 318.6 MB in the end (delta: -11.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,079 INFO L168 Benchmark]: TraceAbstraction took 9174.37 ms. Allocated memory was 352.3 MB in the beginning and 557.8 MB in the end (delta: 205.5 MB). Free memory was 318.6 MB in the beginning and 403.3 MB in the end (delta: -84.7 MB). Peak memory consumption was 121.9 MB. Max. memory is 16.0 GB.
[2021-03-11 20:08:39,080 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 547.80 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 232.2 MB in the beginning and 311.4 MB in the end (delta: -79.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 72.40 ms. Allocated memory is still 352.3 MB. Free memory was 311.4 MB in the beginning and 308.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 64.00 ms. Allocated memory is still 352.3 MB. Free memory was 308.8 MB in the beginning and 306.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1748.05 ms. Allocated memory is still 352.3 MB. Free memory was 306.7 MB in the beginning and 318.6 MB in the end (delta: -11.9 MB). Peak memory consumption was 65.6 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 9174.37 ms. Allocated memory was 352.3 MB in the beginning and 557.8 MB in the end (delta: 205.5 MB). Free memory was 318.6 MB in the beginning and 403.3 MB in the end (delta: -84.7 MB). Peak memory consumption was 121.9 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 5962.5ms, 126 PlacesBefore, 42 PlacesAfterwards, 115 TransitionsBefore, 30 TransitionsAfterwards, 2610 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 6523 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3318, positive: 3138, positive conditional: 0, positive unconditional: 3138, negative: 180, negative conditional: 0, negative unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1763, positive: 1718, positive conditional: 0, positive unconditional: 1718, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1763, positive: 1701, positive conditional: 0, positive unconditional: 1701, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 518, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 466, negative conditional: 0, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3318, positive: 1420, positive conditional: 0, positive unconditional: 1420, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 1763, unknown conditional: 0, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L718] 0 int __unbuffered_p3_EAX = 0;
[L720] 0 int __unbuffered_p3_EBX = 0;
[L722] 0 int a = 0;
[L724] 0 int b = 0;
[L725] 0 _Bool main$tmp_guard0;
[L726] 0 _Bool main$tmp_guard1;
[L728] 0 int x = 0;
[L730] 0 int y = 0;
[L731] 0 _Bool y$flush_delayed;
[L732] 0 int y$mem_tmp;
[L733] 0 _Bool y$r_buff0_thd0;
[L734] 0 _Bool y$r_buff0_thd1;
[L735] 0 _Bool y$r_buff0_thd2;
[L736] 0 _Bool y$r_buff0_thd3;
[L737] 0 _Bool y$r_buff0_thd4;
[L738] 0 _Bool y$r_buff1_thd0;
[L739] 0 _Bool y$r_buff1_thd1;
[L740] 0 _Bool y$r_buff1_thd2;
[L741] 0 _Bool y$r_buff1_thd3;
[L742] 0 _Bool y$r_buff1_thd4;
[L743] 0 _Bool y$read_delayed;
[L744] 0 int *y$read_delayed_var;
[L745] 0 int y$w_buff0;
[L746] 0 _Bool y$w_buff0_used;
[L747] 0 int y$w_buff1;
[L748] 0 _Bool y$w_buff1_used;
[L750] 0 int z = 0;
[L751] 0 _Bool weak$$choice0;
[L752] 0 _Bool weak$$choice2;
[L863] 0 pthread_t t941;
[L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L865] 0 pthread_t t942;
[L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L867] 0 pthread_t t943;
[L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L869] 0 pthread_t t944;
[L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L799] 3 y$w_buff1 = y$w_buff0
[L800] 3 y$w_buff0 = 1
[L801] 3 y$w_buff1_used = y$w_buff0_used
[L802] 3 y$w_buff0_used = (_Bool)1
[L18] COND FALSE 3 !(!expression)
[L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4
[L809] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L812] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L829] 4 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L832] 4 a = 1
[L835] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L838] 4 __unbuffered_p3_EBX = b
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 b = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L759] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L771] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L843] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L844] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L845] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L774] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L775] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L776] 2 y$flush_delayed = weak$$choice2
[L777] 2 y$mem_tmp = y
[L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L785] 2 __unbuffered_p1_EAX = y
[L786] EXPR 2 y$flush_delayed ? y$mem_tmp : y
[L786] 2 y = y$flush_delayed ? y$mem_tmp : y
[L787] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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]
[L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L819] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L824] 3 return 0;
[L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L766] 1 return 0;
[L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L794] 2 return 0;
[L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L850] 4 return 0;
[L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L3] COND FALSE 0 !(!cond)
[L876] 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)
[L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L876] 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)
[L876] 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)
[L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L878] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L878] 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
[L879] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L880] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L880] 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
[L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8966.7ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1182.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6038.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 74 SDtfs, 63 SDslu, 115 SDs, 0 SdLazy, 309 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 281.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 413.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=8, InterpolantAutomatonStates: 67, 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: 46.8ms SsaConstructionTime, 561.2ms SatisfiabilityAnalysisTime, 852.0ms InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 1327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...