/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/mix017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:21:39,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:21:39,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:21:39,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:21:39,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:21:39,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:21:39,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:21:39,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:21:39,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:21:39,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:21:39,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:21:39,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:21:39,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:21:39,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:21:39,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:21:39,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:21:39,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:21:39,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:21:39,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:21:39,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:21:39,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:21:39,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:21:39,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:21:39,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:21:39,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:21:39,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:21:39,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:21:39,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:21:39,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:21:39,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:21:39,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:21:39,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:21:39,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:21:39,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:21:39,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:21:39,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:21:39,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:21:39,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:21:39,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:21:39,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:21:39,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:21:39,816 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:21:39,852 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:21:39,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:21:39,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:21:39,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:21:39,855 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:21:39,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:21:39,856 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:21:39,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:21:39,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:21:39,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:21:39,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:21:39,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:21:39,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:21:39,858 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:21:39,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:21:39,858 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:21:39,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:21:39,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:21:39,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:21:39,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:21:39,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:21:39,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:21:39,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:21:39,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:21:39,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:21:39,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:21:39,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:21:39,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:21:39,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:21:39,860 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:21:40,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:21:40,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:21:40,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:21:40,211 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:21:40,212 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:21:40,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2021-03-25 14:21:40,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e1e82ad/8b40292b396b43c59482e44395a9700f/FLAG7da038d10 [2021-03-25 14:21:40,774 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:21:40,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2021-03-25 14:21:40,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e1e82ad/8b40292b396b43c59482e44395a9700f/FLAG7da038d10 [2021-03-25 14:21:41,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e1e82ad/8b40292b396b43c59482e44395a9700f [2021-03-25 14:21:41,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:21:41,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:21:41,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:21:41,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:21:41,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:21:41,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff42f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41, skipping insertion in model container [2021-03-25 14:21:41,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:21:41,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:21:41,435 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/mix017_rmo.opt.i[948,961] [2021-03-25 14:21:41,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:21:41,673 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:21:41,685 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i[948,961] [2021-03-25 14:21:41,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:21:41,821 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:21:41,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41 WrapperNode [2021-03-25 14:21:41,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:21:41,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:21:41,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:21:41,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:21:41,831 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:21:41" (1/1) ... [2021-03-25 14:21:41,862 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:21:41" (1/1) ... [2021-03-25 14:21:41,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:21:41,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:21:41,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:21:41,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:21:41,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (1/1) ... [2021-03-25 14:21:41,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:21:41,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:21:41,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:21:41,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:21:41,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (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:21:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:21:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:21:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:21:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:21:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:21:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:21:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:21:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:21:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:21:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:21:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:21:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:21:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:21:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:21:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:21:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:21:42,041 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:21:43,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:21:43,612 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:21:43,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:21:43 BoogieIcfgContainer [2021-03-25 14:21:43,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:21:43,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:21:43,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:21:43,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:21:43,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:21:41" (1/3) ... [2021-03-25 14:21:43,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e15c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:21:43, skipping insertion in model container [2021-03-25 14:21:43,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:21:41" (2/3) ... [2021-03-25 14:21:43,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e15c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:21:43, skipping insertion in model container [2021-03-25 14:21:43,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:21:43" (3/3) ... [2021-03-25 14:21:43,620 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2021-03-25 14:21:43,625 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:21:43,629 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:21:43,629 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:21:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,689 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,689 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,690 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,690 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,710 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,714 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,714 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,715 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,716 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,717 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,725 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,726 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,727 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:21:43,730 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:21:43,745 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:21:43,763 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:21:43,763 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:21:43,763 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:21:43,763 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:21:43,763 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:21:43,764 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:21:43,764 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:21:43,764 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:21:43,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:21:43,808 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:21:43,809 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:21:43,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 14:21:43,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:21:43,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:21:43,819 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:43,829 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:21:43,832 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:21:43,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:21:43,851 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:21:43,852 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:21:43,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 14:21:43,855 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-25 14:21:45,197 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:21:45,617 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:21:45,779 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:21:47,114 INFO L154 LiptonReduction]: Checked pairs total: 4168 [2021-03-25 14:21:47,114 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 14:21:47,124 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3306 [2021-03-25 14:21:47,147 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 14:21:47,147 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:21:47,147 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:47,148 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:21:47,148 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:47,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:47,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1330076936, now seen corresponding path program 1 times [2021-03-25 14:21:47,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:47,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530260289] [2021-03-25 14:21:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:47,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:47,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:47,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:47,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:47,406 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:21:47,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530260289] [2021-03-25 14:21:47,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:47,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:21:47,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363197422] [2021-03-25 14:21:47,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:21:47,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:21:47,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:21:47,426 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2021-03-25 14:21:47,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:21:47,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:47,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2021-03-25 14:21:47,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:47,525 INFO L129 PetriNetUnfolder]: 29/148 cut-off events. [2021-03-25 14:21:47,525 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:21:47,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 148 events. 29/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 595 event pairs, 15 based on Foata normal form. 9/140 useless extension candidates. Maximal degree in co-relation 193. Up to 41 conditions per place. [2021-03-25 14:21:47,530 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 7 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2021-03-25 14:21:47,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 122 flow [2021-03-25 14:21:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:21:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:21:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-25 14:21:47,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2021-03-25 14:21:47,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-25 14:21:47,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-25 14:21:47,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:47,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-25 14:21:47,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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:21:47,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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:21:47,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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:21:47,578 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 525 transitions. [2021-03-25 14:21:47,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 122 flow [2021-03-25 14:21:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:21:47,582 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-25 14:21:47,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-25 14:21:47,584 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:21:47,584 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:47,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:21:47,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:21:47,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-25 14:21:47,596 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-25 14:21:47,596 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:21:47,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:21:47,597 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-25 14:21:47,989 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:21:48,128 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:21:49,497 INFO L154 LiptonReduction]: Checked pairs total: 2080 [2021-03-25 14:21:49,498 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 14:21:49,498 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1914 [2021-03-25 14:21:49,499 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:21:49,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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:21:49,500 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:49,500 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] [2021-03-25 14:21:49,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:21:49,500 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -855823093, now seen corresponding path program 1 times [2021-03-25 14:21:49,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:49,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662034688] [2021-03-25 14:21:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:49,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:49,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:49,647 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:21:49,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:21:49,658 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:21:49,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:21:49,666 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:21:49,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662034688] [2021-03-25 14:21:49,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:49,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:21:49,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946799155] [2021-03-25 14:21:49,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:21:49,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:49,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:21:49,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:21:49,674 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:21:49,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:21:49,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:49,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:21:49,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:49,771 INFO L129 PetriNetUnfolder]: 154/347 cut-off events. [2021-03-25 14:21:49,771 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:21:49,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 347 events. 154/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1825 event pairs, 47 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 597. Up to 124 conditions per place. [2021-03-25 14:21:49,774 INFO L132 encePairwiseOnDemand]: 198/206 looper letters, 6 selfloop transitions, 5 changer transitions 12/44 dead transitions. [2021-03-25 14:21:49,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 146 flow [2021-03-25 14:21:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:21:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:21:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2021-03-25 14:21:49,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8533980582524272 [2021-03-25 14:21:49,776 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 879 transitions. [2021-03-25 14:21:49,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions. [2021-03-25 14:21:49,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:49,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions. [2021-03-25 14:21:49,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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:21:49,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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:21:49,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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:21:49,783 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 879 transitions. [2021-03-25 14:21:49,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 146 flow [2021-03-25 14:21:49,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:21:49,784 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 107 flow [2021-03-25 14:21:49,785 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-25 14:21:49,785 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2021-03-25 14:21:49,785 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:49,785 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 107 flow [2021-03-25 14:21:49,786 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 107 flow [2021-03-25 14:21:49,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 107 flow [2021-03-25 14:21:49,806 INFO L129 PetriNetUnfolder]: 74/176 cut-off events. [2021-03-25 14:21:49,806 INFO L130 PetriNetUnfolder]: For 42/46 co-relation queries the response was YES. [2021-03-25 14:21:49,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 176 events. 74/176 cut-off events. For 42/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 770 event pairs, 40 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 381. Up to 105 conditions per place. [2021-03-25 14:21:49,809 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-25 14:21:50,538 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:21:50,731 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:21:51,067 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 14:21:51,227 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 14:21:51,234 INFO L154 LiptonReduction]: Checked pairs total: 684 [2021-03-25 14:21:51,234 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:21:51,235 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1450 [2021-03-25 14:21:51,235 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 103 flow [2021-03-25 14:21:51,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:21:51,236 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:51,236 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:21:51,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:21:51,236 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:51,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:51,237 INFO L82 PathProgramCache]: Analyzing trace with hash 249403867, now seen corresponding path program 1 times [2021-03-25 14:21:51,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:51,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522601054] [2021-03-25 14:21:51,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:51,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:51,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:51,338 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:21:51,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:21:51,351 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:21:51,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522601054] [2021-03-25 14:21:51,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:51,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:21:51,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985879721] [2021-03-25 14:21:51,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:21:51,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:21:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:21:51,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 208 [2021-03-25 14:21:51,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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:21:51,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:51,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 208 [2021-03-25 14:21:51,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:51,395 INFO L129 PetriNetUnfolder]: 61/140 cut-off events. [2021-03-25 14:21:51,396 INFO L130 PetriNetUnfolder]: For 89/157 co-relation queries the response was YES. [2021-03-25 14:21:51,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 140 events. 61/140 cut-off events. For 89/157 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 504 event pairs, 9 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 412. Up to 89 conditions per place. [2021-03-25 14:21:51,399 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 11 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-03-25 14:21:51,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 149 flow [2021-03-25 14:21:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:21:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:21:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2021-03-25 14:21:51,402 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8637820512820513 [2021-03-25 14:21:51,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2021-03-25 14:21:51,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2021-03-25 14:21:51,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:51,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2021-03-25 14:21:51,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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:21:51,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:21:51,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:21:51,405 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 103 flow. Second operand 3 states and 539 transitions. [2021-03-25 14:21:51,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 149 flow [2021-03-25 14:21:51,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:21:51,408 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 109 flow [2021-03-25 14:21:51,408 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-25 14:21:51,408 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2021-03-25 14:21:51,408 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:51,408 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 109 flow [2021-03-25 14:21:51,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 109 flow [2021-03-25 14:21:51,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 109 flow [2021-03-25 14:21:51,475 INFO L129 PetriNetUnfolder]: 60/145 cut-off events. [2021-03-25 14:21:51,475 INFO L130 PetriNetUnfolder]: For 63/67 co-relation queries the response was YES. [2021-03-25 14:21:51,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 145 events. 60/145 cut-off events. For 63/67 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 549 event pairs, 25 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 345. Up to 87 conditions per place. [2021-03-25 14:21:51,478 INFO L142 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-25 14:21:51,497 INFO L154 LiptonReduction]: Checked pairs total: 227 [2021-03-25 14:21:51,497 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:21:51,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-25 14:21:51,499 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 109 flow [2021-03-25 14:21:51,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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:21:51,499 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:51,500 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:21:51,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:21:51,500 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2103793437, now seen corresponding path program 1 times [2021-03-25 14:21:51,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:51,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333845395] [2021-03-25 14:21:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:51,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:51,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:51,606 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:21:51,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:21:51,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:51,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:51,615 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:21:51,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333845395] [2021-03-25 14:21:51,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:51,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:21:51,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766079686] [2021-03-25 14:21:51,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:21:51,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:21:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:21:51,617 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 208 [2021-03-25 14:21:51,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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:21:51,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:51,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 208 [2021-03-25 14:21:51,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:51,727 INFO L129 PetriNetUnfolder]: 327/647 cut-off events. [2021-03-25 14:21:51,728 INFO L130 PetriNetUnfolder]: For 132/142 co-relation queries the response was YES. [2021-03-25 14:21:51,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 647 events. 327/647 cut-off events. For 132/142 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 3931 event pairs, 153 based on Foata normal form. 52/629 useless extension candidates. Maximal degree in co-relation 1421. Up to 366 conditions per place. [2021-03-25 14:21:51,736 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 10 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2021-03-25 14:21:51,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow [2021-03-25 14:21:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:21:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:21:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-25 14:21:51,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8625 [2021-03-25 14:21:51,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-25 14:21:51,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-25 14:21:51,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:51,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-25 14:21:51,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 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:21:51,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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:21:51,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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:21:51,745 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 109 flow. Second operand 5 states and 897 transitions. [2021-03-25 14:21:51,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow [2021-03-25 14:21:51,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:21:51,748 INFO L241 Difference]: Finished difference. Result has 46 places, 39 transitions, 178 flow [2021-03-25 14:21:51,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2021-03-25 14:21:51,748 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2021-03-25 14:21:51,748 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:51,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 178 flow [2021-03-25 14:21:51,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 178 flow [2021-03-25 14:21:51,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 178 flow [2021-03-25 14:21:51,822 INFO L129 PetriNetUnfolder]: 347/665 cut-off events. [2021-03-25 14:21:51,822 INFO L130 PetriNetUnfolder]: For 443/496 co-relation queries the response was YES. [2021-03-25 14:21:51,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 665 events. 347/665 cut-off events. For 443/496 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4126 event pairs, 200 based on Foata normal form. 7/609 useless extension candidates. Maximal degree in co-relation 1902. Up to 406 conditions per place. [2021-03-25 14:21:51,832 INFO L142 LiptonReduction]: Number of co-enabled transitions 502 [2021-03-25 14:21:51,923 INFO L154 LiptonReduction]: Checked pairs total: 510 [2021-03-25 14:21:51,924 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:21:51,924 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 176 [2021-03-25 14:21:51,926 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 172 flow [2021-03-25 14:21:51,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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:21:51,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:51,926 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:21:51,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:21:51,927 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:51,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1600266186, now seen corresponding path program 1 times [2021-03-25 14:21:51,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:51,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584277251] [2021-03-25 14:21:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:51,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:51,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:51,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:51,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:51,997 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:21:51,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:21:52,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:52,006 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:21:52,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584277251] [2021-03-25 14:21:52,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:52,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:21:52,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317561565] [2021-03-25 14:21:52,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:21:52,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:21:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:21:52,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 208 [2021-03-25 14:21:52,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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:21:52,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:52,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 208 [2021-03-25 14:21:52,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:52,113 INFO L129 PetriNetUnfolder]: 192/434 cut-off events. [2021-03-25 14:21:52,114 INFO L130 PetriNetUnfolder]: For 422/722 co-relation queries the response was YES. [2021-03-25 14:21:52,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 434 events. 192/434 cut-off events. For 422/722 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2429 event pairs, 49 based on Foata normal form. 98/508 useless extension candidates. Maximal degree in co-relation 1503. Up to 281 conditions per place. [2021-03-25 14:21:52,119 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 10 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2021-03-25 14:21:52,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 272 flow [2021-03-25 14:21:52,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:21:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:21:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1076 transitions. [2021-03-25 14:21:52,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8621794871794872 [2021-03-25 14:21:52,122 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1076 transitions. [2021-03-25 14:21:52,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1076 transitions. [2021-03-25 14:21:52,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:52,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1076 transitions. [2021-03-25 14:21:52,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 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:21:52,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 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:21:52,129 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 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:21:52,129 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 172 flow. Second operand 6 states and 1076 transitions. [2021-03-25 14:21:52,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 272 flow [2021-03-25 14:21:52,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 265 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:21:52,134 INFO L241 Difference]: Finished difference. Result has 50 places, 43 transitions, 261 flow [2021-03-25 14:21:52,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2021-03-25 14:21:52,135 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2021-03-25 14:21:52,135 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:52,135 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 43 transitions, 261 flow [2021-03-25 14:21:52,135 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 43 transitions, 261 flow [2021-03-25 14:21:52,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 43 transitions, 261 flow [2021-03-25 14:21:52,174 INFO L129 PetriNetUnfolder]: 198/438 cut-off events. [2021-03-25 14:21:52,174 INFO L130 PetriNetUnfolder]: For 772/865 co-relation queries the response was YES. [2021-03-25 14:21:52,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 438 events. 198/438 cut-off events. For 772/865 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2525 event pairs, 68 based on Foata normal form. 13/426 useless extension candidates. Maximal degree in co-relation 1756. Up to 287 conditions per place. [2021-03-25 14:21:52,181 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-25 14:21:52,200 INFO L154 LiptonReduction]: Checked pairs total: 476 [2021-03-25 14:21:52,200 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:21:52,200 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-25 14:21:52,203 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 253 flow [2021-03-25 14:21:52,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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:21:52,204 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:52,204 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:21:52,204 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:21:52,204 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2019315981, now seen corresponding path program 1 times [2021-03-25 14:21:52,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:52,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677703726] [2021-03-25 14:21:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:52,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,305 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:21:52,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:21:52,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:52,315 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:21:52,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677703726] [2021-03-25 14:21:52,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:52,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:21:52,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601252141] [2021-03-25 14:21:52,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:21:52,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:21:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:21:52,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 208 [2021-03-25 14:21:52,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 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:21:52,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:52,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 208 [2021-03-25 14:21:52,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:52,401 INFO L129 PetriNetUnfolder]: 100/257 cut-off events. [2021-03-25 14:21:52,402 INFO L130 PetriNetUnfolder]: For 635/892 co-relation queries the response was YES. [2021-03-25 14:21:52,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 257 events. 100/257 cut-off events. For 635/892 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1194 event pairs, 16 based on Foata normal form. 103/350 useless extension candidates. Maximal degree in co-relation 1110. Up to 160 conditions per place. [2021-03-25 14:21:52,405 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 6 selfloop transitions, 18 changer transitions 4/51 dead transitions. [2021-03-25 14:21:52,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 395 flow [2021-03-25 14:21:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:21:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:21:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1255 transitions. [2021-03-25 14:21:52,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8619505494505495 [2021-03-25 14:21:52,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1255 transitions. [2021-03-25 14:21:52,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1255 transitions. [2021-03-25 14:21:52,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:52,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1255 transitions. [2021-03-25 14:21:52,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.28571428571428) internal successors, (1255), 7 states have internal predecessors, (1255), 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:21:52,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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:21:52,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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:21:52,415 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 253 flow. Second operand 7 states and 1255 transitions. [2021-03-25 14:21:52,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 395 flow [2021-03-25 14:21:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 333 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 14:21:52,420 INFO L241 Difference]: Finished difference. Result has 53 places, 47 transitions, 313 flow [2021-03-25 14:21:52,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2021-03-25 14:21:52,420 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2021-03-25 14:21:52,420 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:52,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 313 flow [2021-03-25 14:21:52,421 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 313 flow [2021-03-25 14:21:52,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 313 flow [2021-03-25 14:21:52,446 INFO L129 PetriNetUnfolder]: 98/247 cut-off events. [2021-03-25 14:21:52,447 INFO L130 PetriNetUnfolder]: For 454/474 co-relation queries the response was YES. [2021-03-25 14:21:52,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 247 events. 98/247 cut-off events. For 454/474 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1176 event pairs, 23 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 963. Up to 137 conditions per place. [2021-03-25 14:21:52,450 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-25 14:21:52,461 INFO L154 LiptonReduction]: Checked pairs total: 566 [2021-03-25 14:21:52,461 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:21:52,461 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 14:21:52,463 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 303 flow [2021-03-25 14:21:52,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 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:21:52,463 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:52,464 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] [2021-03-25 14:21:52,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:21:52,464 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1124346278, now seen corresponding path program 1 times [2021-03-25 14:21:52,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:52,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125018404] [2021-03-25 14:21:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:52,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:52,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,540 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:21:52,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125018404] [2021-03-25 14:21:52,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:52,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:21:52,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760033169] [2021-03-25 14:21:52,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:21:52,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:52,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:21:52,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:21:52,543 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-25 14:21:52,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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:21:52,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:52,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-25 14:21:52,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:52,590 INFO L129 PetriNetUnfolder]: 125/314 cut-off events. [2021-03-25 14:21:52,590 INFO L130 PetriNetUnfolder]: For 573/612 co-relation queries the response was YES. [2021-03-25 14:21:52,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 314 events. 125/314 cut-off events. For 573/612 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1551 event pairs, 22 based on Foata normal form. 8/308 useless extension candidates. Maximal degree in co-relation 1129. Up to 153 conditions per place. [2021-03-25 14:21:52,594 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 4 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-25 14:21:52,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 277 flow [2021-03-25 14:21:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:21:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:21:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 739 transitions. [2021-03-25 14:21:52,596 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882211538461539 [2021-03-25 14:21:52,596 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 739 transitions. [2021-03-25 14:21:52,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 739 transitions. [2021-03-25 14:21:52,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:52,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 739 transitions. [2021-03-25 14:21:52,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:21:52,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 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:21:52,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 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:21:52,600 INFO L185 Difference]: Start difference. First operand has 53 places, 46 transitions, 303 flow. Second operand 4 states and 739 transitions. [2021-03-25 14:21:52,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 277 flow [2021-03-25 14:21:52,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 236 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 14:21:52,607 INFO L241 Difference]: Finished difference. Result has 52 places, 43 transitions, 229 flow [2021-03-25 14:21:52,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2021-03-25 14:21:52,607 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2021-03-25 14:21:52,607 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:52,607 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 229 flow [2021-03-25 14:21:52,607 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 229 flow [2021-03-25 14:21:52,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 229 flow [2021-03-25 14:21:52,636 INFO L129 PetriNetUnfolder]: 125/300 cut-off events. [2021-03-25 14:21:52,636 INFO L130 PetriNetUnfolder]: For 361/368 co-relation queries the response was YES. [2021-03-25 14:21:52,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 300 events. 125/300 cut-off events. For 361/368 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1438 event pairs, 34 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 939. Up to 111 conditions per place. [2021-03-25 14:21:52,662 INFO L142 LiptonReduction]: Number of co-enabled transitions 494 [2021-03-25 14:21:52,700 INFO L154 LiptonReduction]: Checked pairs total: 471 [2021-03-25 14:21:52,700 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:21:52,700 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93 [2021-03-25 14:21:52,702 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 232 flow [2021-03-25 14:21:52,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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:21:52,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:52,704 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] [2021-03-25 14:21:52,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:21:52,704 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 919891762, now seen corresponding path program 2 times [2021-03-25 14:21:52,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:52,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531497743] [2021-03-25 14:21:52,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:52,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:52,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:52,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:52,779 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:21:52,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531497743] [2021-03-25 14:21:52,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:52,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:21:52,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690493257] [2021-03-25 14:21:52,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:21:52,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:21:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:21:52,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 209 [2021-03-25 14:21:52,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:21:52,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:52,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 209 [2021-03-25 14:21:52,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:52,848 INFO L129 PetriNetUnfolder]: 210/508 cut-off events. [2021-03-25 14:21:52,849 INFO L130 PetriNetUnfolder]: For 741/779 co-relation queries the response was YES. [2021-03-25 14:21:52,851 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 508 events. 210/508 cut-off events. For 741/779 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2877 event pairs, 37 based on Foata normal form. 8/486 useless extension candidates. Maximal degree in co-relation 1611. Up to 198 conditions per place. [2021-03-25 14:21:52,853 INFO L132 encePairwiseOnDemand]: 205/209 looper letters, 5 selfloop transitions, 2 changer transitions 1/46 dead transitions. [2021-03-25 14:21:52,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 269 flow [2021-03-25 14:21:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:21:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:21:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions. [2021-03-25 14:21:52,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8672248803827751 [2021-03-25 14:21:52,855 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 725 transitions. [2021-03-25 14:21:52,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 725 transitions. [2021-03-25 14:21:52,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:52,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 725 transitions. [2021-03-25 14:21:52,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 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:21:52,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:21:52,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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:21:52,859 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 232 flow. Second operand 4 states and 725 transitions. [2021-03-25 14:21:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 269 flow [2021-03-25 14:21:52,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:21:52,864 INFO L241 Difference]: Finished difference. Result has 56 places, 44 transitions, 249 flow [2021-03-25 14:21:52,865 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2021-03-25 14:21:52,865 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2021-03-25 14:21:52,865 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:52,865 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 249 flow [2021-03-25 14:21:52,865 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 44 transitions, 249 flow [2021-03-25 14:21:52,866 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 44 transitions, 249 flow [2021-03-25 14:21:52,906 INFO L129 PetriNetUnfolder]: 207/486 cut-off events. [2021-03-25 14:21:52,906 INFO L130 PetriNetUnfolder]: For 714/729 co-relation queries the response was YES. [2021-03-25 14:21:52,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 486 events. 207/486 cut-off events. For 714/729 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2812 event pairs, 48 based on Foata normal form. 1/458 useless extension candidates. Maximal degree in co-relation 1594. Up to 198 conditions per place. [2021-03-25 14:21:52,914 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-25 14:21:53,658 WARN L205 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:21:53,943 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:21:55,220 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:21:55,776 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:21:55,800 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-25 14:21:55,800 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:21:55,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2935 [2021-03-25 14:21:55,801 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 252 flow [2021-03-25 14:21:55,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:21:55,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:55,801 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] [2021-03-25 14:21:55,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:21:55,801 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1408137279, now seen corresponding path program 1 times [2021-03-25 14:21:55,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:55,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843235115] [2021-03-25 14:21:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:55,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:55,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:55,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:55,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:55,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:55,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:55,850 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:21:55,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843235115] [2021-03-25 14:21:55,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:55,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:21:55,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778524965] [2021-03-25 14:21:55,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:21:55,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:55,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:21:55,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:21:55,852 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 210 [2021-03-25 14:21:55,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 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:21:55,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:55,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 210 [2021-03-25 14:21:55,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:55,982 INFO L129 PetriNetUnfolder]: 350/826 cut-off events. [2021-03-25 14:21:55,982 INFO L130 PetriNetUnfolder]: For 1374/1427 co-relation queries the response was YES. [2021-03-25 14:21:55,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 826 events. 350/826 cut-off events. For 1374/1427 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5453 event pairs, 50 based on Foata normal form. 7/782 useless extension candidates. Maximal degree in co-relation 2735. Up to 349 conditions per place. [2021-03-25 14:21:55,988 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 6 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2021-03-25 14:21:55,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 289 flow [2021-03-25 14:21:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:21:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:21:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 732 transitions. [2021-03-25 14:21:55,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2021-03-25 14:21:55,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 732 transitions. [2021-03-25 14:21:55,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 732 transitions. [2021-03-25 14:21:55,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:55,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 732 transitions. [2021-03-25 14:21:55,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:21:55,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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:21:55,995 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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:21:55,995 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 252 flow. Second operand 4 states and 732 transitions. [2021-03-25 14:21:55,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 289 flow [2021-03-25 14:21:56,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:21:56,002 INFO L241 Difference]: Finished difference. Result has 60 places, 45 transitions, 269 flow [2021-03-25 14:21:56,002 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2021-03-25 14:21:56,002 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2021-03-25 14:21:56,002 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:56,003 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 45 transitions, 269 flow [2021-03-25 14:21:56,003 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 45 transitions, 269 flow [2021-03-25 14:21:56,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 45 transitions, 269 flow [2021-03-25 14:21:56,075 INFO L129 PetriNetUnfolder]: 345/806 cut-off events. [2021-03-25 14:21:56,075 INFO L130 PetriNetUnfolder]: For 1312/1368 co-relation queries the response was YES. [2021-03-25 14:21:56,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 806 events. 345/806 cut-off events. For 1312/1368 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5422 event pairs, 55 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 2696. Up to 347 conditions per place. [2021-03-25 14:21:56,086 INFO L142 LiptonReduction]: Number of co-enabled transitions 518 [2021-03-25 14:21:56,212 INFO L154 LiptonReduction]: Checked pairs total: 337 [2021-03-25 14:21:56,212 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:21:56,213 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 211 [2021-03-25 14:21:56,214 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 272 flow [2021-03-25 14:21:56,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 182.25) internal successors, (729), 4 states have internal predecessors, (729), 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:21:56,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:56,214 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] [2021-03-25 14:21:56,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:21:56,215 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:56,215 INFO L82 PathProgramCache]: Analyzing trace with hash -623453022, now seen corresponding path program 3 times [2021-03-25 14:21:56,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:56,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228297816] [2021-03-25 14:21:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:21:56,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:56,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:56,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:56,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:56,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:56,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:56,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:56,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:21:56,317 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:21:56,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:21:56,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:21:56,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:21:56,326 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:21:56,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228297816] [2021-03-25 14:21:56,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:21:56,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:21:56,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369127769] [2021-03-25 14:21:56,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:21:56,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:21:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:21:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:21:56,329 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 211 [2021-03-25 14:21:56,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 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:21:56,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:21:56,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 211 [2021-03-25 14:21:56,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:21:56,469 INFO L129 PetriNetUnfolder]: 303/720 cut-off events. [2021-03-25 14:21:56,470 INFO L130 PetriNetUnfolder]: For 1364/1788 co-relation queries the response was YES. [2021-03-25 14:21:56,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 720 events. 303/720 cut-off events. For 1364/1788 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4693 event pairs, 45 based on Foata normal form. 222/892 useless extension candidates. Maximal degree in co-relation 2900. Up to 311 conditions per place. [2021-03-25 14:21:56,475 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 2 selfloop transitions, 17 changer transitions 11/50 dead transitions. [2021-03-25 14:21:56,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 50 transitions, 368 flow [2021-03-25 14:21:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:21:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:21:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-03-25 14:21:56,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8590047393364929 [2021-03-25 14:21:56,479 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-03-25 14:21:56,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-03-25 14:21:56,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:21:56,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-03-25 14:21:56,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 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:21:56,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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:21:56,486 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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:21:56,486 INFO L185 Difference]: Start difference. First operand has 60 places, 45 transitions, 272 flow. Second operand 8 states and 1450 transitions. [2021-03-25 14:21:56,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 50 transitions, 368 flow [2021-03-25 14:21:56,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 50 transitions, 343 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-25 14:21:56,496 INFO L241 Difference]: Finished difference. Result has 68 places, 39 transitions, 257 flow [2021-03-25 14:21:56,497 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=257, PETRI_PLACES=68, PETRI_TRANSITIONS=39} [2021-03-25 14:21:56,497 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2021-03-25 14:21:56,497 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:21:56,498 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 39 transitions, 257 flow [2021-03-25 14:21:56,498 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 39 transitions, 257 flow [2021-03-25 14:21:56,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 39 transitions, 257 flow [2021-03-25 14:21:56,514 INFO L129 PetriNetUnfolder]: 68/169 cut-off events. [2021-03-25 14:21:56,514 INFO L130 PetriNetUnfolder]: For 275/313 co-relation queries the response was YES. [2021-03-25 14:21:56,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 169 events. 68/169 cut-off events. For 275/313 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 732 event pairs, 9 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 640. Up to 65 conditions per place. [2021-03-25 14:21:56,517 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-25 14:21:56,949 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-25 14:21:57,137 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-25 14:21:57,460 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 14:21:57,711 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 14:21:57,884 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 14:21:57,889 INFO L154 LiptonReduction]: Checked pairs total: 375 [2021-03-25 14:21:57,889 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:21:57,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1392 [2021-03-25 14:21:57,890 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 249 flow [2021-03-25 14:21:57,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 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:21:57,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:21:57,890 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] [2021-03-25 14:21:57,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:21:57,891 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:21:57,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:21:57,891 INFO L82 PathProgramCache]: Analyzing trace with hash 474196179, now seen corresponding path program 1 times [2021-03-25 14:21:57,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:21:57,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391759994] [2021-03-25 14:21:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:21:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:21:57,930 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:21:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:21:57,974 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:21:58,003 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:21:58,003 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:21:58,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:21:58,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:21:58 BasicIcfg [2021-03-25 14:21:58,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:21:58,100 INFO L168 Benchmark]: Toolchain (without parser) took 16847.57 ms. Allocated memory was 255.9 MB in the beginning and 650.1 MB in the end (delta: 394.3 MB). Free memory was 233.1 MB in the beginning and 493.4 MB in the end (delta: -260.4 MB). Peak memory consumption was 132.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:21:58,100 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:21:58,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.21 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 233.1 MB in the beginning and 297.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:21:58,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.23 ms. Allocated memory is still 337.6 MB. Free memory was 297.1 MB in the beginning and 294.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:21:58,101 INFO L168 Benchmark]: Boogie Preprocessor took 50.44 ms. Allocated memory is still 337.6 MB. Free memory was 294.7 MB in the beginning and 292.6 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:21:58,101 INFO L168 Benchmark]: RCFGBuilder took 1660.75 ms. Allocated memory is still 337.6 MB. Free memory was 292.6 MB in the beginning and 180.5 MB in the end (delta: 112.0 MB). Peak memory consumption was 112.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:21:58,101 INFO L168 Benchmark]: TraceAbstraction took 14484.39 ms. Allocated memory was 337.6 MB in the beginning and 650.1 MB in the end (delta: 312.5 MB). Free memory was 180.5 MB in the beginning and 493.4 MB in the end (delta: -312.9 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:21:58,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 567.21 ms. Allocated memory was 255.9 MB in the beginning and 337.6 MB in the end (delta: 81.8 MB). Free memory was 233.1 MB in the beginning and 297.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.23 ms. Allocated memory is still 337.6 MB. Free memory was 297.1 MB in the beginning and 294.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.44 ms. Allocated memory is still 337.6 MB. Free memory was 294.7 MB in the beginning and 292.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1660.75 ms. Allocated memory is still 337.6 MB. Free memory was 292.6 MB in the beginning and 180.5 MB in the end (delta: 112.0 MB). Peak memory consumption was 112.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14484.39 ms. Allocated memory was 337.6 MB in the beginning and 650.1 MB in the end (delta: 312.5 MB). Free memory was 180.5 MB in the beginning and 493.4 MB in the end (delta: -312.9 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3282.2ms, 124 PlacesBefore, 58 PlacesAfterwards, 113 TransitionsBefore, 46 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 0, positive unconditional: 2156, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1608, positive: 1569, positive conditional: 0, positive unconditional: 1569, 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: 1608, positive: 1569, positive conditional: 0, positive unconditional: 1569, 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: 1608, positive: 1550, positive conditional: 0, positive unconditional: 1550, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 425, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 360, negative conditional: 0, negative unconditional: 360, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2249, positive: 587, positive conditional: 0, positive unconditional: 587, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1608, unknown conditional: 0, unknown unconditional: 1608] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1913.0ms, 54 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 29 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2080 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 791, positive: 680, positive conditional: 0, positive unconditional: 680, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 152, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 152, positive: 116, positive conditional: 0, positive unconditional: 116, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 459, negative conditional: 0, negative unconditional: 459, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 791, positive: 555, positive conditional: 0, positive unconditional: 555, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 152, unknown conditional: 0, unknown unconditional: 152] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1448.8ms, 44 PlacesBefore, 39 PlacesAfterwards, 32 TransitionsBefore, 30 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 684 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 249, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 6, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 6, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, positive: 206, positive conditional: 0, positive unconditional: 206, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 203, Positive conditional cache size: 0, Positive unconditional cache size: 203, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.2ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 174.6ms, 46 PlacesBefore, 46 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 250, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 15, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 15, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 47, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.5ms, 50 PlacesBefore, 50 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 150, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.6ms, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 566 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 206, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 471 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 224, positive: 204, positive conditional: 0, positive unconditional: 204, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2934.6ms, 56 PlacesBefore, 56 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 14, negative conditional: 0, negative unconditional: 14, 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: 144, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 209.8ms, 60 PlacesBefore, 60 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 14, negative conditional: 0, negative unconditional: 14, 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: 140, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1391.0ms, 68 PlacesBefore, 60 PlacesAfterwards, 39 TransitionsBefore, 35 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 375 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 177, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 5, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 89, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t453; [L859] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t454; [L861] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t455; [L863] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t456; [L865] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 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) [L836] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L836] 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) [L836] 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) [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L838] 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 [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L840] 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 [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L813] 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) [L813] 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) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 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 [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 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 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] 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) [L871] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L871] 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) [L871] 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) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L873] 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 [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L875] 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 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14244.2ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1166.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3371.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 48 SDtfs, 37 SDslu, 30 SDs, 0 SdLazy, 199 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 194.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 157.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=6, InterpolantAutomatonStates: 49, 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: 41.6ms SsaConstructionTime, 343.4ms SatisfiabilityAnalysisTime, 646.4ms InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...