/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:54:51,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:54:51,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:54:51,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:54:51,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:54:51,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:54:51,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:54:51,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:54:51,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:54:51,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:54:51,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:54:51,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:54:51,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:54:51,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:54:51,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:54:51,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:54:51,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:54:51,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:54:51,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:54:51,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:54:51,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:54:51,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:54:51,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:54:51,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:54:51,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:54:51,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:54:51,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:54:51,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:54:51,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:54:51,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:54:51,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:54:51,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:54:51,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:54:51,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:54:51,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:54:51,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:54:51,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:54:51,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:54:51,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:54:51,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:54:51,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:54:51,142 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-RepeatedSemanticLbe.epf [2021-03-25 14:54:51,178 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:54:51,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:54:51,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:54:51,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:54:51,180 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:54:51,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:54:51,180 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:54:51,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:54:51,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:54:51,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:54:51,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:54:51,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:54:51,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:54:51,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:54:51,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:54:51,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:54:51,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:54:51,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:54:51,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:54:51,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:54:51,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:54:51,183 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:54:51,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:54:51,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:54:51,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:54:51,499 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:54:51,500 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:54:51,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2021-03-25 14:54:51,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855f922bc/60302100bb934c0987cd583cd1e1e9d3/FLAG08e0d0bb6 [2021-03-25 14:54:52,115 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:54:52,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2021-03-25 14:54:52,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855f922bc/60302100bb934c0987cd583cd1e1e9d3/FLAG08e0d0bb6 [2021-03-25 14:54:52,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855f922bc/60302100bb934c0987cd583cd1e1e9d3 [2021-03-25 14:54:52,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:54:52,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:54:52,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:54:52,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:54:52,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:54:52,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f652201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52, skipping insertion in model container [2021-03-25 14:54:52,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:54:52,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:54:52,625 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/safe016_rmo.oepc.i[993,1006] [2021-03-25 14:54:52,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:54:52,756 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:54:52,766 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/safe016_rmo.oepc.i[993,1006] [2021-03-25 14:54:52,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:54:52,870 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:54:52,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52 WrapperNode [2021-03-25 14:54:52,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:54:52,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:54:52,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:54:52,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:54:52,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:54:52,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:54:52,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:54:52,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:54:52,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... [2021-03-25 14:54:52,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:54:52,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:54:52,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:54:52,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:54:52,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:54:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 14:54:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:54:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:54:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:54:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:54:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:54:53,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:54:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:54:53,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:54:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:54:53,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:54:53,037 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:54:53,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:54:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:54:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:54:53,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:54:53,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:54:53,039 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:54:55,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:54:55,381 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 14:54:55,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:54:55 BoogieIcfgContainer [2021-03-25 14:54:55,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:54:55,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:54:55,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:54:55,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:54:55,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:54:52" (1/3) ... [2021-03-25 14:54:55,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac830d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:54:55, skipping insertion in model container [2021-03-25 14:54:55,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:54:52" (2/3) ... [2021-03-25 14:54:55,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac830d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:54:55, skipping insertion in model container [2021-03-25 14:54:55,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:54:55" (3/3) ... [2021-03-25 14:54:55,391 INFO L111 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2021-03-25 14:54:55,397 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:54:55,401 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 14:54:55,402 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:54:55,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,482 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,482 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,482 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,487 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,488 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,510 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,511 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:54:55,515 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:54:55,532 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:54:55,562 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:54:55,562 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:54:55,563 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:54:55,563 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:54:55,563 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:54:55,563 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:54:55,563 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:54:55,563 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:54:55,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2021-03-25 14:54:55,619 INFO L129 PetriNetUnfolder]: 2/124 cut-off events. [2021-03-25 14:54:55,619 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:54:55,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-03-25 14:54:55,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2021-03-25 14:54:55,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 110 transitions, 232 flow [2021-03-25 14:54:55,629 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:54:55,639 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-25 14:54:55,642 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 110 transitions, 232 flow [2021-03-25 14:54:55,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 110 transitions, 232 flow [2021-03-25 14:54:55,671 INFO L129 PetriNetUnfolder]: 1/110 cut-off events. [2021-03-25 14:54:55,671 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:54:55,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-03-25 14:54:55,675 INFO L142 LiptonReduction]: Number of co-enabled transitions 1430 [2021-03-25 14:54:56,692 WARN L205 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-25 14:54:57,025 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-25 14:54:58,499 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-03-25 14:54:59,091 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-03-25 14:55:04,179 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 14:55:04,674 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2021-03-25 14:55:04,810 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-03-25 14:55:06,796 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 298 DAG size of output: 258 [2021-03-25 14:55:07,413 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:55:09,594 WARN L205 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 394 DAG size of output: 350 [2021-03-25 14:55:10,500 WARN L205 SmtUtils]: Spent 903.00 ms on a formula simplification that was a NOOP. DAG size: 347 [2021-03-25 14:55:11,458 INFO L154 LiptonReduction]: Checked pairs total: 1880 [2021-03-25 14:55:11,459 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 14:55:11,460 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15832 [2021-03-25 14:55:11,475 INFO L129 PetriNetUnfolder]: 1/44 cut-off events. [2021-03-25 14:55:11,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:55:11,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:11,476 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:11,476 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1139838379, now seen corresponding path program 1 times [2021-03-25 14:55:11,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:11,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169302867] [2021-03-25 14:55:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:11,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:11,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:11,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:11,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:11,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:11,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 14:55:11,947 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:11,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:11,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169302867] [2021-03-25 14:55:11,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:11,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:55:11,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760336318] [2021-03-25 14:55:11,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:55:11,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:11,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:55:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:55:11,977 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-25 14:55:11,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:11,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:11,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-25 14:55:11,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:12,138 INFO L129 PetriNetUnfolder]: 19/106 cut-off events. [2021-03-25 14:55:12,138 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:55:12,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 106 events. 19/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 318 event pairs, 0 based on Foata normal form. 16/112 useless extension candidates. Maximal degree in co-relation 138. Up to 16 conditions per place. [2021-03-25 14:55:12,141 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 6 selfloop transitions, 5 changer transitions 11/58 dead transitions. [2021-03-25 14:55:12,142 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 172 flow [2021-03-25 14:55:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:55:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:55:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1246 transitions. [2021-03-25 14:55:12,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9081632653061225 [2021-03-25 14:55:12,162 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1246 transitions. [2021-03-25 14:55:12,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1246 transitions. [2021-03-25 14:55:12,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:12,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1246 transitions. [2021-03-25 14:55:12,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:12,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:12,190 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:12,191 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 7 states and 1246 transitions. [2021-03-25 14:55:12,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 172 flow [2021-03-25 14:55:12,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:55:12,197 INFO L241 Difference]: Finished difference. Result has 63 places, 45 transitions, 134 flow [2021-03-25 14:55:12,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2021-03-25 14:55:12,200 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2021-03-25 14:55:12,200 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:12,200 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 45 transitions, 134 flow [2021-03-25 14:55:12,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 45 transitions, 134 flow [2021-03-25 14:55:12,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 45 transitions, 134 flow [2021-03-25 14:55:12,222 INFO L129 PetriNetUnfolder]: 5/60 cut-off events. [2021-03-25 14:55:12,222 INFO L130 PetriNetUnfolder]: For 21/27 co-relation queries the response was YES. [2021-03-25 14:55:12,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 60 events. 5/60 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 2 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 87. Up to 12 conditions per place. [2021-03-25 14:55:12,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 320 [2021-03-25 14:55:13,335 INFO L154 LiptonReduction]: Checked pairs total: 717 [2021-03-25 14:55:13,335 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 14:55:13,335 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1135 [2021-03-25 14:55:13,336 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 108 flow [2021-03-25 14:55:13,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:13,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:13,337 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] [2021-03-25 14:55:13,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:55:13,337 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1727754415, now seen corresponding path program 1 times [2021-03-25 14:55:13,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:13,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311342457] [2021-03-25 14:55:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:13,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:13,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:13,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:13,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:13,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:13,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:55:13,458 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:13,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:13,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311342457] [2021-03-25 14:55:13,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:13,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:55:13,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664364564] [2021-03-25 14:55:13,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:55:13,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:55:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:55:13,467 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 209 [2021-03-25 14:55:13,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:13,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:13,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 209 [2021-03-25 14:55:13,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:13,513 INFO L129 PetriNetUnfolder]: 5/50 cut-off events. [2021-03-25 14:55:13,513 INFO L130 PetriNetUnfolder]: For 58/68 co-relation queries the response was YES. [2021-03-25 14:55:13,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 50 events. 5/50 cut-off events. For 58/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 112 event pairs, 2 based on Foata normal form. 3/49 useless extension candidates. Maximal degree in co-relation 97. Up to 14 conditions per place. [2021-03-25 14:55:13,514 INFO L132 encePairwiseOnDemand]: 204/209 looper letters, 2 selfloop transitions, 3 changer transitions 2/34 dead transitions. [2021-03-25 14:55:13,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 34 transitions, 130 flow [2021-03-25 14:55:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:55:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:55:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1143 transitions. [2021-03-25 14:55:13,518 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9114832535885168 [2021-03-25 14:55:13,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1143 transitions. [2021-03-25 14:55:13,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1143 transitions. [2021-03-25 14:55:13,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:13,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1143 transitions. [2021-03-25 14:55:13,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 190.5) internal successors, (1143), 6 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:13,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:13,525 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:13,525 INFO L185 Difference]: Start difference. First operand has 47 places, 32 transitions, 108 flow. Second operand 6 states and 1143 transitions. [2021-03-25 14:55:13,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 34 transitions, 130 flow [2021-03-25 14:55:13,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 34 transitions, 124 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:55:13,527 INFO L241 Difference]: Finished difference. Result has 52 places, 32 transitions, 116 flow [2021-03-25 14:55:13,528 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2021-03-25 14:55:13,528 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2021-03-25 14:55:13,528 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:13,528 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 32 transitions, 116 flow [2021-03-25 14:55:13,529 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 32 transitions, 116 flow [2021-03-25 14:55:13,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 32 transitions, 116 flow [2021-03-25 14:55:13,536 INFO L129 PetriNetUnfolder]: 5/47 cut-off events. [2021-03-25 14:55:13,537 INFO L130 PetriNetUnfolder]: For 29/35 co-relation queries the response was YES. [2021-03-25 14:55:13,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 47 events. 5/47 cut-off events. For 29/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 2 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 84. Up to 12 conditions per place. [2021-03-25 14:55:13,538 INFO L142 LiptonReduction]: Number of co-enabled transitions 316 [2021-03-25 14:55:14,130 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 14:55:14,237 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 14:55:14,343 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 14:55:14,449 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-03-25 14:55:14,807 INFO L154 LiptonReduction]: Checked pairs total: 669 [2021-03-25 14:55:14,807 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:55:14,807 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1279 [2021-03-25 14:55:14,808 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 106 flow [2021-03-25 14:55:14,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:14,809 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:14,809 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] [2021-03-25 14:55:14,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:55:14,810 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash -619896936, now seen corresponding path program 1 times [2021-03-25 14:55:14,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:14,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255177136] [2021-03-25 14:55:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:14,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:14,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:14,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:14,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:14,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:14,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:14,900 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:14,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:14,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255177136] [2021-03-25 14:55:14,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:14,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:55:14,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248813696] [2021-03-25 14:55:14,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:55:14,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:55:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:55:14,908 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 213 [2021-03-25 14:55:14,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 185.2) internal successors, (926), 5 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:14,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:14,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 213 [2021-03-25 14:55:14,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:14,986 INFO L129 PetriNetUnfolder]: 2/58 cut-off events. [2021-03-25 14:55:14,987 INFO L130 PetriNetUnfolder]: For 82/186 co-relation queries the response was YES. [2021-03-25 14:55:14,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 58 events. 2/58 cut-off events. For 82/186 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 233 event pairs, 0 based on Foata normal form. 4/59 useless extension candidates. Maximal degree in co-relation 134. Up to 16 conditions per place. [2021-03-25 14:55:14,988 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 7 selfloop transitions, 3 changer transitions 7/35 dead transitions. [2021-03-25 14:55:14,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 35 transitions, 186 flow [2021-03-25 14:55:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:55:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:55:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1490 transitions. [2021-03-25 14:55:14,992 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8744131455399061 [2021-03-25 14:55:14,992 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1490 transitions. [2021-03-25 14:55:14,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1490 transitions. [2021-03-25 14:55:14,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:14,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1490 transitions. [2021-03-25 14:55:14,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 186.25) internal successors, (1490), 8 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:15,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:15,001 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:15,001 INFO L185 Difference]: Start difference. First operand has 45 places, 28 transitions, 106 flow. Second operand 8 states and 1490 transitions. [2021-03-25 14:55:15,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 35 transitions, 186 flow [2021-03-25 14:55:15,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 168 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-03-25 14:55:15,003 INFO L241 Difference]: Finished difference. Result has 54 places, 27 transitions, 117 flow [2021-03-25 14:55:15,003 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=27} [2021-03-25 14:55:15,004 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2021-03-25 14:55:15,004 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:15,004 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 27 transitions, 117 flow [2021-03-25 14:55:15,004 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 27 transitions, 117 flow [2021-03-25 14:55:15,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 27 transitions, 117 flow [2021-03-25 14:55:15,011 INFO L129 PetriNetUnfolder]: 1/42 cut-off events. [2021-03-25 14:55:15,011 INFO L130 PetriNetUnfolder]: For 112/139 co-relation queries the response was YES. [2021-03-25 14:55:15,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 42 events. 1/42 cut-off events. For 112/139 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 105 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 94. Up to 10 conditions per place. [2021-03-25 14:55:15,014 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-25 14:55:15,674 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2021-03-25 14:55:16,009 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-25 14:55:16,672 WARN L205 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 165 [2021-03-25 14:55:16,989 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2021-03-25 14:55:16,992 INFO L154 LiptonReduction]: Checked pairs total: 478 [2021-03-25 14:55:16,992 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:55:16,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1988 [2021-03-25 14:55:16,993 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 26 transitions, 113 flow [2021-03-25 14:55:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 185.2) internal successors, (926), 5 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:16,994 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:16,994 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:16,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:55:16,994 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1282117518, now seen corresponding path program 1 times [2021-03-25 14:55:16,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:16,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178996817] [2021-03-25 14:55:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:17,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:17,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 14:55:17,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:55:17,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:55:17,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:55:17,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:55:17,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:55:17,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:17,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:55:17,313 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:17,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:17,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178996817] [2021-03-25 14:55:17,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:17,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:55:17,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008493083] [2021-03-25 14:55:17,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:55:17,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:55:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:55:17,323 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 214 [2021-03-25 14:55:17,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 26 transitions, 113 flow. Second operand has 8 states, 8 states have (on average 133.375) internal successors, (1067), 8 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:17,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:17,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 214 [2021-03-25 14:55:17,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:17,635 INFO L129 PetriNetUnfolder]: 285/609 cut-off events. [2021-03-25 14:55:17,636 INFO L130 PetriNetUnfolder]: For 1342/1344 co-relation queries the response was YES. [2021-03-25 14:55:17,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 609 events. 285/609 cut-off events. For 1342/1344 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3331 event pairs, 97 based on Foata normal form. 28/629 useless extension candidates. Maximal degree in co-relation 1644. Up to 379 conditions per place. [2021-03-25 14:55:17,642 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 25 selfloop transitions, 6 changer transitions 13/53 dead transitions. [2021-03-25 14:55:17,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 310 flow [2021-03-25 14:55:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:55:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:55:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2021-03-25 14:55:17,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6461949265687583 [2021-03-25 14:55:17,646 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2021-03-25 14:55:17,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2021-03-25 14:55:17,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:17,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2021-03-25 14:55:17,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:17,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:17,652 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:17,652 INFO L185 Difference]: Start difference. First operand has 47 places, 26 transitions, 113 flow. Second operand 7 states and 968 transitions. [2021-03-25 14:55:17,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 310 flow [2021-03-25 14:55:17,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 282 flow, removed 10 selfloop flow, removed 6 redundant places. [2021-03-25 14:55:17,656 INFO L241 Difference]: Finished difference. Result has 52 places, 31 transitions, 158 flow [2021-03-25 14:55:17,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2021-03-25 14:55:17,657 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2021-03-25 14:55:17,657 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:17,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 31 transitions, 158 flow [2021-03-25 14:55:17,657 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 31 transitions, 158 flow [2021-03-25 14:55:17,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 31 transitions, 158 flow [2021-03-25 14:55:17,669 INFO L129 PetriNetUnfolder]: 14/83 cut-off events. [2021-03-25 14:55:17,669 INFO L130 PetriNetUnfolder]: For 230/254 co-relation queries the response was YES. [2021-03-25 14:55:17,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 83 events. 14/83 cut-off events. For 230/254 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 347 event pairs, 10 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 275. Up to 30 conditions per place. [2021-03-25 14:55:17,670 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-25 14:55:20,890 INFO L154 LiptonReduction]: Checked pairs total: 476 [2021-03-25 14:55:20,890 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:55:20,891 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3234 [2021-03-25 14:55:20,891 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 162 flow [2021-03-25 14:55:20,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 133.375) internal successors, (1067), 8 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:20,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:20,892 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:20,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:55:20,892 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:20,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash 105680585, now seen corresponding path program 1 times [2021-03-25 14:55:20,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:20,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106200235] [2021-03-25 14:55:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:20,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:20,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:55:20,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:20,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:55:20,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:20,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:55:20,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:20,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:55:20,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:20,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:55:20,997 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:20,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:21,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106200235] [2021-03-25 14:55:21,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:21,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:55:21,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057788817] [2021-03-25 14:55:21,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:55:21,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:55:21,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:55:21,005 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 215 [2021-03-25 14:55:21,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:21,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 215 [2021-03-25 14:55:21,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:21,257 INFO L129 PetriNetUnfolder]: 315/662 cut-off events. [2021-03-25 14:55:21,257 INFO L130 PetriNetUnfolder]: For 1541/1548 co-relation queries the response was YES. [2021-03-25 14:55:21,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 662 events. 315/662 cut-off events. For 1541/1548 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3670 event pairs, 66 based on Foata normal form. 22/675 useless extension candidates. Maximal degree in co-relation 2125. Up to 317 conditions per place. [2021-03-25 14:55:21,264 INFO L132 encePairwiseOnDemand]: 202/215 looper letters, 24 selfloop transitions, 15 changer transitions 8/56 dead transitions. [2021-03-25 14:55:21,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 370 flow [2021-03-25 14:55:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:55:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:55:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1129 transitions. [2021-03-25 14:55:21,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7501661129568107 [2021-03-25 14:55:21,268 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1129 transitions. [2021-03-25 14:55:21,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1129 transitions. [2021-03-25 14:55:21,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:21,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1129 transitions. [2021-03-25 14:55:21,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,275 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,275 INFO L185 Difference]: Start difference. First operand has 49 places, 31 transitions, 162 flow. Second operand 7 states and 1129 transitions. [2021-03-25 14:55:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 370 flow [2021-03-25 14:55:21,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 338 flow, removed 16 selfloop flow, removed 3 redundant places. [2021-03-25 14:55:21,282 INFO L241 Difference]: Finished difference. Result has 56 places, 39 transitions, 253 flow [2021-03-25 14:55:21,282 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2021-03-25 14:55:21,282 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2021-03-25 14:55:21,282 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:21,283 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 39 transitions, 253 flow [2021-03-25 14:55:21,283 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 39 transitions, 253 flow [2021-03-25 14:55:21,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 39 transitions, 253 flow [2021-03-25 14:55:21,332 INFO L129 PetriNetUnfolder]: 153/404 cut-off events. [2021-03-25 14:55:21,333 INFO L130 PetriNetUnfolder]: For 883/931 co-relation queries the response was YES. [2021-03-25 14:55:21,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 404 events. 153/404 cut-off events. For 883/931 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2320 event pairs, 60 based on Foata normal form. 7/394 useless extension candidates. Maximal degree in co-relation 1296. Up to 216 conditions per place. [2021-03-25 14:55:21,338 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-25 14:55:21,384 INFO L154 LiptonReduction]: Checked pairs total: 161 [2021-03-25 14:55:21,384 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:21,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-03-25 14:55:21,388 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 253 flow [2021-03-25 14:55:21,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.83333333333334) internal successors, (941), 6 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,389 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:21,389 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:21,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:55:21,389 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash 585851656, now seen corresponding path program 1 times [2021-03-25 14:55:21,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:21,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678911008] [2021-03-25 14:55:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:21,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:21,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:55:21,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:21,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:55:21,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:21,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:55:21,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:21,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:55:21,524 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:21,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:21,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678911008] [2021-03-25 14:55:21,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:21,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:55:21,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454497985] [2021-03-25 14:55:21,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:55:21,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:55:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:55:21,533 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 215 [2021-03-25 14:55:21,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:21,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 215 [2021-03-25 14:55:21,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:21,784 INFO L129 PetriNetUnfolder]: 331/691 cut-off events. [2021-03-25 14:55:21,784 INFO L130 PetriNetUnfolder]: For 1780/1817 co-relation queries the response was YES. [2021-03-25 14:55:21,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 691 events. 331/691 cut-off events. For 1780/1817 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3873 event pairs, 64 based on Foata normal form. 29/711 useless extension candidates. Maximal degree in co-relation 2710. Up to 378 conditions per place. [2021-03-25 14:55:21,791 INFO L132 encePairwiseOnDemand]: 203/215 looper letters, 25 selfloop transitions, 18 changer transitions 13/65 dead transitions. [2021-03-25 14:55:21,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 524 flow [2021-03-25 14:55:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:55:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:55:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1289 transitions. [2021-03-25 14:55:21,796 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7494186046511628 [2021-03-25 14:55:21,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1289 transitions. [2021-03-25 14:55:21,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1289 transitions. [2021-03-25 14:55:21,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:21,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1289 transitions. [2021-03-25 14:55:21,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 161.125) internal successors, (1289), 8 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,802 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,803 INFO L185 Difference]: Start difference. First operand has 54 places, 39 transitions, 253 flow. Second operand 8 states and 1289 transitions. [2021-03-25 14:55:21,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 524 flow [2021-03-25 14:55:21,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 495 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-25 14:55:21,808 INFO L241 Difference]: Finished difference. Result has 61 places, 43 transitions, 324 flow [2021-03-25 14:55:21,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2021-03-25 14:55:21,808 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-25 14:55:21,809 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:21,809 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 43 transitions, 324 flow [2021-03-25 14:55:21,809 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 43 transitions, 324 flow [2021-03-25 14:55:21,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 43 transitions, 324 flow [2021-03-25 14:55:21,866 INFO L129 PetriNetUnfolder]: 198/467 cut-off events. [2021-03-25 14:55:21,866 INFO L130 PetriNetUnfolder]: For 1459/1521 co-relation queries the response was YES. [2021-03-25 14:55:21,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 467 events. 198/467 cut-off events. For 1459/1521 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2635 event pairs, 63 based on Foata normal form. 7/454 useless extension candidates. Maximal degree in co-relation 1864. Up to 268 conditions per place. [2021-03-25 14:55:21,873 INFO L142 LiptonReduction]: Number of co-enabled transitions 338 [2021-03-25 14:55:21,910 INFO L154 LiptonReduction]: Checked pairs total: 229 [2021-03-25 14:55:21,910 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:21,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-03-25 14:55:21,911 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 324 flow [2021-03-25 14:55:21,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:21,912 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:21,912 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:21,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:55:21,912 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 532535764, now seen corresponding path program 2 times [2021-03-25 14:55:21,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:21,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303266786] [2021-03-25 14:55:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:22,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:55:22,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:55:22,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:55:22,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:55:22,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:55:22,069 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:22,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:22,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303266786] [2021-03-25 14:55:22,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:22,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:55:22,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595892253] [2021-03-25 14:55:22,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:55:22,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:55:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:55:22,081 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 215 [2021-03-25 14:55:22,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 324 flow. Second operand has 7 states, 7 states have (on average 156.42857142857142) internal successors, (1095), 7 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:22,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:22,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 215 [2021-03-25 14:55:22,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:22,471 INFO L129 PetriNetUnfolder]: 321/674 cut-off events. [2021-03-25 14:55:22,471 INFO L130 PetriNetUnfolder]: For 2522/2562 co-relation queries the response was YES. [2021-03-25 14:55:22,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 674 events. 321/674 cut-off events. For 2522/2562 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3784 event pairs, 62 based on Foata normal form. 25/690 useless extension candidates. Maximal degree in co-relation 3184. Up to 368 conditions per place. [2021-03-25 14:55:22,478 INFO L132 encePairwiseOnDemand]: 203/215 looper letters, 26 selfloop transitions, 21 changer transitions 12/68 dead transitions. [2021-03-25 14:55:22,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 662 flow [2021-03-25 14:55:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:55:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:55:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1448 transitions. [2021-03-25 14:55:22,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7483204134366925 [2021-03-25 14:55:22,484 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1448 transitions. [2021-03-25 14:55:22,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1448 transitions. [2021-03-25 14:55:22,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:22,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1448 transitions. [2021-03-25 14:55:22,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.88888888888889) internal successors, (1448), 9 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:22,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:22,492 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:22,492 INFO L185 Difference]: Start difference. First operand has 58 places, 43 transitions, 324 flow. Second operand 9 states and 1448 transitions. [2021-03-25 14:55:22,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 662 flow [2021-03-25 14:55:22,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 619 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-03-25 14:55:22,502 INFO L241 Difference]: Finished difference. Result has 65 places, 46 transitions, 384 flow [2021-03-25 14:55:22,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2021-03-25 14:55:22,502 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2021-03-25 14:55:22,502 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:22,502 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 46 transitions, 384 flow [2021-03-25 14:55:22,503 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 46 transitions, 384 flow [2021-03-25 14:55:22,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 384 flow [2021-03-25 14:55:22,565 INFO L129 PetriNetUnfolder]: 204/458 cut-off events. [2021-03-25 14:55:22,565 INFO L130 PetriNetUnfolder]: For 2034/2088 co-relation queries the response was YES. [2021-03-25 14:55:22,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 458 events. 204/458 cut-off events. For 2034/2088 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2529 event pairs, 65 based on Foata normal form. 6/448 useless extension candidates. Maximal degree in co-relation 2136. Up to 267 conditions per place. [2021-03-25 14:55:22,574 INFO L142 LiptonReduction]: Number of co-enabled transitions 358 [2021-03-25 14:55:22,621 INFO L154 LiptonReduction]: Checked pairs total: 285 [2021-03-25 14:55:22,621 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:22,621 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 119 [2021-03-25 14:55:22,622 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 384 flow [2021-03-25 14:55:22,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 156.42857142857142) internal successors, (1095), 7 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:22,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:22,623 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:22,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:55:22,623 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -804013160, now seen corresponding path program 3 times [2021-03-25 14:55:22,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:22,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963512105] [2021-03-25 14:55:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:22,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:55:22,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:55:22,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:55:22,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:55:22,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:22,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:55:22,783 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:22,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:22,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963512105] [2021-03-25 14:55:22,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:22,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:55:22,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981775907] [2021-03-25 14:55:22,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:55:22,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:55:22,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:55:22,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 215 [2021-03-25 14:55:22,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 150.42857142857142) internal successors, (1053), 7 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:22,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:22,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 215 [2021-03-25 14:55:22,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:23,108 INFO L129 PetriNetUnfolder]: 335/688 cut-off events. [2021-03-25 14:55:23,108 INFO L130 PetriNetUnfolder]: For 3320/3362 co-relation queries the response was YES. [2021-03-25 14:55:23,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 688 events. 335/688 cut-off events. For 3320/3362 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3831 event pairs, 63 based on Foata normal form. 21/699 useless extension candidates. Maximal degree in co-relation 3573. Up to 378 conditions per place. [2021-03-25 14:55:23,116 INFO L132 encePairwiseOnDemand]: 204/215 looper letters, 31 selfloop transitions, 20 changer transitions 13/73 dead transitions. [2021-03-25 14:55:23,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 793 flow [2021-03-25 14:55:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:55:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:55:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1241 transitions. [2021-03-25 14:55:23,120 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7215116279069768 [2021-03-25 14:55:23,121 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1241 transitions. [2021-03-25 14:55:23,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1241 transitions. [2021-03-25 14:55:23,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:23,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1241 transitions. [2021-03-25 14:55:23,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,127 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,128 INFO L185 Difference]: Start difference. First operand has 62 places, 46 transitions, 384 flow. Second operand 8 states and 1241 transitions. [2021-03-25 14:55:23,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 793 flow [2021-03-25 14:55:23,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 697 flow, removed 27 selfloop flow, removed 7 redundant places. [2021-03-25 14:55:23,138 INFO L241 Difference]: Finished difference. Result has 66 places, 50 transitions, 436 flow [2021-03-25 14:55:23,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=436, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2021-03-25 14:55:23,139 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-25 14:55:23,139 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:23,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 50 transitions, 436 flow [2021-03-25 14:55:23,139 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 50 transitions, 436 flow [2021-03-25 14:55:23,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 436 flow [2021-03-25 14:55:23,200 INFO L129 PetriNetUnfolder]: 194/460 cut-off events. [2021-03-25 14:55:23,200 INFO L130 PetriNetUnfolder]: For 2342/2403 co-relation queries the response was YES. [2021-03-25 14:55:23,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 460 events. 194/460 cut-off events. For 2342/2403 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2625 event pairs, 72 based on Foata normal form. 5/448 useless extension candidates. Maximal degree in co-relation 2281. Up to 271 conditions per place. [2021-03-25 14:55:23,207 INFO L142 LiptonReduction]: Number of co-enabled transitions 376 [2021-03-25 14:55:23,225 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-25 14:55:23,225 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:23,225 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 86 [2021-03-25 14:55:23,226 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 436 flow [2021-03-25 14:55:23,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 150.42857142857142) internal successors, (1053), 7 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,226 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:23,226 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:23,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:55:23,227 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1692927384, now seen corresponding path program 4 times [2021-03-25 14:55:23,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:23,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065968694] [2021-03-25 14:55:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:23,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:23,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:55:23,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:23,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:55:23,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:23,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:55:23,367 INFO L142 QuantifierPusher]: treesize reduction 7, result has 82.9 percent of original size [2021-03-25 14:55:23,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 14:55:23,396 INFO L142 QuantifierPusher]: treesize reduction 7, result has 81.6 percent of original size [2021-03-25 14:55:23,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:55:23,418 INFO L142 QuantifierPusher]: treesize reduction 7, result has 78.1 percent of original size [2021-03-25 14:55:23,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:55:23,441 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:23,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:23,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065968694] [2021-03-25 14:55:23,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:23,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:55:23,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079763266] [2021-03-25 14:55:23,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:55:23,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:23,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:55:23,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:55:23,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 215 [2021-03-25 14:55:23,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 436 flow. Second operand has 9 states, 9 states have (on average 146.11111111111111) internal successors, (1315), 9 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:23,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 215 [2021-03-25 14:55:23,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:23,892 INFO L129 PetriNetUnfolder]: 314/662 cut-off events. [2021-03-25 14:55:23,893 INFO L130 PetriNetUnfolder]: For 3542/3582 co-relation queries the response was YES. [2021-03-25 14:55:23,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 662 events. 314/662 cut-off events. For 3542/3582 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3699 event pairs, 63 based on Foata normal form. 19/672 useless extension candidates. Maximal degree in co-relation 3622. Up to 364 conditions per place. [2021-03-25 14:55:23,901 INFO L132 encePairwiseOnDemand]: 204/215 looper letters, 30 selfloop transitions, 24 changer transitions 12/75 dead transitions. [2021-03-25 14:55:23,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 869 flow [2021-03-25 14:55:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:55:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:55:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1358 transitions. [2021-03-25 14:55:23,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7018087855297158 [2021-03-25 14:55:23,906 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1358 transitions. [2021-03-25 14:55:23,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1358 transitions. [2021-03-25 14:55:23,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:23,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1358 transitions. [2021-03-25 14:55:23,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.88888888888889) internal successors, (1358), 9 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,915 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:23,915 INFO L185 Difference]: Start difference. First operand has 63 places, 50 transitions, 436 flow. Second operand 9 states and 1358 transitions. [2021-03-25 14:55:23,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 869 flow [2021-03-25 14:55:23,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 802 flow, removed 28 selfloop flow, removed 5 redundant places. [2021-03-25 14:55:23,923 INFO L241 Difference]: Finished difference. Result has 70 places, 52 transitions, 506 flow [2021-03-25 14:55:23,924 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2021-03-25 14:55:23,924 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2021-03-25 14:55:23,924 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:23,924 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 52 transitions, 506 flow [2021-03-25 14:55:23,924 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 52 transitions, 506 flow [2021-03-25 14:55:23,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 52 transitions, 506 flow [2021-03-25 14:55:23,996 INFO L129 PetriNetUnfolder]: 196/457 cut-off events. [2021-03-25 14:55:23,996 INFO L130 PetriNetUnfolder]: For 2834/2886 co-relation queries the response was YES. [2021-03-25 14:55:23,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 457 events. 196/457 cut-off events. For 2834/2886 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2606 event pairs, 80 based on Foata normal form. 6/445 useless extension candidates. Maximal degree in co-relation 2379. Up to 271 conditions per place. [2021-03-25 14:55:24,004 INFO L142 LiptonReduction]: Number of co-enabled transitions 386 [2021-03-25 14:55:24,022 INFO L154 LiptonReduction]: Checked pairs total: 313 [2021-03-25 14:55:24,022 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:24,023 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 99 [2021-03-25 14:55:24,023 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 506 flow [2021-03-25 14:55:24,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 146.11111111111111) internal successors, (1315), 9 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,024 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:24,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:24,024 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:55:24,024 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 107111514, now seen corresponding path program 1 times [2021-03-25 14:55:24,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:24,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588242497] [2021-03-25 14:55:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:24,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:24,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:55:24,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:24,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:55:24,136 INFO L142 QuantifierPusher]: treesize reduction 15, result has 57.1 percent of original size [2021-03-25 14:55:24,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:55:24,143 INFO L142 QuantifierPusher]: treesize reduction 15, result has 60.5 percent of original size [2021-03-25 14:55:24,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:55:24,165 INFO L142 QuantifierPusher]: treesize reduction 15, result has 66.7 percent of original size [2021-03-25 14:55:24,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:55:24,194 INFO L142 QuantifierPusher]: treesize reduction 26, result has 63.9 percent of original size [2021-03-25 14:55:24,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 14:55:24,223 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:24,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:24,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588242497] [2021-03-25 14:55:24,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:24,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:55:24,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583148600] [2021-03-25 14:55:24,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:55:24,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:24,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:55:24,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:55:24,232 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 215 [2021-03-25 14:55:24,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 506 flow. Second operand has 8 states, 8 states have (on average 149.375) internal successors, (1195), 8 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:24,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 215 [2021-03-25 14:55:24,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:24,694 INFO L129 PetriNetUnfolder]: 344/765 cut-off events. [2021-03-25 14:55:24,694 INFO L130 PetriNetUnfolder]: For 4815/4855 co-relation queries the response was YES. [2021-03-25 14:55:24,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 765 events. 344/765 cut-off events. For 4815/4855 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4654 event pairs, 58 based on Foata normal form. 23/779 useless extension candidates. Maximal degree in co-relation 4340. Up to 419 conditions per place. [2021-03-25 14:55:24,703 INFO L132 encePairwiseOnDemand]: 203/215 looper letters, 38 selfloop transitions, 23 changer transitions 13/83 dead transitions. [2021-03-25 14:55:24,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 1026 flow [2021-03-25 14:55:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:55:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:55:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1387 transitions. [2021-03-25 14:55:24,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.716795865633075 [2021-03-25 14:55:24,709 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1387 transitions. [2021-03-25 14:55:24,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1387 transitions. [2021-03-25 14:55:24,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:24,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1387 transitions. [2021-03-25 14:55:24,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 154.11111111111111) internal successors, (1387), 9 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,732 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,732 INFO L185 Difference]: Start difference. First operand has 67 places, 52 transitions, 506 flow. Second operand 9 states and 1387 transitions. [2021-03-25 14:55:24,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 1026 flow [2021-03-25 14:55:24,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 895 flow, removed 29 selfloop flow, removed 8 redundant places. [2021-03-25 14:55:24,744 INFO L241 Difference]: Finished difference. Result has 72 places, 56 transitions, 550 flow [2021-03-25 14:55:24,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=550, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2021-03-25 14:55:24,745 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2021-03-25 14:55:24,745 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:24,745 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 56 transitions, 550 flow [2021-03-25 14:55:24,745 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 56 transitions, 550 flow [2021-03-25 14:55:24,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 56 transitions, 550 flow [2021-03-25 14:55:24,815 INFO L129 PetriNetUnfolder]: 202/519 cut-off events. [2021-03-25 14:55:24,815 INFO L130 PetriNetUnfolder]: For 3069/3201 co-relation queries the response was YES. [2021-03-25 14:55:24,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 519 events. 202/519 cut-off events. For 3069/3201 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3253 event pairs, 71 based on Foata normal form. 8/505 useless extension candidates. Maximal degree in co-relation 2667. Up to 298 conditions per place. [2021-03-25 14:55:24,824 INFO L142 LiptonReduction]: Number of co-enabled transitions 416 [2021-03-25 14:55:24,854 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-25 14:55:24,855 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:24,855 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 110 [2021-03-25 14:55:24,857 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 550 flow [2021-03-25 14:55:24,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 149.375) internal successors, (1195), 8 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:24,859 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:24,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:55:24,859 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 105704610, now seen corresponding path program 1 times [2021-03-25 14:55:24,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:24,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969101424] [2021-03-25 14:55:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:24,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:24,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:24,938 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:55:24,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:55:24,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:24,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:24,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969101424] [2021-03-25 14:55:24,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:24,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:55:24,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767074292] [2021-03-25 14:55:24,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:55:24,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:24,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:55:24,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:55:24,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-25 14:55:24,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:24,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:24,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-25 14:55:24,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:25,331 INFO L129 PetriNetUnfolder]: 1156/2161 cut-off events. [2021-03-25 14:55:25,331 INFO L130 PetriNetUnfolder]: For 10501/11784 co-relation queries the response was YES. [2021-03-25 14:55:25,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8875 conditions, 2161 events. 1156/2161 cut-off events. For 10501/11784 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 15568 event pairs, 555 based on Foata normal form. 335/2256 useless extension candidates. Maximal degree in co-relation 8844. Up to 1104 conditions per place. [2021-03-25 14:55:25,359 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2021-03-25 14:55:25,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 620 flow [2021-03-25 14:55:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:55:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:55:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2021-03-25 14:55:25,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762790697674419 [2021-03-25 14:55:25,362 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 942 transitions. [2021-03-25 14:55:25,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 942 transitions. [2021-03-25 14:55:25,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:25,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 942 transitions. [2021-03-25 14:55:25,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:25,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:25,367 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:25,367 INFO L185 Difference]: Start difference. First operand has 69 places, 56 transitions, 550 flow. Second operand 5 states and 942 transitions. [2021-03-25 14:55:25,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 620 flow [2021-03-25 14:55:25,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 597 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-25 14:55:25,392 INFO L241 Difference]: Finished difference. Result has 71 places, 65 transitions, 610 flow [2021-03-25 14:55:25,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2021-03-25 14:55:25,392 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2021-03-25 14:55:25,392 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:25,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 65 transitions, 610 flow [2021-03-25 14:55:25,393 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 65 transitions, 610 flow [2021-03-25 14:55:25,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 65 transitions, 610 flow [2021-03-25 14:55:25,634 INFO L129 PetriNetUnfolder]: 1169/2161 cut-off events. [2021-03-25 14:55:25,635 INFO L130 PetriNetUnfolder]: For 8937/9699 co-relation queries the response was YES. [2021-03-25 14:55:25,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 2161 events. 1169/2161 cut-off events. For 8937/9699 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 15324 event pairs, 496 based on Foata normal form. 44/1963 useless extension candidates. Maximal degree in co-relation 9255. Up to 1271 conditions per place. [2021-03-25 14:55:25,674 INFO L142 LiptonReduction]: Number of co-enabled transitions 690 [2021-03-25 14:55:25,736 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:55:25,737 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:55:25,737 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 345 [2021-03-25 14:55:25,737 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 610 flow [2021-03-25 14:55:25,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:25,738 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:25,738 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:25,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:55:25,738 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:25,738 INFO L82 PathProgramCache]: Analyzing trace with hash 254476593, now seen corresponding path program 1 times [2021-03-25 14:55:25,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:25,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855136789] [2021-03-25 14:55:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:25,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:25,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:25,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:25,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:25,812 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:55:25,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:55:25,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:25,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:25,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855136789] [2021-03-25 14:55:25,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:25,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:55:25,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677048019] [2021-03-25 14:55:25,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:55:25,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:55:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:55:25,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-25 14:55:25,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 610 flow. Second operand has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:25,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:25,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-25 14:55:25,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:26,090 INFO L129 PetriNetUnfolder]: 718/1512 cut-off events. [2021-03-25 14:55:26,091 INFO L130 PetriNetUnfolder]: For 8295/13499 co-relation queries the response was YES. [2021-03-25 14:55:26,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7173 conditions, 1512 events. 718/1512 cut-off events. For 8295/13499 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 11286 event pairs, 174 based on Foata normal form. 649/2006 useless extension candidates. Maximal degree in co-relation 7142. Up to 925 conditions per place. [2021-03-25 14:55:26,110 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 12 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2021-03-25 14:55:26,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 77 transitions, 734 flow [2021-03-25 14:55:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:55:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:55:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1319 transitions. [2021-03-25 14:55:26,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8764119601328904 [2021-03-25 14:55:26,114 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1319 transitions. [2021-03-25 14:55:26,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1319 transitions. [2021-03-25 14:55:26,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:26,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1319 transitions. [2021-03-25 14:55:26,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 188.42857142857142) internal successors, (1319), 7 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:26,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:26,120 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:26,120 INFO L185 Difference]: Start difference. First operand has 71 places, 65 transitions, 610 flow. Second operand 7 states and 1319 transitions. [2021-03-25 14:55:26,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 77 transitions, 734 flow [2021-03-25 14:55:26,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 77 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:55:26,134 INFO L241 Difference]: Finished difference. Result has 79 places, 73 transitions, 733 flow [2021-03-25 14:55:26,134 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=733, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2021-03-25 14:55:26,134 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2021-03-25 14:55:26,135 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:26,135 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 73 transitions, 733 flow [2021-03-25 14:55:26,135 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 73 transitions, 733 flow [2021-03-25 14:55:26,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 73 transitions, 733 flow [2021-03-25 14:55:26,333 INFO L129 PetriNetUnfolder]: 760/1550 cut-off events. [2021-03-25 14:55:26,333 INFO L130 PetriNetUnfolder]: For 9272/11351 co-relation queries the response was YES. [2021-03-25 14:55:26,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 1550 events. 760/1550 cut-off events. For 9272/11351 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 11284 event pairs, 150 based on Foata normal form. 78/1488 useless extension candidates. Maximal degree in co-relation 8162. Up to 1004 conditions per place. [2021-03-25 14:55:26,357 INFO L142 LiptonReduction]: Number of co-enabled transitions 902 [2021-03-25 14:55:26,390 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-25 14:55:26,390 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:55:26,390 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 255 [2021-03-25 14:55:26,392 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 72 transitions, 717 flow [2021-03-25 14:55:26,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:26,393 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:26,393 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:26,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:55:26,393 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:26,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1037102816, now seen corresponding path program 1 times [2021-03-25 14:55:26,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:26,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008990576] [2021-03-25 14:55:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:26,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:26,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:55:26,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:26,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:55:26,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:26,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:55:26,528 INFO L142 QuantifierPusher]: treesize reduction 37, result has 59.8 percent of original size [2021-03-25 14:55:26,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 14:55:26,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:26,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 14:55:26,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:26,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:55:26,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:26,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 14:55:26,630 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:55:26,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:55:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:26,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008990576] [2021-03-25 14:55:26,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:26,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:55:26,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416938372] [2021-03-25 14:55:26,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:55:26,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:26,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:55:26,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:55:26,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 215 [2021-03-25 14:55:26,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 72 transitions, 717 flow. Second operand has 9 states, 9 states have (on average 153.22222222222223) internal successors, (1379), 9 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:26,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:26,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 215 [2021-03-25 14:55:26,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:27,234 INFO L129 PetriNetUnfolder]: 827/1752 cut-off events. [2021-03-25 14:55:27,235 INFO L130 PetriNetUnfolder]: For 12209/15147 co-relation queries the response was YES. [2021-03-25 14:55:27,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 1752 events. 827/1752 cut-off events. For 12209/15147 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 13081 event pairs, 133 based on Foata normal form. 124/1733 useless extension candidates. Maximal degree in co-relation 9745. Up to 1050 conditions per place. [2021-03-25 14:55:27,262 INFO L132 encePairwiseOnDemand]: 203/215 looper letters, 36 selfloop transitions, 27 changer transitions 6/96 dead transitions. [2021-03-25 14:55:27,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 1137 flow [2021-03-25 14:55:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 14:55:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 14:55:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2021-03-25 14:55:27,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7334883720930233 [2021-03-25 14:55:27,267 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1577 transitions. [2021-03-25 14:55:27,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1577 transitions. [2021-03-25 14:55:27,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:27,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1577 transitions. [2021-03-25 14:55:27,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 157.7) internal successors, (1577), 10 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 215.0) internal successors, (2365), 11 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,275 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 215.0) internal successors, (2365), 11 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,275 INFO L185 Difference]: Start difference. First operand has 79 places, 72 transitions, 717 flow. Second operand 10 states and 1577 transitions. [2021-03-25 14:55:27,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 1137 flow [2021-03-25 14:55:27,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 96 transitions, 1087 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 14:55:27,312 INFO L241 Difference]: Finished difference. Result has 89 places, 74 transitions, 795 flow [2021-03-25 14:55:27,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=795, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2021-03-25 14:55:27,312 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2021-03-25 14:55:27,312 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:27,313 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 74 transitions, 795 flow [2021-03-25 14:55:27,313 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 74 transitions, 795 flow [2021-03-25 14:55:27,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 74 transitions, 795 flow [2021-03-25 14:55:27,487 INFO L129 PetriNetUnfolder]: 776/1607 cut-off events. [2021-03-25 14:55:27,487 INFO L130 PetriNetUnfolder]: For 10123/11107 co-relation queries the response was YES. [2021-03-25 14:55:27,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7941 conditions, 1607 events. 776/1607 cut-off events. For 10123/11107 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 12210 event pairs, 146 based on Foata normal form. 63/1515 useless extension candidates. Maximal degree in co-relation 7904. Up to 869 conditions per place. [2021-03-25 14:55:27,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 972 [2021-03-25 14:55:27,560 INFO L154 LiptonReduction]: Checked pairs total: 6 [2021-03-25 14:55:27,560 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:55:27,560 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 248 [2021-03-25 14:55:27,561 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 767 flow [2021-03-25 14:55:27,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 153.22222222222223) internal successors, (1379), 9 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,561 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:27,561 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:55:27,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:55:27,561 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1107434570, now seen corresponding path program 1 times [2021-03-25 14:55:27,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:27,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892021915] [2021-03-25 14:55:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:27,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:27,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:27,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:27,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:27,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:27,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:27,664 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:55:27,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:55:27,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:27,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:27,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892021915] [2021-03-25 14:55:27,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:27,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:55:27,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817182423] [2021-03-25 14:55:27,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:55:27,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:55:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:55:27,679 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-25 14:55:27,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 767 flow. Second operand has 6 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:27,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-25 14:55:27,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:27,915 INFO L129 PetriNetUnfolder]: 487/1098 cut-off events. [2021-03-25 14:55:27,916 INFO L130 PetriNetUnfolder]: For 8799/14538 co-relation queries the response was YES. [2021-03-25 14:55:27,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5725 conditions, 1098 events. 487/1098 cut-off events. For 8799/14538 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 8239 event pairs, 36 based on Foata normal form. 838/1817 useless extension candidates. Maximal degree in co-relation 5686. Up to 593 conditions per place. [2021-03-25 14:55:27,924 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 6 selfloop transitions, 28 changer transitions 6/84 dead transitions. [2021-03-25 14:55:27,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 84 transitions, 935 flow [2021-03-25 14:55:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:55:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:55:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1696 transitions. [2021-03-25 14:55:27,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.876485788113695 [2021-03-25 14:55:27,929 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1696 transitions. [2021-03-25 14:55:27,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1696 transitions. [2021-03-25 14:55:27,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:27,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1696 transitions. [2021-03-25 14:55:27,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 188.44444444444446) internal successors, (1696), 9 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,935 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 215.0) internal successors, (2150), 10 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:27,935 INFO L185 Difference]: Start difference. First operand has 88 places, 73 transitions, 767 flow. Second operand 9 states and 1696 transitions. [2021-03-25 14:55:27,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 84 transitions, 935 flow [2021-03-25 14:55:27,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 84 transitions, 865 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-03-25 14:55:27,954 INFO L241 Difference]: Finished difference. Result has 89 places, 78 transitions, 814 flow [2021-03-25 14:55:27,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=814, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2021-03-25 14:55:27,954 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2021-03-25 14:55:27,954 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:27,954 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 78 transitions, 814 flow [2021-03-25 14:55:27,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 78 transitions, 814 flow [2021-03-25 14:55:27,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 78 transitions, 814 flow [2021-03-25 14:55:28,047 INFO L129 PetriNetUnfolder]: 483/1121 cut-off events. [2021-03-25 14:55:28,047 INFO L130 PetriNetUnfolder]: For 8110/9802 co-relation queries the response was YES. [2021-03-25 14:55:28,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 1121 events. 483/1121 cut-off events. For 8110/9802 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 8907 event pairs, 28 based on Foata normal form. 39/1036 useless extension candidates. Maximal degree in co-relation 5977. Up to 589 conditions per place. [2021-03-25 14:55:28,065 INFO L142 LiptonReduction]: Number of co-enabled transitions 1042 [2021-03-25 14:55:28,141 INFO L154 LiptonReduction]: Checked pairs total: 86 [2021-03-25 14:55:28,142 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:55:28,142 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 188 [2021-03-25 14:55:28,142 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 788 flow [2021-03-25 14:55:28,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 184.83333333333334) internal successors, (1109), 6 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:28,143 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:28,143 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] [2021-03-25 14:55:28,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:55:28,143 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 278999757, now seen corresponding path program 1 times [2021-03-25 14:55:28,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:28,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084944962] [2021-03-25 14:55:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:55:28,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:28,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:28,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:28,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:28,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:28,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:28,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:28,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:55:28,229 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:55:28,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:55:28,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:55:28,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:55:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:55:28,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084944962] [2021-03-25 14:55:28,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:55:28,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:55:28,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68062295] [2021-03-25 14:55:28,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:55:28,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:55:28,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:55:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:55:28,240 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 215 [2021-03-25 14:55:28,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 788 flow. Second operand has 7 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:28,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:55:28,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 215 [2021-03-25 14:55:28,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:55:28,368 INFO L129 PetriNetUnfolder]: 182/430 cut-off events. [2021-03-25 14:55:28,368 INFO L130 PetriNetUnfolder]: For 3307/4274 co-relation queries the response was YES. [2021-03-25 14:55:28,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 430 events. 182/430 cut-off events. For 3307/4274 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2396 event pairs, 18 based on Foata normal form. 189/585 useless extension candidates. Maximal degree in co-relation 2449. Up to 233 conditions per place. [2021-03-25 14:55:28,373 INFO L132 encePairwiseOnDemand]: 208/215 looper letters, 2 selfloop transitions, 18 changer transitions 17/68 dead transitions. [2021-03-25 14:55:28,373 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 68 transitions, 760 flow [2021-03-25 14:55:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:55:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:55:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1498 transitions. [2021-03-25 14:55:28,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8709302325581395 [2021-03-25 14:55:28,376 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1498 transitions. [2021-03-25 14:55:28,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1498 transitions. [2021-03-25 14:55:28,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:55:28,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1498 transitions. [2021-03-25 14:55:28,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 187.25) internal successors, (1498), 8 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:28,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:28,380 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:28,381 INFO L185 Difference]: Start difference. First operand has 89 places, 75 transitions, 788 flow. Second operand 8 states and 1498 transitions. [2021-03-25 14:55:28,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 68 transitions, 760 flow [2021-03-25 14:55:28,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 605 flow, removed 55 selfloop flow, removed 12 redundant places. [2021-03-25 14:55:28,395 INFO L241 Difference]: Finished difference. Result has 79 places, 51 transitions, 450 flow [2021-03-25 14:55:28,395 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=450, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2021-03-25 14:55:28,395 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2021-03-25 14:55:28,395 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:55:28,395 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 51 transitions, 450 flow [2021-03-25 14:55:28,396 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 51 transitions, 450 flow [2021-03-25 14:55:28,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 51 transitions, 450 flow [2021-03-25 14:55:28,426 INFO L129 PetriNetUnfolder]: 112/290 cut-off events. [2021-03-25 14:55:28,426 INFO L130 PetriNetUnfolder]: For 933/987 co-relation queries the response was YES. [2021-03-25 14:55:28,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 290 events. 112/290 cut-off events. For 933/987 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1525 event pairs, 19 based on Foata normal form. 5/276 useless extension candidates. Maximal degree in co-relation 1298. Up to 100 conditions per place. [2021-03-25 14:55:28,430 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-25 14:55:30,010 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 313 DAG size of output: 261 [2021-03-25 14:55:30,415 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 237 [2021-03-25 14:55:33,863 WARN L205 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 425 DAG size of output: 349 [2021-03-25 14:55:34,782 WARN L205 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 322 [2021-03-25 14:55:35,343 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 14:55:35,815 WARN L205 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 14:55:36,765 WARN L205 SmtUtils]: Spent 947.00 ms on a formula simplification that was a NOOP. DAG size: 334 [2021-03-25 14:55:37,743 WARN L205 SmtUtils]: Spent 976.00 ms on a formula simplification that was a NOOP. DAG size: 334 [2021-03-25 14:55:37,749 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-25 14:55:37,749 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:55:37,750 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9355 [2021-03-25 14:55:37,750 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 432 flow [2021-03-25 14:55:37,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:55:37,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:55:37,751 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] [2021-03-25 14:55:37,751 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:55:37,751 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:55:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:55:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash 938279126, now seen corresponding path program 1 times [2021-03-25 14:55:37,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:55:37,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119163129] [2021-03-25 14:55:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:55:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:55:37,822 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:55:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:55:37,916 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:55:37,965 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:55:37,967 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:55:37,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:55:38,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:55:38 BasicIcfg [2021-03-25 14:55:38,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:55:38,099 INFO L168 Benchmark]: Toolchain (without parser) took 45695.16 ms. Allocated memory was 323.0 MB in the beginning and 1.0 GB in the end (delta: 702.5 MB). Free memory was 286.2 MB in the beginning and 786.2 MB in the end (delta: -500.0 MB). Peak memory consumption was 205.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:55:38,099 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 323.0 MB. Free memory is still 304.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:55:38,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.28 ms. Allocated memory is still 323.0 MB. Free memory was 285.9 MB in the beginning and 280.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:55:38,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.30 ms. Allocated memory is still 323.0 MB. Free memory was 279.8 MB in the beginning and 277.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:55:38,099 INFO L168 Benchmark]: Boogie Preprocessor took 54.08 ms. Allocated memory is still 323.0 MB. Free memory was 277.7 MB in the beginning and 274.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:55:38,099 INFO L168 Benchmark]: RCFGBuilder took 2394.82 ms. Allocated memory was 323.0 MB in the beginning and 432.0 MB in the end (delta: 109.1 MB). Free memory was 274.6 MB in the beginning and 345.6 MB in the end (delta: -71.0 MB). Peak memory consumption was 153.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:55:38,100 INFO L168 Benchmark]: TraceAbstraction took 42712.11 ms. Allocated memory was 432.0 MB in the beginning and 1.0 GB in the end (delta: 593.5 MB). Free memory was 345.6 MB in the beginning and 786.2 MB in the end (delta: -440.7 MB). Peak memory consumption was 153.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:55:38,100 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.93 ms. Allocated memory is still 323.0 MB. Free memory is still 304.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 466.28 ms. Allocated memory is still 323.0 MB. Free memory was 285.9 MB in the beginning and 280.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.30 ms. Allocated memory is still 323.0 MB. Free memory was 279.8 MB in the beginning and 277.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 54.08 ms. Allocated memory is still 323.0 MB. Free memory was 277.7 MB in the beginning and 274.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2394.82 ms. Allocated memory was 323.0 MB in the beginning and 432.0 MB in the end (delta: 109.1 MB). Free memory was 274.6 MB in the beginning and 345.6 MB in the end (delta: -71.0 MB). Peak memory consumption was 153.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 42712.11 ms. Allocated memory was 432.0 MB in the beginning and 1.0 GB in the end (delta: 593.5 MB). Free memory was 345.6 MB in the beginning and 786.2 MB in the end (delta: -440.7 MB). Peak memory consumption was 153.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15816.7ms, 122 PlacesBefore, 57 PlacesAfterwards, 110 TransitionsBefore, 45 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 4 FixpointIterations, 39 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 68 TotalNumberOfCompositions, 1880 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1112, positive: 1062, positive conditional: 0, positive unconditional: 1062, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 931, positive: 892, positive conditional: 0, positive unconditional: 892, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 931, positive: 892, positive conditional: 0, positive unconditional: 892, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 931, positive: 882, positive conditional: 0, positive unconditional: 882, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5211, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 916, negative conditional: 0, negative unconditional: 916, unknown: 4267, unknown conditional: 0, unknown unconditional: 4267] ], Cache Queries: [ total: 1112, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 931, unknown conditional: 0, unknown unconditional: 931] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1133.7ms, 63 PlacesBefore, 47 PlacesAfterwards, 45 TransitionsBefore, 32 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 3 FixpointIterations, 13 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 717 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 117, positive conditional: 0, positive unconditional: 117, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 175, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1278.6ms, 52 PlacesBefore, 45 PlacesAfterwards, 32 TransitionsBefore, 28 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 3 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 669 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 200, positive: 158, positive conditional: 0, positive unconditional: 158, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 200, positive: 150, positive conditional: 0, positive unconditional: 150, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1988.2ms, 54 PlacesBefore, 47 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 478 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3233.0ms, 52 PlacesBefore, 49 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3144, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 3122, unknown conditional: 0, unknown unconditional: 3122] ], Cache Queries: [ total: 70, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.5ms, 56 PlacesBefore, 54 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 161 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.0ms, 61 PlacesBefore, 58 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.4ms, 65 PlacesBefore, 62 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 285 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 116, positive conditional: 0, positive unconditional: 116, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, positive: 114, positive conditional: 0, positive unconditional: 114, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.9ms, 66 PlacesBefore, 63 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 98.2ms, 70 PlacesBefore, 67 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 313 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 109.1ms, 72 PlacesBefore, 69 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 344.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 254.9ms, 79 PlacesBefore, 79 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 247.2ms, 89 PlacesBefore, 88 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 187.1ms, 89 PlacesBefore, 89 PlacesAfterwards, 78 TransitionsBefore, 75 TransitionsAfterwards, 1042 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 86 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9353.8ms, 79 PlacesBefore, 74 PlacesAfterwards, 51 TransitionsBefore, 47 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t2162; [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2164; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L769] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L770] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L771] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L771] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L773] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L773] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] EXPR 1 \read(y) [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=0, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=1, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=2, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=2, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 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) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] 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) [L812] 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) [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 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 [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 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 [L826] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=0, weak$$choice2=0, x=2, y={9:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L864] 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) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 \read(y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] 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) [L864] 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) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 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 [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 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 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] EXPR 0 \read(y) [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 0 \read(y) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 x == 2 && y == 2 [L884] EXPR 0 \read(y) [L884] EXPR 0 x == 2 && y == 2 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L885] 0 y = y$flush_delayed ? y$mem_tmp : y [L886] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=2, y={9:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 42411.2ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4891.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15903.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 149 SDtfs, 241 SDslu, 208 SDs, 0 SdLazy, 931 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1203.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1425.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=14, InterpolantAutomatonStates: 117, 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: 70.2ms SsaConstructionTime, 726.0ms SatisfiabilityAnalysisTime, 1757.3ms InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 2482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...