/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065
[2021-06-10 12:30:55,306 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-10 12:30:55,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-10 12:30:55,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-10 12:30:55,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-10 12:30:55,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-10 12:30:55,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-10 12:30:55,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-10 12:30:55,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-10 12:30:55,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-10 12:30:55,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-10 12:30:55,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-10 12:30:55,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-10 12:30:55,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-10 12:30:55,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-10 12:30:55,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-10 12:30:55,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-10 12:30:55,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-10 12:30:55,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-10 12:30:55,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-10 12:30:55,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-10 12:30:55,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-10 12:30:55,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-10 12:30:55,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-10 12:30:55,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-10 12:30:55,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-10 12:30:55,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-10 12:30:55,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-10 12:30:55,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-10 12:30:55,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-10 12:30:55,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-10 12:30:55,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-10 12:30:55,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-10 12:30:55,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-10 12:30:55,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-10 12:30:55,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-10 12:30:55,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-10 12:30:55,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-10 12:30:55,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-10 12:30:55,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-10 12:30:55,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-10 12:30:55,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf
[2021-06-10 12:30:55,438 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-10 12:30:55,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-10 12:30:55,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-10 12:30:55,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-10 12:30:55,441 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-10 12:30:55,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-10 12:30:55,441 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-10 12:30:55,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-10 12:30:55,442 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-10 12:30:55,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-10 12:30:55,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-10 12:30:55,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-10 12:30:55,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-10 12:30:55,443 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-10 12:30:55,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-10 12:30:55,443 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-10 12:30:55,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-10 12:30:55,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-10 12:30:55,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-10 12:30:55,444 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-10 12:30:55,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-10 12:30:55,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 12:30:55,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2021-06-10 12:30:55,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2021-06-10 12:30:55,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-10 12:30:55,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-10 12:30:55,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-10 12:30:55,743 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-10 12:30:55,743 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-10 12:30:55,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i
[2021-06-10 12:30:55,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17a7adff/8cb30b92a5ad4b1aa4eb901dcf3a798a/FLAGbed1f57ee
[2021-06-10 12:30:56,281 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-10 12:30:56,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i
[2021-06-10 12:30:56,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17a7adff/8cb30b92a5ad4b1aa4eb901dcf3a798a/FLAGbed1f57ee
[2021-06-10 12:30:56,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f17a7adff/8cb30b92a5ad4b1aa4eb901dcf3a798a
[2021-06-10 12:30:56,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-10 12:30:56,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-10 12:30:56,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-10 12:30:56,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-10 12:30:56,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-10 12:30:56,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f1406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56, skipping insertion in model container
[2021-06-10 12:30:56,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-10 12:30:56,374 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-10 12:30:56,513 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/safe034_power.oepc.i[952,965]
[2021-06-10 12:30:56,721 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 12:30:56,728 INFO L203 MainTranslator]: Completed pre-run
[2021-06-10 12:30:56,741 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/safe034_power.oepc.i[952,965]
[2021-06-10 12:30:56,799 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-10 12:30:56,865 INFO L208 MainTranslator]: Completed translation
[2021-06-10 12:30:56,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56 WrapperNode
[2021-06-10 12:30:56,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-10 12:30:56,867 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-10 12:30:56,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-10 12:30:56,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-10 12:30:56,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-10 12:30:56,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-10 12:30:56,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-10 12:30:56,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-10 12:30:56,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,929 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
[2021-06-10 12:30:56,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-10 12:30:56,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-10 12:30:56,940 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-10 12:30:56,940 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-10 12:30:56,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-10 12:30:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-10 12:30:57,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-10 12:30:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-10 12:30:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-10 12:30:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-10 12:30:57,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-10 12:30:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-10 12:30:57,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-10 12:30:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-10 12:30:57,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-10 12:30:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-10 12:30:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-10 12:30:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-10 12:30:57,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-10 12:30:57,015 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-10 12:30:58,532 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-10 12:30:58,532 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-10 12:30:58,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:30:58 BoogieIcfgContainer
[2021-06-10 12:30:58,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-10 12:30:58,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-10 12:30:58,535 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-10 12:30:58,538 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-10 12:30:58,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:30:56" (1/3) ...
[2021-06-10 12:30:58,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535ff4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:30:58, skipping insertion in model container
[2021-06-10 12:30:58,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:30:56" (2/3) ...
[2021-06-10 12:30:58,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535ff4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:30:58, skipping insertion in model container
[2021-06-10 12:30:58,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:30:58" (3/3) ...
[2021-06-10 12:30:58,540 INFO L111 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i
[2021-06-10 12:30:58,546 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-10 12:30:58,549 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-06-10 12:30:58,550 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-10 12:30:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,577 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,577 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,579 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,591 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,592 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,594 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,595 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,602 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,603 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-10 12:30:58,605 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-10 12:30:58,621 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-06-10 12:30:58,637 INFO L376 AbstractCegarLoop]: Interprodecural is true
[2021-06-10 12:30:58,637 INFO L377 AbstractCegarLoop]: Hoare is false
[2021-06-10 12:30:58,637 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-10 12:30:58,637 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-10 12:30:58,637 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-10 12:30:58,637 INFO L381 AbstractCegarLoop]: Difference is false
[2021-06-10 12:30:58,637 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-10 12:30:58,637 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-06-10 12:30:58,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow
[2021-06-10 12:30:58,682 INFO L129 PetriNetUnfolder]: 2/93 cut-off events.
[2021-06-10 12:30:58,682 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:30:58,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place.
[2021-06-10 12:30:58,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow
[2021-06-10 12:30:58,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow
[2021-06-10 12:30:58,700 INFO L129 PetriNetUnfolder]: 0/60 cut-off events.
[2021-06-10 12:30:58,701 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:30:58,701 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:30:58,702 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:30:58,702 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:30:58,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:30:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1412944265, now seen corresponding path program 1 times
[2021-06-10 12:30:58,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:30:58,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070238738]
[2021-06-10 12:30:58,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:30:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:30:58,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:58,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:30:58,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:58,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:30:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:30:58,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070238738]
[2021-06-10 12:30:58,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:30:58,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-10 12:30:58,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739531771]
[2021-06-10 12:30:58,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-10 12:30:58,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:30:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-10 12:30:58,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-10 12:30:58,958 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 96
[2021-06-10 12:30:58,963 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 93 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:58,963 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:30:58,963 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 96
[2021-06-10 12:30:58,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:30:59,024 INFO L129 PetriNetUnfolder]: 9/150 cut-off events.
[2021-06-10 12:30:59,024 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:30:59,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 150 events. 9/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 322 event pairs, 3 based on Foata normal form. 6/148 useless extension candidates. Maximal degree in co-relation 136. Up to 17 conditions per place.
[2021-06-10 12:30:59,030 INFO L132 encePairwiseOnDemand]: 91/96 looper letters, 5 selfloop transitions, 2 changer transitions 0/91 dead transitions.
[2021-06-10 12:30:59,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 91 transitions, 205 flow
[2021-06-10 12:30:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-10 12:30:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-06-10 12:30:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions.
[2021-06-10 12:30:59,042 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9479166666666666
[2021-06-10 12:30:59,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions.
[2021-06-10 12:30:59,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions.
[2021-06-10 12:30:59,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:30:59,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions.
[2021-06-10 12:30:59,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,055 INFO L185 Difference]: Start difference. First operand has 101 places, 93 transitions, 195 flow. Second operand 3 states and 273 transitions.
[2021-06-10 12:30:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 91 transitions, 205 flow
[2021-06-10 12:30:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 91 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-06-10 12:30:59,062 INFO L241 Difference]: Finished difference. Result has 98 places, 89 transitions, 188 flow
[2021-06-10 12:30:59,064 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=98, PETRI_TRANSITIONS=89}
[2021-06-10 12:30:59,065 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, -3 predicate places.
[2021-06-10 12:30:59,065 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 188 flow
[2021-06-10 12:30:59,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,065 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:30:59,065 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:30:59,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-10 12:30:59,066 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:30:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:30:59,066 INFO L82 PathProgramCache]: Analyzing trace with hash 918452473, now seen corresponding path program 1 times
[2021-06-10 12:30:59,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:30:59,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213047746]
[2021-06-10 12:30:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:30:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:30:59,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:30:59,211 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-06-10 12:30:59,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 12:30:59,220 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:30:59,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:30:59,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:30:59,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:30:59,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:30:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:30:59,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213047746]
[2021-06-10 12:30:59,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:30:59,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-10 12:30:59,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084069475]
[2021-06-10 12:30:59,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-10 12:30:59,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:30:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-10 12:30:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-10 12:30:59,256 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 96
[2021-06-10 12:30:59,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:30:59,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 96
[2021-06-10 12:30:59,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:30:59,590 INFO L129 PetriNetUnfolder]: 239/952 cut-off events.
[2021-06-10 12:30:59,590 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-06-10 12:30:59,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 952 events. 239/952 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7084 event pairs, 50 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1349. Up to 173 conditions per place.
[2021-06-10 12:30:59,601 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 16 selfloop transitions, 5 changer transitions 44/131 dead transitions.
[2021-06-10 12:30:59,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 131 transitions, 384 flow
[2021-06-10 12:30:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-10 12:30:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-06-10 12:30:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions.
[2021-06-10 12:30:59,642 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8900462962962963
[2021-06-10 12:30:59,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions.
[2021-06-10 12:30:59,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions.
[2021-06-10 12:30:59,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:30:59,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions.
[2021-06-10 12:30:59,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.44444444444444) internal successors, (769), 9 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,651 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,651 INFO L185 Difference]: Start difference. First operand has 98 places, 89 transitions, 188 flow. Second operand 9 states and 769 transitions.
[2021-06-10 12:30:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 131 transitions, 384 flow
[2021-06-10 12:30:59,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 131 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-06-10 12:30:59,655 INFO L241 Difference]: Finished difference. Result has 112 places, 83 transitions, 238 flow
[2021-06-10 12:30:59,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=112, PETRI_TRANSITIONS=83}
[2021-06-10 12:30:59,656 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places.
[2021-06-10 12:30:59,656 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 238 flow
[2021-06-10 12:30:59,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,657 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:30:59,657 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:30:59,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-10 12:30:59,657 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:30:59,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:30:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1239373608, now seen corresponding path program 1 times
[2021-06-10 12:30:59,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:30:59,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683710724]
[2021-06-10 12:30:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:30:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:30:59,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:30:59,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:30:59,745 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:30:59,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:30:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:30:59,773 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:30:59,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:30:59,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:30:59,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:30:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:30:59,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683710724]
[2021-06-10 12:30:59,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:30:59,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-10 12:30:59,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158027790]
[2021-06-10 12:30:59,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-10 12:30:59,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:30:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-10 12:30:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-10 12:30:59,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96
[2021-06-10 12:30:59,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:30:59,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:30:59,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96
[2021-06-10 12:30:59,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:00,089 INFO L129 PetriNetUnfolder]: 442/1172 cut-off events.
[2021-06-10 12:31:00,089 INFO L130 PetriNetUnfolder]: For 493/516 co-relation queries the response was YES.
[2021-06-10 12:31:00,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 1172 events. 442/1172 cut-off events. For 493/516 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 9284 event pairs, 46 based on Foata normal form. 12/1060 useless extension candidates. Maximal degree in co-relation 2322. Up to 290 conditions per place.
[2021-06-10 12:31:00,102 INFO L132 encePairwiseOnDemand]: 86/96 looper letters, 24 selfloop transitions, 17 changer transitions 0/113 dead transitions.
[2021-06-10 12:31:00,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 113 transitions, 380 flow
[2021-06-10 12:31:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-10 12:31:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-06-10 12:31:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 863 transitions.
[2021-06-10 12:31:00,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8989583333333333
[2021-06-10 12:31:00,106 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 863 transitions.
[2021-06-10 12:31:00,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 863 transitions.
[2021-06-10 12:31:00,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:00,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 863 transitions.
[2021-06-10 12:31:00,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,114 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,114 INFO L185 Difference]: Start difference. First operand has 112 places, 83 transitions, 238 flow. Second operand 10 states and 863 transitions.
[2021-06-10 12:31:00,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 113 transitions, 380 flow
[2021-06-10 12:31:00,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 113 transitions, 364 flow, removed 3 selfloop flow, removed 2 redundant places.
[2021-06-10 12:31:00,129 INFO L241 Difference]: Finished difference. Result has 109 places, 98 transitions, 342 flow
[2021-06-10 12:31:00,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=342, PETRI_PLACES=109, PETRI_TRANSITIONS=98}
[2021-06-10 12:31:00,129 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places.
[2021-06-10 12:31:00,130 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 98 transitions, 342 flow
[2021-06-10 12:31:00,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 83.16666666666667) internal successors, (499), 6 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,130 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:00,130 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:00,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-10 12:31:00,131 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2027617097, now seen corresponding path program 1 times
[2021-06-10 12:31:00,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:00,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928582506]
[2021-06-10 12:31:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:31:00,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:00,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:00,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:00,247 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:31:00,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:31:00,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:31:00,277 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:31:00,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:00,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:31:00,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928582506]
[2021-06-10 12:31:00,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:31:00,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:31:00,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253856243]
[2021-06-10 12:31:00,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:31:00,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:31:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:31:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:31:00,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96
[2021-06-10 12:31:00,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 98 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:31:00,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96
[2021-06-10 12:31:00,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:00,623 INFO L129 PetriNetUnfolder]: 360/1069 cut-off events.
[2021-06-10 12:31:00,623 INFO L130 PetriNetUnfolder]: For 2257/3183 co-relation queries the response was YES.
[2021-06-10 12:31:00,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3383 conditions, 1069 events. 360/1069 cut-off events. For 2257/3183 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 8550 event pairs, 15 based on Foata normal form. 145/1141 useless extension candidates. Maximal degree in co-relation 3322. Up to 363 conditions per place.
[2021-06-10 12:31:00,633 INFO L132 encePairwiseOnDemand]: 86/96 looper letters, 20 selfloop transitions, 32 changer transitions 9/133 dead transitions.
[2021-06-10 12:31:00,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 688 flow
[2021-06-10 12:31:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-10 12:31:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-06-10 12:31:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions.
[2021-06-10 12:31:00,636 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8998397435897436
[2021-06-10 12:31:00,636 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1123 transitions.
[2021-06-10 12:31:00,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1123 transitions.
[2021-06-10 12:31:00,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:00,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1123 transitions.
[2021-06-10 12:31:00,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 86.38461538461539) internal successors, (1123), 13 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,642 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 96.0) internal successors, (1344), 14 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,643 INFO L185 Difference]: Start difference. First operand has 109 places, 98 transitions, 342 flow. Second operand 13 states and 1123 transitions.
[2021-06-10 12:31:00,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 688 flow
[2021-06-10 12:31:00,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 680 flow, removed 3 selfloop flow, removed 4 redundant places.
[2021-06-10 12:31:00,652 INFO L241 Difference]: Finished difference. Result has 121 places, 118 transitions, 577 flow
[2021-06-10 12:31:00,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=577, PETRI_PLACES=121, PETRI_TRANSITIONS=118}
[2021-06-10 12:31:00,652 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 20 predicate places.
[2021-06-10 12:31:00,652 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 577 flow
[2021-06-10 12:31:00,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 83.14285714285714) internal successors, (582), 7 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,653 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:00,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:00,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-10 12:31:00,653 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:00,654 INFO L82 PathProgramCache]: Analyzing trace with hash 413076887, now seen corresponding path program 1 times
[2021-06-10 12:31:00,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:00,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966798320]
[2021-06-10 12:31:00,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:31:00,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:00,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:00,784 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-06-10 12:31:00,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 12:31:00,793 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:31:00,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:31:00,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:00,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:00,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:00,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:31:00,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966798320]
[2021-06-10 12:31:00,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:31:00,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-10 12:31:00,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399636215]
[2021-06-10 12:31:00,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-10 12:31:00,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:31:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-10 12:31:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-10 12:31:00,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 96
[2021-06-10 12:31:00,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:00,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:31:00,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 96
[2021-06-10 12:31:00,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:01,186 INFO L129 PetriNetUnfolder]: 318/1362 cut-off events.
[2021-06-10 12:31:01,186 INFO L130 PetriNetUnfolder]: For 3407/3881 co-relation queries the response was YES.
[2021-06-10 12:31:01,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4241 conditions, 1362 events. 318/1362 cut-off events. For 3407/3881 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 12350 event pairs, 0 based on Foata normal form. 13/1306 useless extension candidates. Maximal degree in co-relation 4174. Up to 346 conditions per place.
[2021-06-10 12:31:01,198 INFO L132 encePairwiseOnDemand]: 86/96 looper letters, 25 selfloop transitions, 11 changer transitions 13/148 dead transitions.
[2021-06-10 12:31:01,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 815 flow
[2021-06-10 12:31:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-10 12:31:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-06-10 12:31:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 896 transitions.
[2021-06-10 12:31:01,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485
[2021-06-10 12:31:01,201 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 896 transitions.
[2021-06-10 12:31:01,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 896 transitions.
[2021-06-10 12:31:01,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:01,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 896 transitions.
[2021-06-10 12:31:01,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.45454545454545) internal successors, (896), 11 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 96.0) internal successors, (1152), 12 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,207 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 96.0) internal successors, (1152), 12 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,207 INFO L185 Difference]: Start difference. First operand has 121 places, 118 transitions, 577 flow. Second operand 11 states and 896 transitions.
[2021-06-10 12:31:01,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 815 flow
[2021-06-10 12:31:01,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 148 transitions, 701 flow, removed 44 selfloop flow, removed 6 redundant places.
[2021-06-10 12:31:01,239 INFO L241 Difference]: Finished difference. Result has 134 places, 125 transitions, 568 flow
[2021-06-10 12:31:01,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=568, PETRI_PLACES=134, PETRI_TRANSITIONS=125}
[2021-06-10 12:31:01,240 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 33 predicate places.
[2021-06-10 12:31:01,240 INFO L480 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 568 flow
[2021-06-10 12:31:01,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,241 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:01,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:01,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-10 12:31:01,241 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1803354243, now seen corresponding path program 2 times
[2021-06-10 12:31:01,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:01,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832186801]
[2021-06-10 12:31:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:31:01,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:01,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:01,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:01,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:01,371 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-06-10 12:31:01,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-06-10 12:31:01,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-06-10 12:31:01,397 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size
[2021-06-10 12:31:01,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:01,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:31:01,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832186801]
[2021-06-10 12:31:01,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:31:01,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-10 12:31:01,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956047000]
[2021-06-10 12:31:01,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-10 12:31:01,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:31:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-10 12:31:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-10 12:31:01,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96
[2021-06-10 12:31:01,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 568 flow. Second operand has 8 states, 8 states have (on average 83.125) internal successors, (665), 8 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:31:01,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96
[2021-06-10 12:31:01,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:01,820 INFO L129 PetriNetUnfolder]: 424/1336 cut-off events.
[2021-06-10 12:31:01,820 INFO L130 PetriNetUnfolder]: For 2190/3634 co-relation queries the response was YES.
[2021-06-10 12:31:01,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4028 conditions, 1336 events. 424/1336 cut-off events. For 2190/3634 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 12053 event pairs, 0 based on Foata normal form. 242/1472 useless extension candidates. Maximal degree in co-relation 3999. Up to 210 conditions per place.
[2021-06-10 12:31:01,834 INFO L132 encePairwiseOnDemand]: 86/96 looper letters, 16 selfloop transitions, 36 changer transitions 20/151 dead transitions.
[2021-06-10 12:31:01,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 151 transitions, 854 flow
[2021-06-10 12:31:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2021-06-10 12:31:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-06-10 12:31:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1368 transitions.
[2021-06-10 12:31:01,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.890625
[2021-06-10 12:31:01,838 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1368 transitions.
[2021-06-10 12:31:01,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1368 transitions.
[2021-06-10 12:31:01,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:01,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1368 transitions.
[2021-06-10 12:31:01,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.5) internal successors, (1368), 16 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 96.0) internal successors, (1632), 17 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,845 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 96.0) internal successors, (1632), 17 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,845 INFO L185 Difference]: Start difference. First operand has 134 places, 125 transitions, 568 flow. Second operand 16 states and 1368 transitions.
[2021-06-10 12:31:01,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 151 transitions, 854 flow
[2021-06-10 12:31:01,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 151 transitions, 812 flow, removed 21 selfloop flow, removed 6 redundant places.
[2021-06-10 12:31:01,861 INFO L241 Difference]: Finished difference. Result has 144 places, 125 transitions, 644 flow
[2021-06-10 12:31:01,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=644, PETRI_PLACES=144, PETRI_TRANSITIONS=125}
[2021-06-10 12:31:01,862 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 43 predicate places.
[2021-06-10 12:31:01,862 INFO L480 AbstractCegarLoop]: Abstraction has has 144 places, 125 transitions, 644 flow
[2021-06-10 12:31:01,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 83.125) internal successors, (665), 8 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,862 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:01,862 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:01,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-10 12:31:01,863 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1878982687, now seen corresponding path program 1 times
[2021-06-10 12:31:01,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:01,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403548394]
[2021-06-10 12:31:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:31:01,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:01,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:01,960 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:31:01,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:31:01,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:01,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:01,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:01,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:31:01,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403548394]
[2021-06-10 12:31:01,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:31:01,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-10 12:31:01,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367580692]
[2021-06-10 12:31:01,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-10 12:31:01,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:31:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-10 12:31:01,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-10 12:31:01,997 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96
[2021-06-10 12:31:01,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 125 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:01,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:31:01,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96
[2021-06-10 12:31:01,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:02,215 INFO L129 PetriNetUnfolder]: 319/1327 cut-off events.
[2021-06-10 12:31:02,215 INFO L130 PetriNetUnfolder]: For 2982/3195 co-relation queries the response was YES.
[2021-06-10 12:31:02,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3985 conditions, 1327 events. 319/1327 cut-off events. For 2982/3195 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 12969 event pairs, 0 based on Foata normal form. 1/1234 useless extension candidates. Maximal degree in co-relation 3910. Up to 171 conditions per place.
[2021-06-10 12:31:02,225 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 8 selfloop transitions, 5 changer transitions 10/132 dead transitions.
[2021-06-10 12:31:02,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 132 transitions, 717 flow
[2021-06-10 12:31:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-06-10 12:31:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2021-06-10 12:31:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions.
[2021-06-10 12:31:02,228 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.890625
[2021-06-10 12:31:02,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 513 transitions.
[2021-06-10 12:31:02,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 513 transitions.
[2021-06-10 12:31:02,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:02,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 513 transitions.
[2021-06-10 12:31:02,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,231 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,231 INFO L185 Difference]: Start difference. First operand has 144 places, 125 transitions, 644 flow. Second operand 6 states and 513 transitions.
[2021-06-10 12:31:02,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 132 transitions, 717 flow
[2021-06-10 12:31:02,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 648 flow, removed 10 selfloop flow, removed 14 redundant places.
[2021-06-10 12:31:02,262 INFO L241 Difference]: Finished difference. Result has 136 places, 122 transitions, 578 flow
[2021-06-10 12:31:02,262 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=136, PETRI_TRANSITIONS=122}
[2021-06-10 12:31:02,262 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 35 predicate places.
[2021-06-10 12:31:02,262 INFO L480 AbstractCegarLoop]: Abstraction has has 136 places, 122 transitions, 578 flow
[2021-06-10 12:31:02,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,262 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:02,263 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:02,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-10 12:31:02,263 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1387385611, now seen corresponding path program 2 times
[2021-06-10 12:31:02,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:02,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039760550]
[2021-06-10 12:31:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:31:02,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:02,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:02,401 INFO L142 QuantifierPusher]: treesize reduction 10, result has 73.7 percent of original size
[2021-06-10 12:31:02,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28
[2021-06-10 12:31:02,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-06-10 12:31:02,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:02,444 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:31:02,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:31:02,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:02,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:02,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:31:02,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039760550]
[2021-06-10 12:31:02,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:31:02,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-10 12:31:02,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648003242]
[2021-06-10 12:31:02,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-10 12:31:02,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:31:02,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-10 12:31:02,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-06-10 12:31:02,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 96
[2021-06-10 12:31:02,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 122 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:31:02,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 96
[2021-06-10 12:31:02,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:02,740 INFO L129 PetriNetUnfolder]: 250/1035 cut-off events.
[2021-06-10 12:31:02,740 INFO L130 PetriNetUnfolder]: For 1459/1483 co-relation queries the response was YES.
[2021-06-10 12:31:02,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 1035 events. 250/1035 cut-off events. For 1459/1483 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 9436 event pairs, 0 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 2940. Up to 138 conditions per place.
[2021-06-10 12:31:02,748 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 14 selfloop transitions, 7 changer transitions 9/131 dead transitions.
[2021-06-10 12:31:02,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 131 transitions, 684 flow
[2021-06-10 12:31:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-10 12:31:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-06-10 12:31:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 765 transitions.
[2021-06-10 12:31:02,751 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.796875
[2021-06-10 12:31:02,751 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 765 transitions.
[2021-06-10 12:31:02,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 765 transitions.
[2021-06-10 12:31:02,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:02,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 765 transitions.
[2021-06-10 12:31:02,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.5) internal successors, (765), 10 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,755 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,755 INFO L185 Difference]: Start difference. First operand has 136 places, 122 transitions, 578 flow. Second operand 10 states and 765 transitions.
[2021-06-10 12:31:02,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 131 transitions, 684 flow
[2021-06-10 12:31:02,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 658 flow, removed 9 selfloop flow, removed 5 redundant places.
[2021-06-10 12:31:02,775 INFO L241 Difference]: Finished difference. Result has 142 places, 122 transitions, 589 flow
[2021-06-10 12:31:02,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=589, PETRI_PLACES=142, PETRI_TRANSITIONS=122}
[2021-06-10 12:31:02,775 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 41 predicate places.
[2021-06-10 12:31:02,775 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 122 transitions, 589 flow
[2021-06-10 12:31:02,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,776 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:02,776 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:02,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-10 12:31:02,776 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1247585969, now seen corresponding path program 3 times
[2021-06-10 12:31:02,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:02,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593241022]
[2021-06-10 12:31:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-10 12:31:02,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:02,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:02,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-06-10 12:31:02,834 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size
[2021-06-10 12:31:02,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-06-10 12:31:02,843 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size
[2021-06-10 12:31:02,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19
[2021-06-10 12:31:02,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:02,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-06-10 12:31:02,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-06-10 12:31:02,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-06-10 12:31:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-10 12:31:02,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593241022]
[2021-06-10 12:31:02,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-10 12:31:02,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-10 12:31:02,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685384105]
[2021-06-10 12:31:02,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-10 12:31:02,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-10 12:31:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-10 12:31:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-06-10 12:31:02,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 96
[2021-06-10 12:31:02,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 122 transitions, 589 flow. Second operand has 8 states, 8 states have (on average 78.875) internal successors, (631), 8 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:02,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-06-10 12:31:02,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 96
[2021-06-10 12:31:02,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-06-10 12:31:03,105 INFO L129 PetriNetUnfolder]: 280/1172 cut-off events.
[2021-06-10 12:31:03,105 INFO L130 PetriNetUnfolder]: For 1559/1574 co-relation queries the response was YES.
[2021-06-10 12:31:03,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 1172 events. 280/1172 cut-off events. For 1559/1574 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 11302 event pairs, 0 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 3261. Up to 168 conditions per place.
[2021-06-10 12:31:03,110 INFO L132 encePairwiseOnDemand]: 87/96 looper letters, 12 selfloop transitions, 3 changer transitions 43/127 dead transitions.
[2021-06-10 12:31:03,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 127 transitions, 667 flow
[2021-06-10 12:31:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-10 12:31:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-06-10 12:31:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 720 transitions.
[2021-06-10 12:31:03,116 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2021-06-10 12:31:03,116 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 720 transitions.
[2021-06-10 12:31:03,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 720 transitions.
[2021-06-10 12:31:03,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-06-10 12:31:03,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 720 transitions.
[2021-06-10 12:31:03,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:03,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:03,120 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:03,120 INFO L185 Difference]: Start difference. First operand has 142 places, 122 transitions, 589 flow. Second operand 9 states and 720 transitions.
[2021-06-10 12:31:03,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 127 transitions, 667 flow
[2021-06-10 12:31:03,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 127 transitions, 638 flow, removed 9 selfloop flow, removed 8 redundant places.
[2021-06-10 12:31:03,139 INFO L241 Difference]: Finished difference. Result has 142 places, 84 transitions, 295 flow
[2021-06-10 12:31:03,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=295, PETRI_PLACES=142, PETRI_TRANSITIONS=84}
[2021-06-10 12:31:03,140 INFO L343 CegarLoopForPetriNet]: 101 programPoint places, 41 predicate places.
[2021-06-10 12:31:03,140 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 84 transitions, 295 flow
[2021-06-10 12:31:03,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 78.875) internal successors, (631), 8 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-10 12:31:03,140 INFO L255 CegarLoopForPetriNet]: Found error trace
[2021-06-10 12:31:03,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-10 12:31:03,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-10 12:31:03,141 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-10 12:31:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-10 12:31:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -179555065, now seen corresponding path program 4 times
[2021-06-10 12:31:03,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-10 12:31:03,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620005091]
[2021-06-10 12:31:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-10 12:31:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 12:31:03,180 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 12:31:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-10 12:31:03,214 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-10 12:31:03,259 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-10 12:31:03,259 INFO L634 BasicCegarLoop]: Counterexample might be feasible
[2021-06-10 12:31:03,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-10 12:31:03,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:31:03 BasicIcfg
[2021-06-10 12:31:03,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-10 12:31:03,408 INFO L168 Benchmark]: Toolchain (without parser) took 7101.05 ms. Allocated memory was 377.5 MB in the beginning and 474.0 MB in the end (delta: 96.5 MB). Free memory was 340.0 MB in the beginning and 381.3 MB in the end (delta: -41.3 MB). Peak memory consumption was 55.7 MB. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,408 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 377.5 MB. Free memory is still 358.4 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.64 ms. Allocated memory is still 377.5 MB. Free memory was 339.9 MB in the beginning and 336.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.48 ms. Allocated memory is still 377.5 MB. Free memory was 336.1 MB in the beginning and 334.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,409 INFO L168 Benchmark]: Boogie Preprocessor took 30.06 ms. Allocated memory is still 377.5 MB. Free memory was 334.0 MB in the beginning and 331.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,409 INFO L168 Benchmark]: RCFGBuilder took 1594.61 ms. Allocated memory is still 377.5 MB. Free memory was 331.9 MB in the beginning and 317.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,410 INFO L168 Benchmark]: TraceAbstraction took 4872.32 ms. Allocated memory was 377.5 MB in the beginning and 474.0 MB in the end (delta: 96.5 MB). Free memory was 317.0 MB in the beginning and 381.3 MB in the end (delta: -64.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.0 GB.
[2021-06-10 12:31:03,411 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.13 ms. Allocated memory is still 377.5 MB. Free memory is still 358.4 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 552.64 ms. Allocated memory is still 377.5 MB. Free memory was 339.9 MB in the beginning and 336.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 41.48 ms. Allocated memory is still 377.5 MB. Free memory was 336.1 MB in the beginning and 334.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 30.06 ms. Allocated memory is still 377.5 MB. Free memory was 334.0 MB in the beginning and 331.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 1594.61 ms. Allocated memory is still 377.5 MB. Free memory was 331.9 MB in the beginning and 317.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 143.9 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 4872.32 ms. Allocated memory was 377.5 MB in the beginning and 474.0 MB in the end (delta: 96.5 MB). Free memory was 317.0 MB in the beginning and 381.3 MB in the end (delta: -64.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L711] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L713] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L714] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0]
[L715] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L717] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L719] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L720] 0 _Bool y$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L721] 0 int y$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L722] 0 _Bool y$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L723] 0 _Bool y$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L724] 0 _Bool y$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L725] 0 _Bool y$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L726] 0 _Bool y$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L727] 0 _Bool y$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L728] 0 _Bool y$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L729] 0 _Bool y$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L730] 0 _Bool y$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L731] 0 int *y$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L732] 0 int y$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L733] 0 _Bool y$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L734] 0 int y$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L735] 0 _Bool y$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L737] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L738] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L739] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L827] 0 pthread_t t2577;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L829] 0 pthread_t t2578;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L831] 0 pthread_t t2579;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L790] 3 y$w_buff1 = y$w_buff0
[L791] 3 y$w_buff0 = 1
[L792] 3 y$w_buff1_used = y$w_buff0_used
[L793] 3 y$w_buff0_used = (_Bool)1
[L18] COND FALSE 3 !(!expression)
[L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L799] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L802] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L743] 1 z = 2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L748] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L760] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L765] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L766] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L767] 2 y$flush_delayed = weak$$choice2
[L768] 2 y$mem_tmp = y
[L769] 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)
[L769] 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)
[L770] 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))
[L770] EXPR 2 !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)
[L770] 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))
[L770] 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))
[L771] 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))
[L771] EXPR 2 !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)
[L771] 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))
[L771] 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))
[L772] 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))
[L772] EXPR 2 !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)
[L772] 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))
[L772] 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))
[L773] 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))
[L773] EXPR 2 !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)
[L773] 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))
[L773] 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))
[L774] 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))
[L774] EXPR 2 !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)
[L774] 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))
[L774] 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))
[L775] 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))
[L775] EXPR 2 !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)
[L775] 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))
[L775] 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))
[L776] 2 __unbuffered_p1_EAX = y
[L777] EXPR 2 y$flush_delayed ? y$mem_tmp : y
[L777] 2 y = y$flush_delayed ? y$mem_tmp : y
[L778] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L805] 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)
[L805] 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)
[L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L807] 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
[L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L809] 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
[L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L838] 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)
[L838] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L838] 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)
[L838] 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)
[L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L840] 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
[L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L842] 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
[L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0)
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4627.1ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2894.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 52.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 106 SDtfs, 236 SDslu, 362 SDs, 0 SdLazy, 391 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 361.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 948.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=644occurred in iteration=6, InterpolantAutomatonStates: 87, 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: 38.0ms SsaConstructionTime, 381.2ms SatisfiabilityAnalysisTime, 1000.2ms InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1963 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...