/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:49:22,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:49:22,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:49:22,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:49:22,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:49:22,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:49:22,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:49:22,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:49:22,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:49:22,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:49:22,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:49:22,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:49:22,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:49:22,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:49:22,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:49:22,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:49:22,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:49:22,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:49:22,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:49:22,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:49:22,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:49:22,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:49:22,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:49:22,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:49:22,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:49:22,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:49:22,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:49:22,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:49:22,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:49:22,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:49:22,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:49:22,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:49:22,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:49:22,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:49:22,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:49:22,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:49:22,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:49:22,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:49:22,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:49:22,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:49:22,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:49:22,959 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-RepeatedVariableLbe.epf [2021-03-25 04:49:22,997 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:49:22,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:49:23,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:49:23,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:49:23,001 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:49:23,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:49:23,001 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:49:23,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:49:23,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:49:23,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:49:23,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:49:23,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:49:23,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:49:23,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:49:23,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:49:23,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:49:23,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:49:23,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:49:23,005 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 04:49:23,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:49:23,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:49:23,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:49:23,350 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:49:23,351 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:49:23,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2021-03-25 04:49:23,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d1a9425/0d9d3fb6f0044602a092f5a82a8ba27c/FLAGaee40e32a [2021-03-25 04:49:23,921 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:49:23,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2021-03-25 04:49:23,935 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d1a9425/0d9d3fb6f0044602a092f5a82a8ba27c/FLAGaee40e32a [2021-03-25 04:49:24,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d1a9425/0d9d3fb6f0044602a092f5a82a8ba27c [2021-03-25 04:49:24,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:49:24,412 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:49:24,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:49:24,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:49:24,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:49:24,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c7570c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24, skipping insertion in model container [2021-03-25 04:49:24,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:49:24,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:49:24,643 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/mix053_rmo.opt.i[948,961] [2021-03-25 04:49:24,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:49:24,841 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:49:24,849 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/mix053_rmo.opt.i[948,961] [2021-03-25 04:49:24,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:49:24,933 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:49:24,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24 WrapperNode [2021-03-25 04:49:24,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:49:24,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:49:24,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:49:24,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:49:24,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:49:24,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:49:24,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:49:24,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:49:24,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:24,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:25,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (1/1) ... [2021-03-25 04:49:25,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:49:25,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:49:25,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:49:25,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:49:25,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (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 04:49:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:49:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:49:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:49:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:49:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:49:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:49:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:49:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:49:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:49:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:49:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:49:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:49:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:49:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:49:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:49:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:49:25,086 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 04:49:26,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:49:26,547 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:49:26,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:49:26 BoogieIcfgContainer [2021-03-25 04:49:26,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:49:26,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:49:26,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:49:26,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:49:26,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:49:24" (1/3) ... [2021-03-25 04:49:26,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1497f082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:49:26, skipping insertion in model container [2021-03-25 04:49:26,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:49:24" (2/3) ... [2021-03-25 04:49:26,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1497f082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:49:26, skipping insertion in model container [2021-03-25 04:49:26,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:49:26" (3/3) ... [2021-03-25 04:49:26,556 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_rmo.opt.i [2021-03-25 04:49:26,560 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:49:26,564 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:49:26,565 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:49:26,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,596 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,596 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,597 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,598 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,599 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,600 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,601 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,601 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,602 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,602 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,603 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,604 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,606 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,624 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,625 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,625 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,625 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,626 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,627 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,628 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,630 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,635 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,637 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,637 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,639 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,640 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:49:26,640 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:49:26,657 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:49:26,683 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:49:26,683 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:49:26,683 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:49:26,683 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:49:26,683 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:49:26,683 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:49:26,683 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:49:26,683 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:49:26,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-25 04:49:26,742 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-25 04:49:26,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:26,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-25 04:49:26,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-25 04:49:26,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-25 04:49:26,761 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:26,768 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-25 04:49:26,771 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-25 04:49:26,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-25 04:49:26,796 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-25 04:49:26,796 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:26,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2021-03-25 04:49:26,800 INFO L142 LiptonReduction]: Number of co-enabled transitions 2300 [2021-03-25 04:49:27,846 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:49:28,230 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-25 04:49:28,358 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:49:29,398 INFO L154 LiptonReduction]: Checked pairs total: 3631 [2021-03-25 04:49:29,398 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-25 04:49:29,400 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2640 [2021-03-25 04:49:29,414 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 04:49:29,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:29,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:29,419 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 04:49:29,419 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1070938441, now seen corresponding path program 1 times [2021-03-25 04:49:29,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:29,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898079964] [2021-03-25 04:49:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:29,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:29,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:29,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:29,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:29,675 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 04:49:29,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898079964] [2021-03-25 04:49:29,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:29,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:49:29,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017287359] [2021-03-25 04:49:29,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:49:29,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:49:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:49:29,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 184 [2021-03-25 04:49:29,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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 04:49:29,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:29,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 184 [2021-03-25 04:49:29,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:29,748 INFO L129 PetriNetUnfolder]: 9/63 cut-off events. [2021-03-25 04:49:29,748 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:29,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 63 events. 9/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 1 based on Foata normal form. 5/65 useless extension candidates. Maximal degree in co-relation 77. Up to 17 conditions per place. [2021-03-25 04:49:29,751 INFO L132 encePairwiseOnDemand]: 180/184 looper letters, 5 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2021-03-25 04:49:29,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 42 transitions, 110 flow [2021-03-25 04:49:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:49:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:49:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-25 04:49:29,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2021-03-25 04:49:29,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-25 04:49:29,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-25 04:49:29,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:29,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-25 04:49:29,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 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 04:49:29,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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 04:49:29,795 INFO L81 ComplementDD]: Finished complementDD. Result 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 04:49:29,797 INFO L185 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 3 states and 508 transitions. [2021-03-25 04:49:29,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 42 transitions, 110 flow [2021-03-25 04:49:29,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 106 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:49:29,801 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 92 flow [2021-03-25 04:49:29,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-25 04:49:29,803 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-25 04:49:29,803 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:29,803 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-25 04:49:29,803 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 92 flow [2021-03-25 04:49:29,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-25 04:49:29,808 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-25 04:49:29,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:29,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:49:29,809 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-25 04:49:30,525 INFO L154 LiptonReduction]: Checked pairs total: 1559 [2021-03-25 04:49:30,526 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 04:49:30,526 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 723 [2021-03-25 04:49:30,527 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 04:49:30,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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 04:49:30,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:30,527 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 04:49:30,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:49:30,528 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1308224493, now seen corresponding path program 1 times [2021-03-25 04:49:30,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:30,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290926133] [2021-03-25 04:49:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:30,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:30,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:30,686 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:49:30,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:30,703 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:49:30,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:49:30,708 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 04:49:30,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290926133] [2021-03-25 04:49:30,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:30,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:49:30,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932610783] [2021-03-25 04:49:30,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:30,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:30,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 196 [2021-03-25 04:49:30,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 04:49:30,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:30,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 196 [2021-03-25 04:49:30,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:30,852 INFO L129 PetriNetUnfolder]: 303/672 cut-off events. [2021-03-25 04:49:30,852 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:49:30,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 672 events. 303/672 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4166 event pairs, 54 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 1157. Up to 189 conditions per place. [2021-03-25 04:49:30,861 INFO L132 encePairwiseOnDemand]: 187/196 looper letters, 7 selfloop transitions, 7 changer transitions 15/48 dead transitions. [2021-03-25 04:49:30,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 164 flow [2021-03-25 04:49:30,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:49:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:49:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 829 transitions. [2021-03-25 04:49:30,865 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8459183673469388 [2021-03-25 04:49:30,865 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 829 transitions. [2021-03-25 04:49:30,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 829 transitions. [2021-03-25 04:49:30,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:30,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 829 transitions. [2021-03-25 04:49:30,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 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 04:49:30,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 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 04:49:30,871 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 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 04:49:30,871 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 829 transitions. [2021-03-25 04:49:30,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 164 flow [2021-03-25 04:49:30,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:49:30,873 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 128 flow [2021-03-25 04:49:30,873 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-25 04:49:30,877 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2021-03-25 04:49:30,877 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:30,878 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 128 flow [2021-03-25 04:49:30,878 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 128 flow [2021-03-25 04:49:30,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 128 flow [2021-03-25 04:49:30,945 INFO L129 PetriNetUnfolder]: 158/383 cut-off events. [2021-03-25 04:49:30,945 INFO L130 PetriNetUnfolder]: For 138/174 co-relation queries the response was YES. [2021-03-25 04:49:30,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 383 events. 158/383 cut-off events. For 138/174 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2299 event pairs, 54 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 891. Up to 189 conditions per place. [2021-03-25 04:49:30,951 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 04:49:31,612 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:49:31,780 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:49:32,128 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:49:32,260 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:49:32,275 INFO L154 LiptonReduction]: Checked pairs total: 438 [2021-03-25 04:49:32,275 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:49:32,276 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1399 [2021-03-25 04:49:32,276 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 124 flow [2021-03-25 04:49:32,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 04:49:32,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:32,277 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:32,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:49:32,277 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash -265045011, now seen corresponding path program 1 times [2021-03-25 04:49:32,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:32,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954128827] [2021-03-25 04:49:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:32,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:32,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:32,386 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:49:32,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:32,396 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 04:49:32,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954128827] [2021-03-25 04:49:32,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:32,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:49:32,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50316549] [2021-03-25 04:49:32,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:32,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:32,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-25 04:49:32,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 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 04:49:32,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:32,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-25 04:49:32,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:32,470 INFO L129 PetriNetUnfolder]: 133/316 cut-off events. [2021-03-25 04:49:32,470 INFO L130 PetriNetUnfolder]: For 183/740 co-relation queries the response was YES. [2021-03-25 04:49:32,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 316 events. 133/316 cut-off events. For 183/740 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1688 event pairs, 12 based on Foata normal form. 8/303 useless extension candidates. Maximal degree in co-relation 990. Up to 163 conditions per place. [2021-03-25 04:49:32,474 INFO L132 encePairwiseOnDemand]: 190/198 looper letters, 13 selfloop transitions, 11 changer transitions 0/41 dead transitions. [2021-03-25 04:49:32,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 232 flow [2021-03-25 04:49:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 680 transitions. [2021-03-25 04:49:32,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8585858585858586 [2021-03-25 04:49:32,477 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 680 transitions. [2021-03-25 04:49:32,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 680 transitions. [2021-03-25 04:49:32,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:32,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 680 transitions. [2021-03-25 04:49:32,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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 04:49:32,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 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 04:49:32,481 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 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 04:49:32,481 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 124 flow. Second operand 4 states and 680 transitions. [2021-03-25 04:49:32,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 232 flow [2021-03-25 04:49:32,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 186 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-25 04:49:32,486 INFO L241 Difference]: Finished difference. Result has 42 places, 38 transitions, 182 flow [2021-03-25 04:49:32,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2021-03-25 04:49:32,487 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -13 predicate places. [2021-03-25 04:49:32,487 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:32,487 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 182 flow [2021-03-25 04:49:32,488 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 182 flow [2021-03-25 04:49:32,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 182 flow [2021-03-25 04:49:32,518 INFO L129 PetriNetUnfolder]: 133/308 cut-off events. [2021-03-25 04:49:32,518 INFO L130 PetriNetUnfolder]: For 190/296 co-relation queries the response was YES. [2021-03-25 04:49:32,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 308 events. 133/308 cut-off events. For 190/296 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1601 event pairs, 25 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 803. Up to 163 conditions per place. [2021-03-25 04:49:32,522 INFO L142 LiptonReduction]: Number of co-enabled transitions 508 [2021-03-25 04:49:32,529 INFO L154 LiptonReduction]: Checked pairs total: 286 [2021-03-25 04:49:32,530 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:32,530 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-25 04:49:32,535 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 182 flow [2021-03-25 04:49:32,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 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 04:49:32,535 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:32,535 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:32,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:49:32,536 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:32,536 INFO L82 PathProgramCache]: Analyzing trace with hash 442859875, now seen corresponding path program 1 times [2021-03-25 04:49:32,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:32,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806785377] [2021-03-25 04:49:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:32,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:32,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:32,623 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 04:49:32,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806785377] [2021-03-25 04:49:32,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:32,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:49:32,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515820801] [2021-03-25 04:49:32,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:49:32,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:32,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:49:32,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:49:32,625 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-25 04:49:32,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 04:49:32,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:32,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-25 04:49:32,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:32,662 INFO L129 PetriNetUnfolder]: 117/295 cut-off events. [2021-03-25 04:49:32,663 INFO L130 PetriNetUnfolder]: For 326/547 co-relation queries the response was YES. [2021-03-25 04:49:32,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 295 events. 117/295 cut-off events. For 326/547 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1595 event pairs, 30 based on Foata normal form. 4/279 useless extension candidates. Maximal degree in co-relation 817. Up to 143 conditions per place. [2021-03-25 04:49:32,665 INFO L132 encePairwiseOnDemand]: 194/198 looper letters, 7 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2021-03-25 04:49:32,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 236 flow [2021-03-25 04:49:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:49:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:49:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 04:49:32,667 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9006734006734006 [2021-03-25 04:49:32,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 04:49:32,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 04:49:32,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:32,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 04:49:32,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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 04:49:32,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 04:49:32,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 04:49:32,671 INFO L185 Difference]: Start difference. First operand has 42 places, 38 transitions, 182 flow. Second operand 3 states and 535 transitions. [2021-03-25 04:49:32,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 236 flow [2021-03-25 04:49:32,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:49:32,676 INFO L241 Difference]: Finished difference. Result has 45 places, 43 transitions, 240 flow [2021-03-25 04:49:32,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2021-03-25 04:49:32,676 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2021-03-25 04:49:32,676 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:32,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 43 transitions, 240 flow [2021-03-25 04:49:32,677 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 43 transitions, 240 flow [2021-03-25 04:49:32,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 43 transitions, 240 flow [2021-03-25 04:49:32,705 INFO L129 PetriNetUnfolder]: 117/277 cut-off events. [2021-03-25 04:49:32,706 INFO L130 PetriNetUnfolder]: For 270/468 co-relation queries the response was YES. [2021-03-25 04:49:32,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 277 events. 117/277 cut-off events. For 270/468 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1433 event pairs, 15 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 807. Up to 143 conditions per place. [2021-03-25 04:49:32,709 INFO L142 LiptonReduction]: Number of co-enabled transitions 586 [2021-03-25 04:49:32,717 INFO L154 LiptonReduction]: Checked pairs total: 459 [2021-03-25 04:49:32,717 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:32,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 04:49:32,718 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 240 flow [2021-03-25 04:49:32,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 04:49:32,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:32,719 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:32,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:49:32,719 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1468881612, now seen corresponding path program 1 times [2021-03-25 04:49:32,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:32,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995733226] [2021-03-25 04:49:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:32,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:32,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:32,808 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:32,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:32,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:32,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:32,815 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 04:49:32,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995733226] [2021-03-25 04:49:32,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:32,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:49:32,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84755365] [2021-03-25 04:49:32,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:32,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:32,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-25 04:49:32,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 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 04:49:32,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:32,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-25 04:49:32,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:33,040 INFO L129 PetriNetUnfolder]: 894/1669 cut-off events. [2021-03-25 04:49:33,040 INFO L130 PetriNetUnfolder]: For 515/652 co-relation queries the response was YES. [2021-03-25 04:49:33,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1669 events. 894/1669 cut-off events. For 515/652 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 12125 event pairs, 378 based on Foata normal form. 115/1452 useless extension candidates. Maximal degree in co-relation 3806. Up to 1135 conditions per place. [2021-03-25 04:49:33,058 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2021-03-25 04:49:33,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 312 flow [2021-03-25 04:49:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:49:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:49:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-25 04:49:33,061 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424242424242424 [2021-03-25 04:49:33,061 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-25 04:49:33,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-25 04:49:33,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:33,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-25 04:49:33,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 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 04:49:33,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:33,067 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:33,067 INFO L185 Difference]: Start difference. First operand has 45 places, 43 transitions, 240 flow. Second operand 5 states and 834 transitions. [2021-03-25 04:49:33,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 312 flow [2021-03-25 04:49:33,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:49:33,072 INFO L241 Difference]: Finished difference. Result has 51 places, 52 transitions, 309 flow [2021-03-25 04:49:33,072 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2021-03-25 04:49:33,072 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2021-03-25 04:49:33,072 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:33,073 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 309 flow [2021-03-25 04:49:33,073 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 309 flow [2021-03-25 04:49:33,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 309 flow [2021-03-25 04:49:33,215 INFO L129 PetriNetUnfolder]: 725/1414 cut-off events. [2021-03-25 04:49:33,215 INFO L130 PetriNetUnfolder]: For 1321/1677 co-relation queries the response was YES. [2021-03-25 04:49:33,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 1414 events. 725/1414 cut-off events. For 1321/1677 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 10323 event pairs, 284 based on Foata normal form. 13/1281 useless extension candidates. Maximal degree in co-relation 4270. Up to 882 conditions per place. [2021-03-25 04:49:33,240 INFO L142 LiptonReduction]: Number of co-enabled transitions 874 [2021-03-25 04:49:33,306 INFO L154 LiptonReduction]: Checked pairs total: 573 [2021-03-25 04:49:33,306 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:49:33,306 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 234 [2021-03-25 04:49:33,309 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 303 flow [2021-03-25 04:49:33,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 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 04:49:33,310 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:33,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:33,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:49:33,310 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:33,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1110831777, now seen corresponding path program 1 times [2021-03-25 04:49:33,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:33,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40666151] [2021-03-25 04:49:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:33,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:33,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:33,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:33,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:33,370 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 04:49:33,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40666151] [2021-03-25 04:49:33,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:33,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:49:33,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404173449] [2021-03-25 04:49:33,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:49:33,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:49:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:49:33,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-25 04:49:33,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:33,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:33,375 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-25 04:49:33,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:33,523 INFO L129 PetriNetUnfolder]: 832/1573 cut-off events. [2021-03-25 04:49:33,523 INFO L130 PetriNetUnfolder]: For 1930/2342 co-relation queries the response was YES. [2021-03-25 04:49:33,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 1573 events. 832/1573 cut-off events. For 1930/2342 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 11118 event pairs, 397 based on Foata normal form. 51/1447 useless extension candidates. Maximal degree in co-relation 4799. Up to 1077 conditions per place. [2021-03-25 04:49:33,540 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 4 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2021-03-25 04:49:33,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 305 flow [2021-03-25 04:49:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:49:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:49:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-03-25 04:49:33,543 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.898989898989899 [2021-03-25 04:49:33,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-03-25 04:49:33,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-03-25 04:49:33,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:33,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-03-25 04:49:33,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 04:49:33,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 04:49:33,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 04:49:33,546 INFO L185 Difference]: Start difference. First operand has 51 places, 51 transitions, 303 flow. Second operand 3 states and 534 transitions. [2021-03-25 04:49:33,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 305 flow [2021-03-25 04:49:33,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 298 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:49:33,563 INFO L241 Difference]: Finished difference. Result has 50 places, 47 transitions, 301 flow [2021-03-25 04:49:33,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2021-03-25 04:49:33,564 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2021-03-25 04:49:33,564 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:33,564 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 301 flow [2021-03-25 04:49:33,564 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 301 flow [2021-03-25 04:49:33,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 301 flow [2021-03-25 04:49:33,680 INFO L129 PetriNetUnfolder]: 792/1491 cut-off events. [2021-03-25 04:49:33,680 INFO L130 PetriNetUnfolder]: For 1727/2317 co-relation queries the response was YES. [2021-03-25 04:49:33,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4452 conditions, 1491 events. 792/1491 cut-off events. For 1727/2317 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 10732 event pairs, 363 based on Foata normal form. 1/1322 useless extension candidates. Maximal degree in co-relation 4433. Up to 988 conditions per place. [2021-03-25 04:49:33,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 696 [2021-03-25 04:49:33,742 INFO L154 LiptonReduction]: Checked pairs total: 274 [2021-03-25 04:49:33,743 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:33,743 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 179 [2021-03-25 04:49:33,743 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 301 flow [2021-03-25 04:49:33,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:49:33,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:33,744 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:33,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:49:33,744 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1621541819, now seen corresponding path program 1 times [2021-03-25 04:49:33,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:33,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623237847] [2021-03-25 04:49:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:33,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:33,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:33,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:33,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:33,782 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:33,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:33,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:33,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:33,789 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 04:49:33,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623237847] [2021-03-25 04:49:33,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:33,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:49:33,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602005431] [2021-03-25 04:49:33,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:49:33,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:49:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:49:33,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-25 04:49:33,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 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 04:49:33,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:33,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-25 04:49:33,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:34,016 INFO L129 PetriNetUnfolder]: 894/1742 cut-off events. [2021-03-25 04:49:34,016 INFO L130 PetriNetUnfolder]: For 1680/2883 co-relation queries the response was YES. [2021-03-25 04:49:34,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6210 conditions, 1742 events. 894/1742 cut-off events. For 1680/2883 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 12796 event pairs, 115 based on Foata normal form. 267/1820 useless extension candidates. Maximal degree in co-relation 6189. Up to 1245 conditions per place. [2021-03-25 04:49:34,034 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 13 selfloop transitions, 14 changer transitions 0/62 dead transitions. [2021-03-25 04:49:34,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 435 flow [2021-03-25 04:49:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:49:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:49:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2021-03-25 04:49:34,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8425925925925926 [2021-03-25 04:49:34,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1001 transitions. [2021-03-25 04:49:34,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1001 transitions. [2021-03-25 04:49:34,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:34,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1001 transitions. [2021-03-25 04:49:34,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 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 04:49:34,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 04:49:34,042 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 04:49:34,042 INFO L185 Difference]: Start difference. First operand has 50 places, 47 transitions, 301 flow. Second operand 6 states and 1001 transitions. [2021-03-25 04:49:34,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 435 flow [2021-03-25 04:49:34,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 422 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:49:34,048 INFO L241 Difference]: Finished difference. Result has 57 places, 56 transitions, 408 flow [2021-03-25 04:49:34,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2021-03-25 04:49:34,048 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2021-03-25 04:49:34,048 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:34,049 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 56 transitions, 408 flow [2021-03-25 04:49:34,049 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 56 transitions, 408 flow [2021-03-25 04:49:34,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 408 flow [2021-03-25 04:49:34,154 INFO L129 PetriNetUnfolder]: 609/1319 cut-off events. [2021-03-25 04:49:34,155 INFO L130 PetriNetUnfolder]: For 3042/3709 co-relation queries the response was YES. [2021-03-25 04:49:34,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5768 conditions, 1319 events. 609/1319 cut-off events. For 3042/3709 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 10091 event pairs, 106 based on Foata normal form. 37/1288 useless extension candidates. Maximal degree in co-relation 5745. Up to 970 conditions per place. [2021-03-25 04:49:34,174 INFO L142 LiptonReduction]: Number of co-enabled transitions 962 [2021-03-25 04:49:34,349 INFO L154 LiptonReduction]: Checked pairs total: 471 [2021-03-25 04:49:34,349 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:49:34,349 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 301 [2021-03-25 04:49:34,350 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 400 flow [2021-03-25 04:49:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 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 04:49:34,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:34,351 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:34,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:49:34,351 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1858535044, now seen corresponding path program 1 times [2021-03-25 04:49:34,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:34,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396351669] [2021-03-25 04:49:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:34,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,441 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:34,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:34,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:34,453 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 04:49:34,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396351669] [2021-03-25 04:49:34,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:34,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:49:34,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309756597] [2021-03-25 04:49:34,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:49:34,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:49:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:49:34,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-25 04:49:34,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 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 04:49:34,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:34,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-25 04:49:34,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:34,625 INFO L129 PetriNetUnfolder]: 616/1210 cut-off events. [2021-03-25 04:49:34,626 INFO L130 PetriNetUnfolder]: For 2762/4108 co-relation queries the response was YES. [2021-03-25 04:49:34,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 1210 events. 616/1210 cut-off events. For 2762/4108 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 8173 event pairs, 22 based on Foata normal form. 273/1339 useless extension candidates. Maximal degree in co-relation 5696. Up to 840 conditions per place. [2021-03-25 04:49:34,639 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 10 selfloop transitions, 18 changer transitions 4/67 dead transitions. [2021-03-25 04:49:34,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 556 flow [2021-03-25 04:49:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:49:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:49:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1168 transitions. [2021-03-25 04:49:34,643 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8427128427128427 [2021-03-25 04:49:34,643 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1168 transitions. [2021-03-25 04:49:34,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1168 transitions. [2021-03-25 04:49:34,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:34,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1168 transitions. [2021-03-25 04:49:34,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.85714285714286) internal successors, (1168), 7 states have internal predecessors, (1168), 0 states have call successors, (0), 0 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 04:49:34,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 04:49:34,650 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 04:49:34,650 INFO L185 Difference]: Start difference. First operand has 57 places, 55 transitions, 400 flow. Second operand 7 states and 1168 transitions. [2021-03-25 04:49:34,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 556 flow [2021-03-25 04:49:34,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 494 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 04:49:34,669 INFO L241 Difference]: Finished difference. Result has 60 places, 60 transitions, 460 flow [2021-03-25 04:49:34,669 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2021-03-25 04:49:34,669 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 5 predicate places. [2021-03-25 04:49:34,669 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:34,670 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 460 flow [2021-03-25 04:49:34,670 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 60 transitions, 460 flow [2021-03-25 04:49:34,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 460 flow [2021-03-25 04:49:34,727 INFO L129 PetriNetUnfolder]: 311/752 cut-off events. [2021-03-25 04:49:34,728 INFO L130 PetriNetUnfolder]: For 1809/1970 co-relation queries the response was YES. [2021-03-25 04:49:34,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 752 events. 311/752 cut-off events. For 1809/1970 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5189 event pairs, 18 based on Foata normal form. 2/717 useless extension candidates. Maximal degree in co-relation 3233. Up to 481 conditions per place. [2021-03-25 04:49:34,738 INFO L142 LiptonReduction]: Number of co-enabled transitions 908 [2021-03-25 04:49:34,830 INFO L154 LiptonReduction]: Checked pairs total: 468 [2021-03-25 04:49:34,830 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:49:34,830 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 161 [2021-03-25 04:49:34,831 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 450 flow [2021-03-25 04:49:34,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 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 04:49:34,831 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:34,831 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:34,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:49:34,832 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 174855688, now seen corresponding path program 1 times [2021-03-25 04:49:34,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:34,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546611064] [2021-03-25 04:49:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:34,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:34,931 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:49:34,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:49:34,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:34,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:34,947 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 04:49:34,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546611064] [2021-03-25 04:49:34,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:34,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:49:34,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81197970] [2021-03-25 04:49:34,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:49:34,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:49:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:49:34,950 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198 [2021-03-25 04:49:34,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 04:49:34,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:34,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198 [2021-03-25 04:49:34,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:35,108 INFO L129 PetriNetUnfolder]: 523/976 cut-off events. [2021-03-25 04:49:35,108 INFO L130 PetriNetUnfolder]: For 2455/3274 co-relation queries the response was YES. [2021-03-25 04:49:35,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4267 conditions, 976 events. 523/976 cut-off events. For 2455/3274 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 5974 event pairs, 12 based on Foata normal form. 141/978 useless extension candidates. Maximal degree in co-relation 4241. Up to 536 conditions per place. [2021-03-25 04:49:35,118 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 18 changer transitions 11/64 dead transitions. [2021-03-25 04:49:35,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 516 flow [2021-03-25 04:49:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:49:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:49:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1327 transitions. [2021-03-25 04:49:35,122 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8377525252525253 [2021-03-25 04:49:35,122 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1327 transitions. [2021-03-25 04:49:35,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1327 transitions. [2021-03-25 04:49:35,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:35,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1327 transitions. [2021-03-25 04:49:35,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 165.875) internal successors, (1327), 8 states have internal predecessors, (1327), 0 states have call successors, (0), 0 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 04:49:35,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 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 04:49:35,128 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 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 04:49:35,129 INFO L185 Difference]: Start difference. First operand has 60 places, 59 transitions, 450 flow. Second operand 8 states and 1327 transitions. [2021-03-25 04:49:35,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 516 flow [2021-03-25 04:49:35,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 471 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-25 04:49:35,145 INFO L241 Difference]: Finished difference. Result has 64 places, 50 transitions, 365 flow [2021-03-25 04:49:35,145 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=365, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2021-03-25 04:49:35,145 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2021-03-25 04:49:35,145 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:35,146 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 50 transitions, 365 flow [2021-03-25 04:49:35,146 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 50 transitions, 365 flow [2021-03-25 04:49:35,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 365 flow [2021-03-25 04:49:35,170 INFO L129 PetriNetUnfolder]: 117/298 cut-off events. [2021-03-25 04:49:35,170 INFO L130 PetriNetUnfolder]: For 602/660 co-relation queries the response was YES. [2021-03-25 04:49:35,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 298 events. 117/298 cut-off events. For 602/660 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1603 event pairs, 9 based on Foata normal form. 1/281 useless extension candidates. Maximal degree in co-relation 1150. Up to 111 conditions per place. [2021-03-25 04:49:35,175 INFO L142 LiptonReduction]: Number of co-enabled transitions 582 [2021-03-25 04:49:35,480 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:49:35,635 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:49:35,752 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:49:35,981 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:49:36,151 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:49:36,160 INFO L154 LiptonReduction]: Checked pairs total: 430 [2021-03-25 04:49:36,160 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:49:36,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1015 [2021-03-25 04:49:36,161 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 349 flow [2021-03-25 04:49:36,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 04:49:36,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:36,161 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 04:49:36,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:49:36,162 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1367345430, now seen corresponding path program 1 times [2021-03-25 04:49:36,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:36,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356727428] [2021-03-25 04:49:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:36,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:36,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:36,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:36,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:36,229 INFO L142 QuantifierPusher]: treesize reduction 5, result has 58.3 percent of original size [2021-03-25 04:49:36,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:49:36,235 INFO L142 QuantifierPusher]: treesize reduction 5, result has 58.3 percent of original size [2021-03-25 04:49:36,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:49:36,243 INFO L142 QuantifierPusher]: treesize reduction 6, result has 83.8 percent of original size [2021-03-25 04:49:36,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 04:49:36,286 INFO L142 QuantifierPusher]: treesize reduction 8, result has 84.6 percent of original size [2021-03-25 04:49:36,288 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.5 percent of original size 35 [2021-03-25 04:49:36,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:36,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:36,310 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 04:49:36,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356727428] [2021-03-25 04:49:36,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:36,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:49:36,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747872319] [2021-03-25 04:49:36,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:49:36,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:49:36,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:49:36,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 200 [2021-03-25 04:49:36,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 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 04:49:36,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:36,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 200 [2021-03-25 04:49:36,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:36,535 INFO L129 PetriNetUnfolder]: 473/985 cut-off events. [2021-03-25 04:49:36,536 INFO L130 PetriNetUnfolder]: For 4995/5330 co-relation queries the response was YES. [2021-03-25 04:49:36,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 985 events. 473/985 cut-off events. For 4995/5330 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 6398 event pairs, 27 based on Foata normal form. 87/1024 useless extension candidates. Maximal degree in co-relation 3854. Up to 266 conditions per place. [2021-03-25 04:49:36,544 INFO L132 encePairwiseOnDemand]: 190/200 looper letters, 16 selfloop transitions, 19 changer transitions 44/103 dead transitions. [2021-03-25 04:49:36,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 879 flow [2021-03-25 04:49:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:49:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:49:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1432 transitions. [2021-03-25 04:49:36,548 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7955555555555556 [2021-03-25 04:49:36,548 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1432 transitions. [2021-03-25 04:49:36,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1432 transitions. [2021-03-25 04:49:36,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:36,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1432 transitions. [2021-03-25 04:49:36,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 159.11111111111111) internal successors, (1432), 9 states have internal predecessors, (1432), 0 states have call successors, (0), 0 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 04:49:36,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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 04:49:36,556 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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 04:49:36,556 INFO L185 Difference]: Start difference. First operand has 60 places, 47 transitions, 349 flow. Second operand 9 states and 1432 transitions. [2021-03-25 04:49:36,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 879 flow [2021-03-25 04:49:36,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 796 flow, removed 19 selfloop flow, removed 9 redundant places. [2021-03-25 04:49:36,572 INFO L241 Difference]: Finished difference. Result has 67 places, 54 transitions, 430 flow [2021-03-25 04:49:36,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=430, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2021-03-25 04:49:36,573 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2021-03-25 04:49:36,573 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:36,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 54 transitions, 430 flow [2021-03-25 04:49:36,573 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 54 transitions, 430 flow [2021-03-25 04:49:36,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 430 flow [2021-03-25 04:49:36,606 INFO L129 PetriNetUnfolder]: 163/401 cut-off events. [2021-03-25 04:49:36,607 INFO L130 PetriNetUnfolder]: For 1036/1088 co-relation queries the response was YES. [2021-03-25 04:49:36,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 401 events. 163/401 cut-off events. For 1036/1088 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2363 event pairs, 12 based on Foata normal form. 28/408 useless extension candidates. Maximal degree in co-relation 1391. Up to 126 conditions per place. [2021-03-25 04:49:36,612 INFO L142 LiptonReduction]: Number of co-enabled transitions 498 [2021-03-25 04:49:36,773 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-25 04:49:36,774 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:49:36,774 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 201 [2021-03-25 04:49:36,774 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 434 flow [2021-03-25 04:49:36,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 154.57142857142858) internal successors, (1082), 7 states have internal predecessors, (1082), 0 states have call successors, (0), 0 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 04:49:36,775 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:36,775 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 04:49:36,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:49:36,775 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:36,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash -447044943, now seen corresponding path program 1 times [2021-03-25 04:49:36,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:36,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236622288] [2021-03-25 04:49:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:36,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:36,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:36,857 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-25 04:49:36,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:49:36,868 INFO L142 QuantifierPusher]: treesize reduction 16, result has 77.1 percent of original size [2021-03-25 04:49:36,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 04:49:36,892 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 04:49:36,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:49:36,897 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 04:49:36,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236622288] [2021-03-25 04:49:36,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:36,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:49:36,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191355376] [2021-03-25 04:49:36,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:49:36,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:49:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:49:36,899 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 202 [2021-03-25 04:49:36,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 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 04:49:36,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:36,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 202 [2021-03-25 04:49:36,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:37,003 INFO L129 PetriNetUnfolder]: 291/685 cut-off events. [2021-03-25 04:49:37,003 INFO L130 PetriNetUnfolder]: For 2090/2190 co-relation queries the response was YES. [2021-03-25 04:49:37,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 685 events. 291/685 cut-off events. For 2090/2190 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 4737 event pairs, 12 based on Foata normal form. 53/702 useless extension candidates. Maximal degree in co-relation 2377. Up to 224 conditions per place. [2021-03-25 04:49:37,008 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 3 selfloop transitions, 10 changer transitions 2/60 dead transitions. [2021-03-25 04:49:37,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 510 flow [2021-03-25 04:49:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:49:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:49:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2021-03-25 04:49:37,010 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7673267326732673 [2021-03-25 04:49:37,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2021-03-25 04:49:37,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2021-03-25 04:49:37,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:37,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2021-03-25 04:49:37,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 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 04:49:37,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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 04:49:37,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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 04:49:37,015 INFO L185 Difference]: Start difference. First operand has 64 places, 54 transitions, 434 flow. Second operand 5 states and 775 transitions. [2021-03-25 04:49:37,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 510 flow [2021-03-25 04:49:37,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 484 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-25 04:49:37,029 INFO L241 Difference]: Finished difference. Result has 65 places, 58 transitions, 470 flow [2021-03-25 04:49:37,029 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=470, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2021-03-25 04:49:37,029 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2021-03-25 04:49:37,029 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:37,029 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 58 transitions, 470 flow [2021-03-25 04:49:37,029 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 470 flow [2021-03-25 04:49:37,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 470 flow [2021-03-25 04:49:37,070 INFO L129 PetriNetUnfolder]: 213/493 cut-off events. [2021-03-25 04:49:37,070 INFO L130 PetriNetUnfolder]: For 1094/1148 co-relation queries the response was YES. [2021-03-25 04:49:37,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 493 events. 213/493 cut-off events. For 1094/1148 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 3105 event pairs, 8 based on Foata normal form. 21/486 useless extension candidates. Maximal degree in co-relation 1710. Up to 156 conditions per place. [2021-03-25 04:49:37,076 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-25 04:49:37,086 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:49:37,086 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:49:37,086 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-25 04:49:37,086 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 470 flow [2021-03-25 04:49:37,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 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 04:49:37,087 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:37,087 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:37,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:49:37,087 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:37,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1669391874, now seen corresponding path program 1 times [2021-03-25 04:49:37,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:37,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811163744] [2021-03-25 04:49:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:49:37,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:37,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:49:37,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:49:37,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:49:37,142 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-25 04:49:37,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 04:49:37,153 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 04:49:37,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811163744] [2021-03-25 04:49:37,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:49:37,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:49:37,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471968207] [2021-03-25 04:49:37,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:49:37,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:49:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:49:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:49:37,155 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-25 04:49:37,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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 04:49:37,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:49:37,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-25 04:49:37,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:49:37,261 INFO L129 PetriNetUnfolder]: 247/566 cut-off events. [2021-03-25 04:49:37,261 INFO L130 PetriNetUnfolder]: For 1334/1385 co-relation queries the response was YES. [2021-03-25 04:49:37,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 566 events. 247/566 cut-off events. For 1334/1385 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 3726 event pairs, 8 based on Foata normal form. 26/556 useless extension candidates. Maximal degree in co-relation 2042. Up to 184 conditions per place. [2021-03-25 04:49:37,265 INFO L132 encePairwiseOnDemand]: 192/202 looper letters, 3 selfloop transitions, 6 changer transitions 29/64 dead transitions. [2021-03-25 04:49:37,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 608 flow [2021-03-25 04:49:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:49:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:49:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2021-03-25 04:49:37,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391089108910891 [2021-03-25 04:49:37,267 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2021-03-25 04:49:37,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2021-03-25 04:49:37,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:49:37,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2021-03-25 04:49:37,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 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 04:49:37,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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 04:49:37,271 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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 04:49:37,271 INFO L185 Difference]: Start difference. First operand has 65 places, 58 transitions, 470 flow. Second operand 4 states and 678 transitions. [2021-03-25 04:49:37,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 608 flow [2021-03-25 04:49:37,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 600 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:49:37,282 INFO L241 Difference]: Finished difference. Result has 68 places, 35 transitions, 246 flow [2021-03-25 04:49:37,282 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=35} [2021-03-25 04:49:37,282 INFO L343 CegarLoopForPetriNet]: 55 programPoint places, 13 predicate places. [2021-03-25 04:49:37,282 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:49:37,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 35 transitions, 246 flow [2021-03-25 04:49:37,283 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 35 transitions, 246 flow [2021-03-25 04:49:37,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 35 transitions, 246 flow [2021-03-25 04:49:37,291 INFO L129 PetriNetUnfolder]: 33/79 cut-off events. [2021-03-25 04:49:37,292 INFO L130 PetriNetUnfolder]: For 185/197 co-relation queries the response was YES. [2021-03-25 04:49:37,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 79 events. 33/79 cut-off events. For 185/197 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 205 event pairs, 0 based on Foata normal form. 3/76 useless extension candidates. Maximal degree in co-relation 243. Up to 26 conditions per place. [2021-03-25 04:49:37,293 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-25 04:49:37,957 WARN L205 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 04:49:38,222 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 04:49:39,488 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 04:49:40,063 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 04:49:40,624 WARN L205 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 04:49:40,891 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:49:42,104 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 04:49:42,636 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:49:42,759 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2021-03-25 04:49:43,047 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-03-25 04:49:43,132 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-25 04:49:43,132 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:49:43,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5850 [2021-03-25 04:49:43,132 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 34 transitions, 259 flow [2021-03-25 04:49:43,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 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 04:49:43,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:49:43,133 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:49:43,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:49:43,133 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:49:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:49:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash 317246780, now seen corresponding path program 2 times [2021-03-25 04:49:43,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:49:43,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545429412] [2021-03-25 04:49:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:49:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:49:43,160 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:49:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:49:43,193 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:49:43,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:49:43,232 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:49:43,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:49:43,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:49:43 BasicIcfg [2021-03-25 04:49:43,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:49:43,339 INFO L168 Benchmark]: Toolchain (without parser) took 18927.07 ms. Allocated memory was 337.6 MB in the beginning and 629.1 MB in the end (delta: 291.5 MB). Free memory was 300.7 MB in the beginning and 537.9 MB in the end (delta: -237.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:43,340 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 337.6 MB. Free memory was 319.0 MB in the beginning and 319.0 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:49:43,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.53 ms. Allocated memory is still 337.6 MB. Free memory was 300.5 MB in the beginning and 296.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:43,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 294.2 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:49:43,340 INFO L168 Benchmark]: Boogie Preprocessor took 29.37 ms. Allocated memory is still 337.6 MB. Free memory was 294.2 MB in the beginning and 292.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:43,340 INFO L168 Benchmark]: RCFGBuilder took 1543.45 ms. Allocated memory is still 337.6 MB. Free memory was 292.2 MB in the beginning and 259.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 131.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:43,341 INFO L168 Benchmark]: TraceAbstraction took 16788.55 ms. Allocated memory was 337.6 MB in the beginning and 629.1 MB in the end (delta: 291.5 MB). Free memory was 259.6 MB in the beginning and 537.9 MB in the end (delta: -278.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:49:43,342 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.53 ms. Allocated memory is still 337.6 MB. Free memory was 319.0 MB in the beginning and 319.0 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 516.53 ms. Allocated memory is still 337.6 MB. Free memory was 300.5 MB in the beginning and 296.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 294.2 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.37 ms. Allocated memory is still 337.6 MB. Free memory was 294.2 MB in the beginning and 292.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1543.45 ms. Allocated memory is still 337.6 MB. Free memory was 292.2 MB in the beginning and 259.6 MB in the end (delta: 32.6 MB). Peak memory consumption was 131.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16788.55 ms. Allocated memory was 337.6 MB in the beginning and 629.1 MB in the end (delta: 291.5 MB). Free memory was 259.6 MB in the beginning and 537.9 MB in the end (delta: -278.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2627.6ms, 119 PlacesBefore, 55 PlacesAfterwards, 108 TransitionsBefore, 43 TransitionsAfterwards, 2300 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3631 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1730, positive: 1651, positive conditional: 0, positive unconditional: 1651, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1098, positive: 1068, positive conditional: 0, positive unconditional: 1068, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1098, positive: 1068, positive conditional: 0, positive unconditional: 1068, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1730, positive: 583, positive conditional: 0, positive unconditional: 583, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 1098, unknown conditional: 0, unknown unconditional: 1098] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 722.6ms, 51 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 459, positive: 374, positive conditional: 0, positive unconditional: 374, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 56, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 459, positive: 328, positive conditional: 0, positive unconditional: 328, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1397.5ms, 46 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 51, positive conditional: 0, positive unconditional: 51, 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: 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: 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] , Cache Queries: [ total: 72, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 286 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 40, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 459 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 55, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 233.4ms, 51 PlacesBefore, 51 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 874 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 573 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 49, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 178.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 300.1ms, 57 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 471 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 39, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 160.5ms, 60 PlacesBefore, 60 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 36, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1014.3ms, 64 PlacesBefore, 60 PlacesAfterwards, 50 TransitionsBefore, 47 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 200.2ms, 67 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 28, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.3ms, 65 PlacesBefore, 65 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5849.2ms, 68 PlacesBefore, 64 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 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] , Cache Queries: [ total: 37, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1429; [L845] FCALL, FORK 0 pthread_create(&t1429, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1430; [L847] FCALL, FORK 0 pthread_create(&t1430, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1431; [L849] FCALL, FORK 0 pthread_create(&t1431, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1432; [L851] FCALL, FORK 0 pthread_create(&t1432, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 12.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16551.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2056.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2721.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 99 SDtfs, 69 SDslu, 84 SDs, 0 SdLazy, 297 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 297.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 274.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=11, InterpolantAutomatonStates: 62, 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: 37.9ms SsaConstructionTime, 377.2ms SatisfiabilityAnalysisTime, 868.5ms InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...