/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:16:57,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:16:57,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:16:57,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:16:57,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:16:57,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:16:57,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:16:57,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:16:57,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:16:57,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:16:57,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:16:57,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:16:57,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:16:57,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:16:57,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:16:57,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:16:57,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:16:57,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:16:57,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:16:57,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:16:57,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:16:57,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:16:57,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:16:57,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:16:57,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:16:57,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:16:57,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:16:57,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:16:57,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:16:57,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:16:57,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:16:57,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:16:57,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:16:57,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:16:57,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:16:57,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:16:57,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:16:57,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:16:57,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:16:57,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:16:57,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:16:57,971 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-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:16:58,021 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:16:58,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:16:58,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:16:58,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:16:58,028 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:16:58,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:16:58,029 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:16:58,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:16:58,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:16:58,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:16:58,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:16:58,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:16:58,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:16:58,032 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:16:58,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:16:58,032 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:16:58,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:16:58,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:16:58,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:16:58,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:16:58,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:16:58,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:16:58,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:16:58,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:16:58,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:16:58,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:16:58,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:16:58,035 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:16:58,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:16:58,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:16:58,036 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-04-29 00:16:58,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:16:58,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:16:58,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:16:58,511 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:16:58,512 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:16:58,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2021-04-29 00:16:58,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706ae30fb/71f29838c12b4eeeb88cedd1d987c651/FLAG46e2bc1d5 [2021-04-29 00:16:59,510 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:16:59,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2021-04-29 00:16:59,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706ae30fb/71f29838c12b4eeeb88cedd1d987c651/FLAG46e2bc1d5 [2021-04-29 00:16:59,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706ae30fb/71f29838c12b4eeeb88cedd1d987c651 [2021-04-29 00:16:59,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:16:59,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:16:59,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:16:59,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:16:59,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:16:59,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:16:59" (1/1) ... [2021-04-29 00:16:59,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3229e891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:16:59, skipping insertion in model container [2021-04-29 00:16:59,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:16:59" (1/1) ... [2021-04-29 00:16:59,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:16:59,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:16:59,995 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/safe021_power.oepc.i[952,965] [2021-04-29 00:17:00,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:17:00,255 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:17:00,272 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/safe021_power.oepc.i[952,965] [2021-04-29 00:17:00,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:17:00,532 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:17:00,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00 WrapperNode [2021-04-29 00:17:00,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:17:00,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:17:00,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:17:00,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:17:00,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:17:00,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:17:00,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:17:00,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:17:00,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (1/1) ... [2021-04-29 00:17:00,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:17:00,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:17:00,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:17:00,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:17:00,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (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-04-29 00:17:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:17:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:17:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:17:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:17:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:17:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:17:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:17:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:17:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-29 00:17:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-29 00:17:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:17:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:17:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:17:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:17:00,825 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:17:03,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:17:03,279 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:17:03,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:17:03 BoogieIcfgContainer [2021-04-29 00:17:03,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:17:03,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:17:03,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:17:03,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:17:03,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:16:59" (1/3) ... [2021-04-29 00:17:03,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663dc32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:17:03, skipping insertion in model container [2021-04-29 00:17:03,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:17:00" (2/3) ... [2021-04-29 00:17:03,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663dc32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:17:03, skipping insertion in model container [2021-04-29 00:17:03,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:17:03" (3/3) ... [2021-04-29 00:17:03,291 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2021-04-29 00:17:03,299 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:17:03,304 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:17:03,306 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:17:03,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,349 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,349 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,350 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,350 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,350 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,364 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,388 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,390 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,397 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,397 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,397 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:17:03,402 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:17:03,427 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-29 00:17:03,455 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:17:03,455 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:17:03,455 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:17:03,455 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:17:03,455 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:17:03,456 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:17:03,456 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:17:03,456 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:17:03,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-04-29 00:17:03,521 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-04-29 00:17:03,521 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:03,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-29 00:17:03,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-04-29 00:17:03,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-04-29 00:17:03,536 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:03,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-04-29 00:17:03,559 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-04-29 00:17:03,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-04-29 00:17:03,587 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-04-29 00:17:03,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:03,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-29 00:17:03,593 INFO L146 LiptonReduction]: Number of co-enabled transitions 1694 [2021-04-29 00:17:07,022 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:17:07,136 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:17:07,769 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2021-04-29 00:17:08,021 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-04-29 00:17:16,122 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-04-29 00:17:21,531 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:17:21,643 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:21,755 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:17:22,561 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:17:22,763 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:17:24,076 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2021-04-29 00:17:25,434 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:25,605 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:25,779 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:25,937 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:26,075 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:17:26,232 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:17:26,421 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:17:26,568 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:17:27,106 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:27,281 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:27,453 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:27,623 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:27,793 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:17:27,967 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:17:28,140 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:17:28,306 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:17:28,465 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:17:28,617 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:17:28,772 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:17:28,970 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:17:29,150 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:17:29,334 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:17:29,516 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:17:29,698 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:17:29,882 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:30,052 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:30,227 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:30,401 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:30,546 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:17:30,684 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:17:30,825 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:17:30,964 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:17:31,085 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:17:31,207 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:17:31,328 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:17:31,450 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:17:31,920 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-04-29 00:17:32,121 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-04-29 00:17:32,556 WARN L205 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-04-29 00:17:32,760 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-04-29 00:17:33,246 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:17:33,355 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:17:33,470 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:17:33,578 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:17:33,685 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:33,788 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:33,900 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:34,010 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:34,153 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:17:34,302 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:17:34,453 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:17:34,601 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:17:34,709 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:34,818 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:34,928 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:35,067 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:17:35,236 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:35,410 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:35,588 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:35,760 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:17:36,217 WARN L205 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-04-29 00:17:36,427 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-04-29 00:17:36,882 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-04-29 00:17:37,097 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-04-29 00:17:37,225 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:17:37,357 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:17:37,478 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:17:37,606 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:17:37,724 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:17:37,839 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:17:37,953 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:17:38,097 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:17:38,145 INFO L158 LiptonReduction]: Checked pairs total: 15493 [2021-04-29 00:17:38,146 INFO L160 LiptonReduction]: Total number of compositions: 232 [2021-04-29 00:17:38,151 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34617 [2021-04-29 00:17:38,171 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-04-29 00:17:38,171 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:38,172 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:38,172 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-04-29 00:17:38,173 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:38,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1203080, now seen corresponding path program 1 times [2021-04-29 00:17:38,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:38,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493229560] [2021-04-29 00:17:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:38,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:38,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:38,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493229560] [2021-04-29 00:17:38,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:38,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:17:38,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379256356] [2021-04-29 00:17:38,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:17:38,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:17:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:17:38,503 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 330 [2021-04-29 00:17:38,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:38,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:38,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 330 [2021-04-29 00:17:38,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:38,687 INFO L129 PetriNetUnfolder]: 49/430 cut-off events. [2021-04-29 00:17:38,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:38,691 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 430 events. 49/430 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3453 event pairs, 38 based on Foata normal form. 35/159 useless extension candidates. Maximal degree in co-relation 469. Up to 65 conditions per place. [2021-04-29 00:17:38,694 INFO L132 encePairwiseOnDemand]: 315/330 looper letters, 9 selfloop transitions, 2 changer transitions 49/118 dead transitions. [2021-04-29 00:17:38,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 285 flow [2021-04-29 00:17:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:17:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:17:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2021-04-29 00:17:38,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2021-04-29 00:17:38,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2021-04-29 00:17:38,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2021-04-29 00:17:38,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:38,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2021-04-29 00:17:38,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:38,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:38,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:38,756 INFO L185 Difference]: Start difference. First operand has 127 places, 118 transitions, 245 flow. Second operand 3 states and 840 transitions. [2021-04-29 00:17:38,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 285 flow [2021-04-29 00:17:38,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 282 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 00:17:38,764 INFO L241 Difference]: Finished difference. Result has 123 places, 65 transitions, 140 flow [2021-04-29 00:17:38,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=123, PETRI_TRANSITIONS=65} [2021-04-29 00:17:38,767 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -4 predicate places. [2021-04-29 00:17:38,768 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:38,768 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 65 transitions, 140 flow [2021-04-29 00:17:38,768 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 65 transitions, 140 flow [2021-04-29 00:17:38,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 65 transitions, 140 flow [2021-04-29 00:17:38,778 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2021-04-29 00:17:38,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:38,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 65 events. 0/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 329 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:17:38,780 INFO L146 LiptonReduction]: Number of co-enabled transitions 1946 [2021-04-29 00:17:38,986 INFO L158 LiptonReduction]: Checked pairs total: 2580 [2021-04-29 00:17:38,986 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:38,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 218 [2021-04-29 00:17:38,989 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 140 flow [2021-04-29 00:17:38,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:38,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:38,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:38,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:17:38,991 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1636878471, now seen corresponding path program 1 times [2021-04-29 00:17:38,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:38,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56795844] [2021-04-29 00:17:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:39,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:39,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:39,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56795844] [2021-04-29 00:17:39,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:39,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:17:39,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808309941] [2021-04-29 00:17:39,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:17:39,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:17:39,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:17:39,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 330 [2021-04-29 00:17:39,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:39,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 330 [2021-04-29 00:17:39,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:39,231 INFO L129 PetriNetUnfolder]: 95/363 cut-off events. [2021-04-29 00:17:39,231 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:39,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 363 events. 95/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 2642 event pairs, 25 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 561. Up to 174 conditions per place. [2021-04-29 00:17:39,234 INFO L132 encePairwiseOnDemand]: 324/330 looper letters, 3 selfloop transitions, 3 changer transitions 46/89 dead transitions. [2021-04-29 00:17:39,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 292 flow [2021-04-29 00:17:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:17:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:17:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 756 transitions. [2021-04-29 00:17:39,238 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2021-04-29 00:17:39,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 756 transitions. [2021-04-29 00:17:39,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 756 transitions. [2021-04-29 00:17:39,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:39,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 756 transitions. [2021-04-29 00:17:39,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,247 INFO L185 Difference]: Start difference. First operand has 74 places, 65 transitions, 140 flow. Second operand 3 states and 756 transitions. [2021-04-29 00:17:39,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 292 flow [2021-04-29 00:17:39,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:17:39,250 INFO L241 Difference]: Finished difference. Result has 75 places, 43 transitions, 107 flow [2021-04-29 00:17:39,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=75, PETRI_TRANSITIONS=43} [2021-04-29 00:17:39,251 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -52 predicate places. [2021-04-29 00:17:39,251 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:39,251 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 43 transitions, 107 flow [2021-04-29 00:17:39,251 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 43 transitions, 107 flow [2021-04-29 00:17:39,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 107 flow [2021-04-29 00:17:39,260 INFO L129 PetriNetUnfolder]: 3/57 cut-off events. [2021-04-29 00:17:39,260 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:17:39,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 57 events. 3/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 222 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2021-04-29 00:17:39,262 INFO L146 LiptonReduction]: Number of co-enabled transitions 1020 [2021-04-29 00:17:39,383 INFO L158 LiptonReduction]: Checked pairs total: 845 [2021-04-29 00:17:39,383 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:39,383 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-04-29 00:17:39,385 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 107 flow [2021-04-29 00:17:39,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,386 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:39,386 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:39,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:17:39,387 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1683202583, now seen corresponding path program 1 times [2021-04-29 00:17:39,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:39,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425420960] [2021-04-29 00:17:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:39,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:39,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:39,479 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-04-29 00:17:39,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:17:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:39,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425420960] [2021-04-29 00:17:39,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:39,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:17:39,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601427761] [2021-04-29 00:17:39,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:17:39,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:17:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:17:39,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 330 [2021-04-29 00:17:39,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:39,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 330 [2021-04-29 00:17:39,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:39,555 INFO L129 PetriNetUnfolder]: 15/127 cut-off events. [2021-04-29 00:17:39,555 INFO L130 PetriNetUnfolder]: For 22/41 co-relation queries the response was YES. [2021-04-29 00:17:39,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 127 events. 15/127 cut-off events. For 22/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 647 event pairs, 3 based on Foata normal form. 5/86 useless extension candidates. Maximal degree in co-relation 197. Up to 29 conditions per place. [2021-04-29 00:17:39,557 INFO L132 encePairwiseOnDemand]: 324/330 looper letters, 8 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2021-04-29 00:17:39,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 159 flow [2021-04-29 00:17:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:17:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:17:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2021-04-29 00:17:39,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6575757575757576 [2021-04-29 00:17:39,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 868 transitions. [2021-04-29 00:17:39,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions. [2021-04-29 00:17:39,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:39,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions. [2021-04-29 00:17:39,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,574 INFO L185 Difference]: Start difference. First operand has 51 places, 43 transitions, 107 flow. Second operand 4 states and 868 transitions. [2021-04-29 00:17:39,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 159 flow [2021-04-29 00:17:39,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:17:39,579 INFO L241 Difference]: Finished difference. Result has 56 places, 47 transitions, 154 flow [2021-04-29 00:17:39,579 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2021-04-29 00:17:39,579 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -71 predicate places. [2021-04-29 00:17:39,580 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:39,580 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 47 transitions, 154 flow [2021-04-29 00:17:39,581 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 47 transitions, 154 flow [2021-04-29 00:17:39,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 154 flow [2021-04-29 00:17:39,611 INFO L129 PetriNetUnfolder]: 13/131 cut-off events. [2021-04-29 00:17:39,611 INFO L130 PetriNetUnfolder]: For 41/49 co-relation queries the response was YES. [2021-04-29 00:17:39,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 131 events. 13/131 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 713 event pairs, 6 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 208. Up to 24 conditions per place. [2021-04-29 00:17:39,615 INFO L146 LiptonReduction]: Number of co-enabled transitions 1140 [2021-04-29 00:17:39,778 INFO L158 LiptonReduction]: Checked pairs total: 843 [2021-04-29 00:17:39,778 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:39,778 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 198 [2021-04-29 00:17:39,780 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 154 flow [2021-04-29 00:17:39,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 214.75) internal successors, (859), 4 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,781 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:39,781 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:39,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:17:39,782 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash -639674380, now seen corresponding path program 1 times [2021-04-29 00:17:39,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:39,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455004789] [2021-04-29 00:17:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:39,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:39,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:39,852 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-04-29 00:17:39,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:17:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:39,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455004789] [2021-04-29 00:17:39,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:39,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:17:39,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960033703] [2021-04-29 00:17:39,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:17:39,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:17:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:17:39,865 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 330 [2021-04-29 00:17:39,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:39,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 330 [2021-04-29 00:17:39,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:39,939 INFO L129 PetriNetUnfolder]: 35/200 cut-off events. [2021-04-29 00:17:39,939 INFO L130 PetriNetUnfolder]: For 142/210 co-relation queries the response was YES. [2021-04-29 00:17:39,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 200 events. 35/200 cut-off events. For 142/210 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1162 event pairs, 2 based on Foata normal form. 7/144 useless extension candidates. Maximal degree in co-relation 405. Up to 35 conditions per place. [2021-04-29 00:17:39,942 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 12 selfloop transitions, 17 changer transitions 0/63 dead transitions. [2021-04-29 00:17:39,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 306 flow [2021-04-29 00:17:39,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:17:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:17:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1081 transitions. [2021-04-29 00:17:39,947 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6551515151515152 [2021-04-29 00:17:39,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1081 transitions. [2021-04-29 00:17:39,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1081 transitions. [2021-04-29 00:17:39,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:39,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1081 transitions. [2021-04-29 00:17:39,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 216.2) internal successors, (1081), 5 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,958 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:39,958 INFO L185 Difference]: Start difference. First operand has 56 places, 47 transitions, 154 flow. Second operand 5 states and 1081 transitions. [2021-04-29 00:17:39,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 306 flow [2021-04-29 00:17:39,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 299 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-04-29 00:17:39,963 INFO L241 Difference]: Finished difference. Result has 63 places, 59 transitions, 306 flow [2021-04-29 00:17:39,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2021-04-29 00:17:39,964 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -64 predicate places. [2021-04-29 00:17:39,964 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:39,964 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 306 flow [2021-04-29 00:17:39,965 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 59 transitions, 306 flow [2021-04-29 00:17:39,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 306 flow [2021-04-29 00:17:39,997 INFO L129 PetriNetUnfolder]: 25/191 cut-off events. [2021-04-29 00:17:39,997 INFO L130 PetriNetUnfolder]: For 158/169 co-relation queries the response was YES. [2021-04-29 00:17:39,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 191 events. 25/191 cut-off events. For 158/169 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1183 event pairs, 1 based on Foata normal form. 3/129 useless extension candidates. Maximal degree in co-relation 422. Up to 32 conditions per place. [2021-04-29 00:17:40,003 INFO L146 LiptonReduction]: Number of co-enabled transitions 1530 [2021-04-29 00:17:40,052 INFO L158 LiptonReduction]: Checked pairs total: 1055 [2021-04-29 00:17:40,053 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:40,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-04-29 00:17:40,054 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 306 flow [2021-04-29 00:17:40,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,055 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:40,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:40,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:17:40,056 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1019833034, now seen corresponding path program 2 times [2021-04-29 00:17:40,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:40,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080718940] [2021-04-29 00:17:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:40,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:40,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:40,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:40,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:40,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080718940] [2021-04-29 00:17:40,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:40,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:17:40,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336392064] [2021-04-29 00:17:40,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:17:40,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:17:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:17:40,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 330 [2021-04-29 00:17:40,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 222.75) internal successors, (891), 4 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:40,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 330 [2021-04-29 00:17:40,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:40,211 INFO L129 PetriNetUnfolder]: 21/201 cut-off events. [2021-04-29 00:17:40,211 INFO L130 PetriNetUnfolder]: For 329/392 co-relation queries the response was YES. [2021-04-29 00:17:40,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 201 events. 21/201 cut-off events. For 329/392 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1300 event pairs, 2 based on Foata normal form. 10/140 useless extension candidates. Maximal degree in co-relation 448. Up to 29 conditions per place. [2021-04-29 00:17:40,213 INFO L132 encePairwiseOnDemand]: 326/330 looper letters, 1 selfloop transitions, 5 changer transitions 13/60 dead transitions. [2021-04-29 00:17:40,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 331 flow [2021-04-29 00:17:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:17:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:17:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 895 transitions. [2021-04-29 00:17:40,217 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.678030303030303 [2021-04-29 00:17:40,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 895 transitions. [2021-04-29 00:17:40,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 895 transitions. [2021-04-29 00:17:40,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:40,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 895 transitions. [2021-04-29 00:17:40,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 223.75) internal successors, (895), 4 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,227 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,227 INFO L185 Difference]: Start difference. First operand has 63 places, 59 transitions, 306 flow. Second operand 4 states and 895 transitions. [2021-04-29 00:17:40,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 331 flow [2021-04-29 00:17:40,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-29 00:17:40,233 INFO L241 Difference]: Finished difference. Result has 68 places, 47 transitions, 220 flow [2021-04-29 00:17:40,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2021-04-29 00:17:40,233 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -59 predicate places. [2021-04-29 00:17:40,233 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:40,233 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 47 transitions, 220 flow [2021-04-29 00:17:40,234 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 47 transitions, 220 flow [2021-04-29 00:17:40,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 47 transitions, 220 flow [2021-04-29 00:17:40,250 INFO L129 PetriNetUnfolder]: 6/99 cut-off events. [2021-04-29 00:17:40,250 INFO L130 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2021-04-29 00:17:40,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 99 events. 6/99 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 465 event pairs, 2 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 216. Up to 14 conditions per place. [2021-04-29 00:17:40,253 INFO L146 LiptonReduction]: Number of co-enabled transitions 1076 [2021-04-29 00:17:40,257 INFO L158 LiptonReduction]: Checked pairs total: 745 [2021-04-29 00:17:40,257 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:40,257 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-04-29 00:17:40,258 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 220 flow [2021-04-29 00:17:40,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 222.75) internal successors, (891), 4 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,259 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:40,260 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:40,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:17:40,260 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -814131672, now seen corresponding path program 1 times [2021-04-29 00:17:40,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:40,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701234460] [2021-04-29 00:17:40,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:40,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:40,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:40,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:40,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:17:40,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:40,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:17:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:40,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701234460] [2021-04-29 00:17:40,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:40,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:17:40,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013020823] [2021-04-29 00:17:40,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:17:40,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:17:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:17:40,341 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 330 [2021-04-29 00:17:40,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:40,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:40,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 330 [2021-04-29 00:17:40,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:41,375 INFO L129 PetriNetUnfolder]: 4047/6570 cut-off events. [2021-04-29 00:17:41,375 INFO L130 PetriNetUnfolder]: For 2190/2328 co-relation queries the response was YES. [2021-04-29 00:17:41,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13824 conditions, 6570 events. 4047/6570 cut-off events. For 2190/2328 co-relation queries the response was YES. Maximal size of possible extension queue 1506. Compared 55389 event pairs, 1863 based on Foata normal form. 154/2010 useless extension candidates. Maximal degree in co-relation 13801. Up to 4222 conditions per place. [2021-04-29 00:17:41,424 INFO L132 encePairwiseOnDemand]: 313/330 looper letters, 24 selfloop transitions, 23 changer transitions 6/81 dead transitions. [2021-04-29 00:17:41,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 394 flow [2021-04-29 00:17:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:17:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:17:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1209 transitions. [2021-04-29 00:17:41,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7327272727272728 [2021-04-29 00:17:41,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1209 transitions. [2021-04-29 00:17:41,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1209 transitions. [2021-04-29 00:17:41,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:41,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1209 transitions. [2021-04-29 00:17:41,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 241.8) internal successors, (1209), 5 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:41,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:41,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:41,440 INFO L185 Difference]: Start difference. First operand has 67 places, 47 transitions, 220 flow. Second operand 5 states and 1209 transitions. [2021-04-29 00:17:41,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 394 flow [2021-04-29 00:17:41,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 357 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-04-29 00:17:41,447 INFO L241 Difference]: Finished difference. Result has 68 places, 68 transitions, 358 flow [2021-04-29 00:17:41,447 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2021-04-29 00:17:41,447 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -59 predicate places. [2021-04-29 00:17:41,447 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:41,448 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 68 transitions, 358 flow [2021-04-29 00:17:41,448 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 68 transitions, 358 flow [2021-04-29 00:17:41,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 68 transitions, 358 flow [2021-04-29 00:17:42,053 INFO L129 PetriNetUnfolder]: 3324/5657 cut-off events. [2021-04-29 00:17:42,053 INFO L130 PetriNetUnfolder]: For 1939/5535 co-relation queries the response was YES. [2021-04-29 00:17:42,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16241 conditions, 5657 events. 3324/5657 cut-off events. For 1939/5535 co-relation queries the response was YES. Maximal size of possible extension queue 1368. Compared 49544 event pairs, 1717 based on Foata normal form. 3/1719 useless extension candidates. Maximal degree in co-relation 16221. Up to 5176 conditions per place. [2021-04-29 00:17:42,150 INFO L146 LiptonReduction]: Number of co-enabled transitions 1424 [2021-04-29 00:17:42,427 INFO L158 LiptonReduction]: Checked pairs total: 1303 [2021-04-29 00:17:42,427 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:42,427 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 980 [2021-04-29 00:17:42,428 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 358 flow [2021-04-29 00:17:42,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:42,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:42,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:42,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:17:42,429 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1288938338, now seen corresponding path program 1 times [2021-04-29 00:17:42,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:42,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618105281] [2021-04-29 00:17:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:42,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:42,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:42,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:42,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:42,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:42,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:17:42,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:42,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:17:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:42,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618105281] [2021-04-29 00:17:42,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:42,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:17:42,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998595652] [2021-04-29 00:17:42,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:17:42,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:17:42,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:17:42,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 330 [2021-04-29 00:17:42,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 231.8) internal successors, (1159), 5 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:42,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:42,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 330 [2021-04-29 00:17:42,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:43,599 INFO L129 PetriNetUnfolder]: 3633/6642 cut-off events. [2021-04-29 00:17:43,600 INFO L130 PetriNetUnfolder]: For 3230/18599 co-relation queries the response was YES. [2021-04-29 00:17:43,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25271 conditions, 6642 events. 3633/6642 cut-off events. For 3230/18599 co-relation queries the response was YES. Maximal size of possible extension queue 1809. Compared 61082 event pairs, 414 based on Foata normal form. 203/2399 useless extension candidates. Maximal degree in co-relation 25249. Up to 5938 conditions per place. [2021-04-29 00:17:43,653 INFO L132 encePairwiseOnDemand]: 313/330 looper letters, 19 selfloop transitions, 44 changer transitions 12/103 dead transitions. [2021-04-29 00:17:43,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 103 transitions, 699 flow [2021-04-29 00:17:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:17:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:17:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1692 transitions. [2021-04-29 00:17:43,660 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7324675324675325 [2021-04-29 00:17:43,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1692 transitions. [2021-04-29 00:17:43,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1692 transitions. [2021-04-29 00:17:43,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:43,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1692 transitions. [2021-04-29 00:17:43,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:43,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:43,674 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:43,674 INFO L185 Difference]: Start difference. First operand has 68 places, 68 transitions, 358 flow. Second operand 7 states and 1692 transitions. [2021-04-29 00:17:43,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 103 transitions, 699 flow [2021-04-29 00:17:43,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 103 transitions, 693 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-04-29 00:17:43,717 INFO L241 Difference]: Finished difference. Result has 76 places, 89 transitions, 644 flow [2021-04-29 00:17:43,718 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=644, PETRI_PLACES=76, PETRI_TRANSITIONS=89} [2021-04-29 00:17:43,718 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -51 predicate places. [2021-04-29 00:17:43,718 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:43,718 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 89 transitions, 644 flow [2021-04-29 00:17:43,719 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 89 transitions, 644 flow [2021-04-29 00:17:43,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 89 transitions, 644 flow [2021-04-29 00:17:44,273 INFO L129 PetriNetUnfolder]: 1860/4530 cut-off events. [2021-04-29 00:17:44,273 INFO L130 PetriNetUnfolder]: For 8259/16772 co-relation queries the response was YES. [2021-04-29 00:17:44,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19557 conditions, 4530 events. 1860/4530 cut-off events. For 8259/16772 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 51770 event pairs, 402 based on Foata normal form. 1/1489 useless extension candidates. Maximal degree in co-relation 19533. Up to 4009 conditions per place. [2021-04-29 00:17:44,367 INFO L146 LiptonReduction]: Number of co-enabled transitions 1684 [2021-04-29 00:17:44,479 INFO L158 LiptonReduction]: Checked pairs total: 2422 [2021-04-29 00:17:44,479 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:44,479 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 761 [2021-04-29 00:17:44,480 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 89 transitions, 644 flow [2021-04-29 00:17:44,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 231.8) internal successors, (1159), 5 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:44,481 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:44,481 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:44,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:17:44,482 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1921214279, now seen corresponding path program 1 times [2021-04-29 00:17:44,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:44,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339395571] [2021-04-29 00:17:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:44,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:44,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:44,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:44,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:44,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:44,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:44,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:44,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:17:44,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:44,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:17:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:44,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339395571] [2021-04-29 00:17:44,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:44,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:17:44,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187144014] [2021-04-29 00:17:44,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:17:44,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:17:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:17:44,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 330 [2021-04-29 00:17:44,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 89 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 231.83333333333334) internal successors, (1391), 6 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:44,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:44,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 330 [2021-04-29 00:17:44,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:45,571 INFO L129 PetriNetUnfolder]: 1599/4455 cut-off events. [2021-04-29 00:17:45,572 INFO L130 PetriNetUnfolder]: For 6744/40530 co-relation queries the response was YES. [2021-04-29 00:17:45,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23244 conditions, 4455 events. 1599/4455 cut-off events. For 6744/40530 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 52844 event pairs, 0 based on Foata normal form. 193/1688 useless extension candidates. Maximal degree in co-relation 23218. Up to 3904 conditions per place. [2021-04-29 00:17:45,613 INFO L132 encePairwiseOnDemand]: 313/330 looper letters, 5 selfloop transitions, 58 changer transitions 16/107 dead transitions. [2021-04-29 00:17:45,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 107 transitions, 924 flow [2021-04-29 00:17:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:17:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:17:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2157 transitions. [2021-04-29 00:17:45,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7262626262626263 [2021-04-29 00:17:45,622 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2157 transitions. [2021-04-29 00:17:45,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2157 transitions. [2021-04-29 00:17:45,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:45,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2157 transitions. [2021-04-29 00:17:45,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 239.66666666666666) internal successors, (2157), 9 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:45,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:45,640 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:45,640 INFO L185 Difference]: Start difference. First operand has 76 places, 89 transitions, 644 flow. Second operand 9 states and 2157 transitions. [2021-04-29 00:17:45,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 107 transitions, 924 flow [2021-04-29 00:17:45,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 107 transitions, 797 flow, removed 39 selfloop flow, removed 5 redundant places. [2021-04-29 00:17:45,882 INFO L241 Difference]: Finished difference. Result has 82 places, 89 transitions, 676 flow [2021-04-29 00:17:45,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=676, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2021-04-29 00:17:45,882 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -45 predicate places. [2021-04-29 00:17:45,882 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:45,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 89 transitions, 676 flow [2021-04-29 00:17:45,883 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 89 transitions, 676 flow [2021-04-29 00:17:45,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 89 transitions, 676 flow [2021-04-29 00:17:46,123 INFO L129 PetriNetUnfolder]: 672/2241 cut-off events. [2021-04-29 00:17:46,124 INFO L130 PetriNetUnfolder]: For 3816/7980 co-relation queries the response was YES. [2021-04-29 00:17:46,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9980 conditions, 2241 events. 672/2241 cut-off events. For 3816/7980 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 25967 event pairs, 0 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 9955. Up to 1440 conditions per place. [2021-04-29 00:17:46,174 INFO L146 LiptonReduction]: Number of co-enabled transitions 1606 [2021-04-29 00:17:46,311 INFO L158 LiptonReduction]: Checked pairs total: 2347 [2021-04-29 00:17:46,311 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:46,311 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 429 [2021-04-29 00:17:46,312 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 89 transitions, 676 flow [2021-04-29 00:17:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 231.83333333333334) internal successors, (1391), 6 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:46,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:46,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:46,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:17:46,314 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:46,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash 259116018, now seen corresponding path program 1 times [2021-04-29 00:17:46,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:46,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532462980] [2021-04-29 00:17:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:17:46,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:46,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:46,504 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-04-29 00:17:46,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-04-29 00:17:46,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:46,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:17:46,540 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-04-29 00:17:46,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-04-29 00:17:46,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:17:46,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:17:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:17:46,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532462980] [2021-04-29 00:17:46,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:17:46,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:17:46,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414173865] [2021-04-29 00:17:46,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:17:46,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:17:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:17:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:17:46,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 330 [2021-04-29 00:17:46,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 676 flow. Second operand has 7 states, 7 states have (on average 167.14285714285714) internal successors, (1170), 7 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:46,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:17:46,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 330 [2021-04-29 00:17:46,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:17:47,485 INFO L129 PetriNetUnfolder]: 1616/5688 cut-off events. [2021-04-29 00:17:47,485 INFO L130 PetriNetUnfolder]: For 11057/27025 co-relation queries the response was YES. [2021-04-29 00:17:47,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25411 conditions, 5688 events. 1616/5688 cut-off events. For 11057/27025 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 79462 event pairs, 11 based on Foata normal form. 69/1795 useless extension candidates. Maximal degree in co-relation 25384. Up to 3564 conditions per place. [2021-04-29 00:17:47,544 INFO L132 encePairwiseOnDemand]: 323/330 looper letters, 10 selfloop transitions, 8 changer transitions 4/102 dead transitions. [2021-04-29 00:17:47,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 102 transitions, 780 flow [2021-04-29 00:17:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:17:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:17:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1183 transitions. [2021-04-29 00:17:47,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5121212121212121 [2021-04-29 00:17:47,550 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1183 transitions. [2021-04-29 00:17:47,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1183 transitions. [2021-04-29 00:17:47,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:17:47,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1183 transitions. [2021-04-29 00:17:47,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:47,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:47,561 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:47,561 INFO L185 Difference]: Start difference. First operand has 80 places, 89 transitions, 676 flow. Second operand 7 states and 1183 transitions. [2021-04-29 00:17:47,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 102 transitions, 780 flow [2021-04-29 00:17:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 102 transitions, 586 flow, removed 48 selfloop flow, removed 8 redundant places. [2021-04-29 00:17:49,632 INFO L241 Difference]: Finished difference. Result has 82 places, 94 transitions, 551 flow [2021-04-29 00:17:49,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2021-04-29 00:17:49,633 INFO L343 CegarLoopForPetriNet]: 127 programPoint places, -45 predicate places. [2021-04-29 00:17:49,633 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:17:49,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 94 transitions, 551 flow [2021-04-29 00:17:49,634 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 94 transitions, 551 flow [2021-04-29 00:17:49,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 94 transitions, 551 flow [2021-04-29 00:17:50,107 INFO L129 PetriNetUnfolder]: 1251/4267 cut-off events. [2021-04-29 00:17:50,107 INFO L130 PetriNetUnfolder]: For 2939/3179 co-relation queries the response was YES. [2021-04-29 00:17:50,142 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15294 conditions, 4267 events. 1251/4267 cut-off events. For 2939/3179 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 56331 event pairs, 2 based on Foata normal form. 6/1346 useless extension candidates. Maximal degree in co-relation 15268. Up to 2844 conditions per place. [2021-04-29 00:17:50,209 INFO L146 LiptonReduction]: Number of co-enabled transitions 1900 [2021-04-29 00:17:50,559 INFO L158 LiptonReduction]: Checked pairs total: 1094 [2021-04-29 00:17:50,559 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:17:50,560 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 927 [2021-04-29 00:17:50,561 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 551 flow [2021-04-29 00:17:50,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.14285714285714) internal successors, (1170), 7 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:17:50,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:17:50,562 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:17:50,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:17:50,562 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:17:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:17:50,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2079664848, now seen corresponding path program 2 times [2021-04-29 00:17:50,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:17:50,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529234300] [2021-04-29 00:17:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:17:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:17:50,638 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:17:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:17:50,706 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:17:50,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:17:50,744 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:17:50,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:17:50,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:17:50 BasicIcfg [2021-04-29 00:17:50,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:17:50,866 INFO L168 Benchmark]: Toolchain (without parser) took 51176.25 ms. Allocated memory was 302.0 MB in the beginning and 1.1 GB in the end (delta: 750.8 MB). Free memory was 275.9 MB in the beginning and 751.6 MB in the end (delta: -475.7 MB). Peak memory consumption was 277.5 MB. Max. memory is 16.0 GB. [2021-04-29 00:17:50,867 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 302.0 MB. Free memory was 269.9 MB in the beginning and 269.8 MB in the end (delta: 153.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:17:50,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.11 ms. Allocated memory is still 302.0 MB. Free memory was 272.8 MB in the beginning and 266.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.0 GB. [2021-04-29 00:17:50,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.62 ms. Allocated memory is still 302.0 MB. Free memory was 265.4 MB in the beginning and 263.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:17:50,869 INFO L168 Benchmark]: Boogie Preprocessor took 42.58 ms. Allocated memory is still 302.0 MB. Free memory was 263.3 MB in the beginning and 261.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:17:50,871 INFO L168 Benchmark]: RCFGBuilder took 2598.84 ms. Allocated memory was 302.0 MB in the beginning and 388.0 MB in the end (delta: 86.0 MB). Free memory was 261.2 MB in the beginning and 266.9 MB in the end (delta: -5.7 MB). Peak memory consumption was 133.7 MB. Max. memory is 16.0 GB. [2021-04-29 00:17:50,871 INFO L168 Benchmark]: TraceAbstraction took 47582.37 ms. Allocated memory was 388.0 MB in the beginning and 1.1 GB in the end (delta: 664.8 MB). Free memory was 265.9 MB in the beginning and 751.6 MB in the end (delta: -485.7 MB). Peak memory consumption was 179.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:17:50,877 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.79 ms. Allocated memory is still 302.0 MB. Free memory was 269.9 MB in the beginning and 269.8 MB in the end (delta: 153.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 790.11 ms. Allocated memory is still 302.0 MB. Free memory was 272.8 MB in the beginning and 266.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 104.62 ms. Allocated memory is still 302.0 MB. Free memory was 265.4 MB in the beginning and 263.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.58 ms. Allocated memory is still 302.0 MB. Free memory was 263.3 MB in the beginning and 261.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2598.84 ms. Allocated memory was 302.0 MB in the beginning and 388.0 MB in the end (delta: 86.0 MB). Free memory was 261.2 MB in the beginning and 266.9 MB in the end (delta: -5.7 MB). Peak memory consumption was 133.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 47582.37 ms. Allocated memory was 388.0 MB in the beginning and 1.1 GB in the end (delta: 664.8 MB). Free memory was 265.9 MB in the beginning and 751.6 MB in the end (delta: -485.7 MB). Peak memory consumption was 179.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34586.7ms, 103 PlacesBefore, 127 PlacesAfterwards, 95 TransitionsBefore, 118 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 8 FixpointIterations, 137 TrivialSequentialCompositions, 93 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 232 TotalNumberOfCompositions, 15493 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4540, positive: 4274, positive conditional: 4274, positive unconditional: 0, negative: 266, negative conditional: 266, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2038, positive: 1969, positive conditional: 0, positive unconditional: 1969, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2038, positive: 1969, positive conditional: 0, positive unconditional: 1969, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2038, positive: 1954, positive conditional: 0, positive unconditional: 1954, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1000, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 946, negative conditional: 0, negative unconditional: 946, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4540, positive: 2305, positive conditional: 2305, positive unconditional: 0, negative: 197, negative conditional: 197, negative unconditional: 0, unknown: 2038, unknown conditional: 2038, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2035, Positive cache size: 1966, Positive conditional cache size: 1966, Positive unconditional cache size: 0, Negative cache size: 69, Negative conditional cache size: 69, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 217.9ms, 123 PlacesBefore, 74 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1946 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 563, positive: 483, positive conditional: 483, positive unconditional: 0, negative: 80, negative conditional: 80, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, positive: 214, positive conditional: 0, positive unconditional: 214, negative: 23, negative conditional: 2, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 237, positive: 214, positive conditional: 0, positive unconditional: 214, negative: 23, negative conditional: 2, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 237, positive: 214, positive conditional: 0, positive unconditional: 214, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 2, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 191, negative conditional: 47, negative unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 563, positive: 269, positive conditional: 269, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 237, unknown conditional: 237, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2272, Positive cache size: 2180, Positive conditional cache size: 2180, Positive unconditional cache size: 0, Negative cache size: 92, Negative conditional cache size: 92, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.9ms, 75 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 845 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2310, Positive cache size: 2205, Positive conditional cache size: 2205, Positive unconditional cache size: 0, Negative cache size: 105, Negative conditional cache size: 105, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 196.7ms, 56 PlacesBefore, 56 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1140 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 843 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 48, positive conditional: 48, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 5, positive unconditional: 2, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 158, negative conditional: 3, negative unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2323, Positive cache size: 2212, Positive conditional cache size: 2212, Positive unconditional cache size: 0, Negative cache size: 111, Negative conditional cache size: 111, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2332, Positive cache size: 2220, Positive conditional cache size: 2220, Positive unconditional cache size: 0, Negative cache size: 112, Negative conditional cache size: 112, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.3ms, 68 PlacesBefore, 67 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 745 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 67, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2332, Positive cache size: 2220, Positive conditional cache size: 2220, Positive unconditional cache size: 0, Negative cache size: 112, Negative conditional cache size: 112, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 979.0ms, 68 PlacesBefore, 68 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1303 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 333, positive: 305, positive conditional: 305, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 19, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 19, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, positive: 278, positive conditional: 278, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2359, Positive cache size: 2247, Positive conditional cache size: 2247, Positive unconditional cache size: 0, Negative cache size: 112, Negative conditional cache size: 112, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 760.8ms, 76 PlacesBefore, 76 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1684 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2422 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 866, positive: 823, positive conditional: 823, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 61, positive conditional: 44, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 61, positive conditional: 44, positive unconditional: 17, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 866, positive: 762, positive conditional: 762, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2421, Positive cache size: 2308, Positive conditional cache size: 2308, Positive unconditional cache size: 0, Negative cache size: 113, Negative conditional cache size: 113, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 428.5ms, 82 PlacesBefore, 80 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 795, positive: 751, positive conditional: 751, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 52, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 52, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 795, positive: 698, positive conditional: 698, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 53, unknown conditional: 53, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2474, Positive cache size: 2361, Positive conditional cache size: 2361, Positive unconditional cache size: 0, Negative cache size: 113, Negative conditional cache size: 113, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 925.6ms, 82 PlacesBefore, 82 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1900 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1094 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 174, positive: 155, positive conditional: 155, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 261, positive: 215, positive conditional: 215, positive unconditional: 0, negative: 46, negative conditional: 46, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 174, positive: 125, positive conditional: 125, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2506, Positive cache size: 2391, Positive conditional cache size: 2391, Positive unconditional cache size: 0, Negative cache size: 115, Negative conditional cache size: 115, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2281; [L834] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L835] 0 pthread_t t2282; [L836] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L837] 0 pthread_t t2283; [L838] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 z$flush_delayed = weak$$choice2 [L798] 3 z$mem_tmp = z [L799] 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) [L799] 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) [L800] 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)) [L800] EXPR 3 !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) [L800] 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)) [L800] 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)) [L801] 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)) [L801] EXPR 3 !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) [L801] 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)) [L801] 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)) [L802] 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)) [L802] EXPR 3 !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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] EXPR 3 !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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] EXPR 3 !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) [L804] 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)) [L804] 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)) [L805] 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)) [L805] EXPR 3 !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) [L805] 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)) [L805] 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)) [L806] 3 __unbuffered_p2_EBX = z [L807] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L807] 3 z = z$flush_delayed ? z$mem_tmp : z [L808] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L811] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L811] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L812] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L812] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L813] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L815] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L844] 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) [L844] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L844] 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) [L844] 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) [L845] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 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 [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L848] 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 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 47296.0ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 7311.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 34703.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 84 SDtfs, 91 SDslu, 29 SDs, 0 SdLazy, 420 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 498.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 204.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=8, InterpolantAutomatonStates: 47, 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: 36.2ms SsaConstructionTime, 400.3ms SatisfiabilityAnalysisTime, 719.3ms InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...