/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/mix016_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:06:26,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:06:26,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:06:26,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:06:26,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:06:26,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:06:26,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:06:26,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:06:26,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:06:26,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:06:26,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:06:26,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:06:26,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:06:26,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:06:26,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:06:26,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:06:26,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:06:26,304 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:06:26,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:06:26,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:06:26,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:06:26,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:06:26,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:06:26,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:06:26,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:06:26,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:06:26,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:06:26,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:06:26,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:06:26,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:06:26,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:06:26,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:06:26,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:06:26,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:06:26,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:06:26,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:06:26,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:06:26,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:06:26,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:06:26,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:06:26,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:06:26,331 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-03-26 00:06:26,364 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:06:26,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:06:26,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:06:26,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:06:26,367 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:06:26,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:06:26,367 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:06:26,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:06:26,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:06:26,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:06:26,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:06:26,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:06:26,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:06:26,368 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:06:26,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:06:26,369 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:06:26,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:06:26,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:06:26,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:06:26,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:06:26,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:06:26,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:06:26,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:06:26,370 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:06:26,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:06:26,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:06:26,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:06:26,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:06:26,611 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:06:26,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2021-03-26 00:06:26,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcb156a5/31f39081706c4168b0468b896f044e84/FLAG500225d27 [2021-03-26 00:06:27,063 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:06:27,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.oepc.i [2021-03-26 00:06:27,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcb156a5/31f39081706c4168b0468b896f044e84/FLAG500225d27 [2021-03-26 00:06:27,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcb156a5/31f39081706c4168b0468b896f044e84 [2021-03-26 00:06:27,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:06:27,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:06:27,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:06:27,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:06:27,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:06:27,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472c3fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27, skipping insertion in model container [2021-03-26 00:06:27,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:06:27,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:06:27,282 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/mix016_pso.oepc.i[949,962] [2021-03-26 00:06:27,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:06:27,448 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:06:27,457 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/mix016_pso.oepc.i[949,962] [2021-03-26 00:06:27,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:06:27,567 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:06:27,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27 WrapperNode [2021-03-26 00:06:27,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:06:27,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:06:27,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:06:27,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:06:27,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:06:27,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:06:27,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:06:27,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:06:27,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... [2021-03-26 00:06:27,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:06:27,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:06:27,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:06:27,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:06:27,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:06:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:06:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:06:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:06:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:06:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:06:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:06:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:06:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:06:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:06:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:06:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:06:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:06:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:06:27,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:06:27,699 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:06:28,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:06:28,942 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:06:28,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:06:28 BoogieIcfgContainer [2021-03-26 00:06:28,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:06:28,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:06:28,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:06:28,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:06:28,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:06:27" (1/3) ... [2021-03-26 00:06:28,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ee317e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:06:28, skipping insertion in model container [2021-03-26 00:06:28,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:06:27" (2/3) ... [2021-03-26 00:06:28,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ee317e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:06:28, skipping insertion in model container [2021-03-26 00:06:28,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:06:28" (3/3) ... [2021-03-26 00:06:28,948 INFO L111 eAbstractionObserver]: Analyzing ICFG mix016_pso.oepc.i [2021-03-26 00:06:28,952 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:06:28,954 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:06:28,955 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:28,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,012 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:06:29,014 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:06:29,025 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:06:29,042 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:06:29,042 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:06:29,042 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:06:29,042 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:06:29,042 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:06:29,043 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:06:29,043 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:06:29,045 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:06:29,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-26 00:06:29,082 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-26 00:06:29,083 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:06:29,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:06:29,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-26 00:06:29,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-26 00:06:29,090 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:29,097 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-26 00:06:29,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-26 00:06:29,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-26 00:06:29,121 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-26 00:06:29,121 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:06:29,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 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/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 00:06:29,125 INFO L142 LiptonReduction]: Number of co-enabled transitions 1778 [2021-03-26 00:06:30,188 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:06:30,553 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-26 00:06:30,669 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 00:06:31,472 INFO L154 LiptonReduction]: Checked pairs total: 3074 [2021-03-26 00:06:31,472 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 00:06:31,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2387 [2021-03-26 00:06:31,485 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 00:06:31,485 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:06:31,486 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:31,486 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:31,486 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:31,491 INFO L82 PathProgramCache]: Analyzing trace with hash -690583893, now seen corresponding path program 1 times [2021-03-26 00:06:31,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:31,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580753396] [2021-03-26 00:06:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:31,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:31,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:06:31,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:31,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:31,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580753396] [2021-03-26 00:06:31,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:31,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:06:31,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440975799] [2021-03-26 00:06:31,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:06:31,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:31,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:06:31,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:06:31,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 165 [2021-03-26 00:06:31,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:31,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:31,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 165 [2021-03-26 00:06:31,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:31,712 INFO L129 PetriNetUnfolder]: 49/181 cut-off events. [2021-03-26 00:06:31,712 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:06:31,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 181 events. 49/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 836 event pairs, 38 based on Foata normal form. 16/182 useless extension candidates. Maximal degree in co-relation 255. Up to 65 conditions per place. [2021-03-26 00:06:31,714 INFO L132 encePairwiseOnDemand]: 161/165 looper letters, 9 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-26 00:06:31,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 119 flow [2021-03-26 00:06:31,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:06:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:06:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 00:06:31,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.901010101010101 [2021-03-26 00:06:31,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 00:06:31,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 00:06:31,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:31,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 00:06:31,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:31,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:31,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:31,733 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 446 transitions. [2021-03-26 00:06:31,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 44 transitions, 119 flow [2021-03-26 00:06:31,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 116 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:06:31,736 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2021-03-26 00:06:31,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2021-03-26 00:06:31,738 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-26 00:06:31,738 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:31,738 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:06:31,738 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 90 flow [2021-03-26 00:06:31,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 90 flow [2021-03-26 00:06:31,742 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 00:06:31,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:06:31,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:06:31,742 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 00:06:33,182 INFO L154 LiptonReduction]: Checked pairs total: 1683 [2021-03-26 00:06:33,182 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 00:06:33,183 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1445 [2021-03-26 00:06:33,184 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-26 00:06:33,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:33,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:33,184 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:33,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:06:33,185 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1404294952, now seen corresponding path program 1 times [2021-03-26 00:06:33,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:33,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346266752] [2021-03-26 00:06:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:33,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:33,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:06:33,276 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:06:33,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:06:33,286 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:06:33,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:06:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:33,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346266752] [2021-03-26 00:06:33,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:33,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:06:33,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543570756] [2021-03-26 00:06:33,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:06:33,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:06:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:06:33,294 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2021-03-26 00:06:33,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:33,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:33,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2021-03-26 00:06:33,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:33,346 INFO L129 PetriNetUnfolder]: 52/148 cut-off events. [2021-03-26 00:06:33,346 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:06:33,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 148 events. 52/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 666 event pairs, 14 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 247. Up to 49 conditions per place. [2021-03-26 00:06:33,347 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 5 selfloop transitions, 4 changer transitions 10/37 dead transitions. [2021-03-26 00:06:33,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 122 flow [2021-03-26 00:06:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:06:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:06:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 750 transitions. [2021-03-26 00:06:33,351 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-03-26 00:06:33,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 750 transitions. [2021-03-26 00:06:33,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 750 transitions. [2021-03-26 00:06:33,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:33,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 750 transitions. [2021-03-26 00:06:33,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.0) internal successors, (750), 5 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:33,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:33,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:33,356 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 750 transitions. [2021-03-26 00:06:33,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 122 flow [2021-03-26 00:06:33,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:06:33,357 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 88 flow [2021-03-26 00:06:33,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-26 00:06:33,357 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -14 predicate places. [2021-03-26 00:06:33,357 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:33,357 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 88 flow [2021-03-26 00:06:33,358 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 88 flow [2021-03-26 00:06:33,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 88 flow [2021-03-26 00:06:33,365 INFO L129 PetriNetUnfolder]: 23/83 cut-off events. [2021-03-26 00:06:33,366 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-03-26 00:06:33,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 83 events. 23/83 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 284 event pairs, 9 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 157. Up to 38 conditions per place. [2021-03-26 00:06:33,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-26 00:06:33,695 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:06:33,822 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:06:34,102 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:06:34,234 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:06:34,262 INFO L154 LiptonReduction]: Checked pairs total: 434 [2021-03-26 00:06:34,262 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:06:34,262 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 905 [2021-03-26 00:06:34,263 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 86 flow [2021-03-26 00:06:34,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,263 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:34,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:34,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:06:34,264 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1844977235, now seen corresponding path program 1 times [2021-03-26 00:06:34,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:34,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023782779] [2021-03-26 00:06:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:34,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,367 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:06:34,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:06:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:34,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023782779] [2021-03-26 00:06:34,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:34,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:06:34,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250717578] [2021-03-26 00:06:34,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:06:34,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:06:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:06:34,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 00:06:34,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:34,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 00:06:34,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:34,395 INFO L129 PetriNetUnfolder]: 21/66 cut-off events. [2021-03-26 00:06:34,395 INFO L130 PetriNetUnfolder]: For 41/65 co-relation queries the response was YES. [2021-03-26 00:06:34,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 66 events. 21/66 cut-off events. For 41/65 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 208 event pairs, 4 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 172. Up to 37 conditions per place. [2021-03-26 00:06:34,396 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 8 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-26 00:06:34,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 120 flow [2021-03-26 00:06:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:06:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:06:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 00:06:34,397 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8453038674033149 [2021-03-26 00:06:34,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 00:06:34,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 00:06:34,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:34,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 00:06:34,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,400 INFO L185 Difference]: Start difference. First operand has 34 places, 26 transitions, 86 flow. Second operand 3 states and 459 transitions. [2021-03-26 00:06:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 120 flow [2021-03-26 00:06:34,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:06:34,401 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 93 flow [2021-03-26 00:06:34,401 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 00:06:34,401 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2021-03-26 00:06:34,401 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:34,401 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 00:06:34,401 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 93 flow [2021-03-26 00:06:34,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 93 flow [2021-03-26 00:06:34,407 INFO L129 PetriNetUnfolder]: 19/75 cut-off events. [2021-03-26 00:06:34,407 INFO L130 PetriNetUnfolder]: For 27/30 co-relation queries the response was YES. [2021-03-26 00:06:34,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 75 events. 19/75 cut-off events. For 27/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 253 event pairs, 15 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 150. Up to 32 conditions per place. [2021-03-26 00:06:34,410 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-26 00:06:34,435 INFO L154 LiptonReduction]: Checked pairs total: 207 [2021-03-26 00:06:34,435 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:06:34,435 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-26 00:06:34,436 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 93 flow [2021-03-26 00:06:34,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,436 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:34,437 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:34,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:06:34,437 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1580621344, now seen corresponding path program 1 times [2021-03-26 00:06:34,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:34,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359659460] [2021-03-26 00:06:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:34,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:06:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:34,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359659460] [2021-03-26 00:06:34,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:34,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:06:34,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520155457] [2021-03-26 00:06:34,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:06:34,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:06:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:06:34,499 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2021-03-26 00:06:34,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:34,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2021-03-26 00:06:34,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:34,531 INFO L129 PetriNetUnfolder]: 88/213 cut-off events. [2021-03-26 00:06:34,531 INFO L130 PetriNetUnfolder]: For 38/41 co-relation queries the response was YES. [2021-03-26 00:06:34,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 213 events. 88/213 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1055 event pairs, 25 based on Foata normal form. 16/190 useless extension candidates. Maximal degree in co-relation 452. Up to 126 conditions per place. [2021-03-26 00:06:34,532 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 10 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-26 00:06:34,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 151 flow [2021-03-26 00:06:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:06:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:06:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2021-03-26 00:06:34,534 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8453038674033149 [2021-03-26 00:06:34,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2021-03-26 00:06:34,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2021-03-26 00:06:34,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:34,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2021-03-26 00:06:34,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,537 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,537 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 93 flow. Second operand 5 states and 765 transitions. [2021-03-26 00:06:34,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 151 flow [2021-03-26 00:06:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:06:34,539 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 147 flow [2021-03-26 00:06:34,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-26 00:06:34,539 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2021-03-26 00:06:34,539 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:34,539 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 147 flow [2021-03-26 00:06:34,539 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 147 flow [2021-03-26 00:06:34,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 147 flow [2021-03-26 00:06:34,550 INFO L129 PetriNetUnfolder]: 65/174 cut-off events. [2021-03-26 00:06:34,550 INFO L130 PetriNetUnfolder]: For 114/145 co-relation queries the response was YES. [2021-03-26 00:06:34,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 174 events. 65/174 cut-off events. For 114/145 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 850 event pairs, 24 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 466. Up to 88 conditions per place. [2021-03-26 00:06:34,552 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 00:06:34,578 INFO L154 LiptonReduction]: Checked pairs total: 544 [2021-03-26 00:06:34,578 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:06:34,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 00:06:34,579 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 141 flow [2021-03-26 00:06:34,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:34,579 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:34,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:06:34,580 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash 433706266, now seen corresponding path program 1 times [2021-03-26 00:06:34,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:34,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006155262] [2021-03-26 00:06:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:34,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:06:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:34,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006155262] [2021-03-26 00:06:34,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:34,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:06:34,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363633114] [2021-03-26 00:06:34,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:06:34,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:06:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:06:34,664 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2021-03-26 00:06:34,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:34,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2021-03-26 00:06:34,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:34,709 INFO L129 PetriNetUnfolder]: 56/149 cut-off events. [2021-03-26 00:06:34,709 INFO L130 PetriNetUnfolder]: For 135/207 co-relation queries the response was YES. [2021-03-26 00:06:34,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 149 events. 56/149 cut-off events. For 135/207 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 614 event pairs, 5 based on Foata normal form. 29/166 useless extension candidates. Maximal degree in co-relation 470. Up to 83 conditions per place. [2021-03-26 00:06:34,710 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 8 selfloop transitions, 11 changer transitions 3/41 dead transitions. [2021-03-26 00:06:34,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 229 flow [2021-03-26 00:06:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:06:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:06:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2021-03-26 00:06:34,712 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8453038674033149 [2021-03-26 00:06:34,712 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 918 transitions. [2021-03-26 00:06:34,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions. [2021-03-26 00:06:34,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:34,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions. [2021-03-26 00:06:34,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,715 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,715 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 141 flow. Second operand 6 states and 918 transitions. [2021-03-26 00:06:34,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 229 flow [2021-03-26 00:06:34,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 223 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:06:34,717 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 205 flow [2021-03-26 00:06:34,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-26 00:06:34,718 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2021-03-26 00:06:34,718 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:34,718 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 205 flow [2021-03-26 00:06:34,718 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 205 flow [2021-03-26 00:06:34,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 205 flow [2021-03-26 00:06:34,726 INFO L129 PetriNetUnfolder]: 31/109 cut-off events. [2021-03-26 00:06:34,726 INFO L130 PetriNetUnfolder]: For 193/209 co-relation queries the response was YES. [2021-03-26 00:06:34,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 109 events. 31/109 cut-off events. For 193/209 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 468 event pairs, 5 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 362. Up to 57 conditions per place. [2021-03-26 00:06:34,727 INFO L142 LiptonReduction]: Number of co-enabled transitions 374 [2021-03-26 00:06:34,732 INFO L154 LiptonReduction]: Checked pairs total: 482 [2021-03-26 00:06:34,733 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:06:34,733 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 00:06:34,733 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 197 flow [2021-03-26 00:06:34,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,733 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:34,734 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:34,734 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:06:34,734 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1006436549, now seen corresponding path program 1 times [2021-03-26 00:06:34,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:34,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544097068] [2021-03-26 00:06:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:34,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:34,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:34,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:06:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:34,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544097068] [2021-03-26 00:06:34,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:34,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:06:34,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103630154] [2021-03-26 00:06:34,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:06:34,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:06:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:06:34,798 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2021-03-26 00:06:34,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:34,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2021-03-26 00:06:34,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:34,844 INFO L129 PetriNetUnfolder]: 42/111 cut-off events. [2021-03-26 00:06:34,844 INFO L130 PetriNetUnfolder]: For 225/279 co-relation queries the response was YES. [2021-03-26 00:06:34,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 111 events. 42/111 cut-off events. For 225/279 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 373 event pairs, 2 based on Foata normal form. 17/116 useless extension candidates. Maximal degree in co-relation 397. Up to 57 conditions per place. [2021-03-26 00:06:34,845 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 11 changer transitions 4/39 dead transitions. [2021-03-26 00:06:34,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 243 flow [2021-03-26 00:06:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:06:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:06:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1065 transitions. [2021-03-26 00:06:34,847 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.840568271507498 [2021-03-26 00:06:34,848 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1065 transitions. [2021-03-26 00:06:34,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1065 transitions. [2021-03-26 00:06:34,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:34,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1065 transitions. [2021-03-26 00:06:34,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.14285714285714) internal successors, (1065), 7 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,851 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:34,851 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 197 flow. Second operand 7 states and 1065 transitions. [2021-03-26 00:06:34,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 243 flow [2021-03-26 00:06:34,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 216 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-26 00:06:34,853 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 182 flow [2021-03-26 00:06:34,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-03-26 00:06:34,853 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2021-03-26 00:06:34,853 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:34,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 182 flow [2021-03-26 00:06:34,854 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 33 transitions, 182 flow [2021-03-26 00:06:34,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 182 flow [2021-03-26 00:06:34,860 INFO L129 PetriNetUnfolder]: 17/70 cut-off events. [2021-03-26 00:06:34,860 INFO L130 PetriNetUnfolder]: For 91/93 co-relation queries the response was YES. [2021-03-26 00:06:34,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 70 events. 17/70 cut-off events. For 91/93 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 207 event pairs, 2 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 212. Up to 20 conditions per place. [2021-03-26 00:06:34,860 INFO L142 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-26 00:06:35,125 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 00:06:35,267 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 00:06:35,614 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 00:06:35,796 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 00:06:35,800 INFO L154 LiptonReduction]: Checked pairs total: 553 [2021-03-26 00:06:35,800 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:06:35,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 947 [2021-03-26 00:06:35,801 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 168 flow [2021-03-26 00:06:35,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:35,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:35,801 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:35,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:06:35,801 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1933100642, now seen corresponding path program 1 times [2021-03-26 00:06:35,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:35,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023844758] [2021-03-26 00:06:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:35,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:35,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:06:35,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:35,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:35,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:35,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:35,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023844758] [2021-03-26 00:06:35,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:35,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:06:35,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395151361] [2021-03-26 00:06:35,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:06:35,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:06:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:06:35,846 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 183 [2021-03-26 00:06:35,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:35,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:35,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 183 [2021-03-26 00:06:35,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:35,867 INFO L129 PetriNetUnfolder]: 26/92 cut-off events. [2021-03-26 00:06:35,867 INFO L130 PetriNetUnfolder]: For 332/349 co-relation queries the response was YES. [2021-03-26 00:06:35,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 92 events. 26/92 cut-off events. For 332/349 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 339 event pairs, 1 based on Foata normal form. 10/99 useless extension candidates. Maximal degree in co-relation 292. Up to 27 conditions per place. [2021-03-26 00:06:35,868 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 5 selfloop transitions, 1 changer transitions 4/33 dead transitions. [2021-03-26 00:06:35,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 204 flow [2021-03-26 00:06:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:06:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:06:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2021-03-26 00:06:35,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8524590163934426 [2021-03-26 00:06:35,870 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2021-03-26 00:06:35,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2021-03-26 00:06:35,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:35,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2021-03-26 00:06:35,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:35,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:35,872 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:35,872 INFO L185 Difference]: Start difference. First operand has 44 places, 30 transitions, 168 flow. Second operand 4 states and 624 transitions. [2021-03-26 00:06:35,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 204 flow [2021-03-26 00:06:35,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 162 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 00:06:35,873 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 131 flow [2021-03-26 00:06:35,873 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-26 00:06:35,873 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2021-03-26 00:06:35,873 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:35,874 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 131 flow [2021-03-26 00:06:35,874 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 131 flow [2021-03-26 00:06:35,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 131 flow [2021-03-26 00:06:35,878 INFO L129 PetriNetUnfolder]: 10/50 cut-off events. [2021-03-26 00:06:35,878 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2021-03-26 00:06:35,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 50 events. 10/50 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 116. Up to 12 conditions per place. [2021-03-26 00:06:35,879 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-26 00:06:35,880 INFO L154 LiptonReduction]: Checked pairs total: 178 [2021-03-26 00:06:35,880 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:06:35,880 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 00:06:35,881 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 131 flow [2021-03-26 00:06:35,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:35,881 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:35,881 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:35,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:06:35,881 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash 764501458, now seen corresponding path program 1 times [2021-03-26 00:06:35,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:35,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432813871] [2021-03-26 00:06:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:06:36,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:36,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:06:36,009 INFO L142 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size [2021-03-26 00:06:36,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:06:36,019 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-26 00:06:36,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:06:36,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:36,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:06:36,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:06:36,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:06:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:06:36,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432813871] [2021-03-26 00:06:36,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:06:36,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:06:36,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497201193] [2021-03-26 00:06:36,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:06:36,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:06:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:06:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:06:36,042 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 183 [2021-03-26 00:06:36,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:36,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:06:36,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 183 [2021-03-26 00:06:36,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:06:36,161 INFO L129 PetriNetUnfolder]: 49/157 cut-off events. [2021-03-26 00:06:36,161 INFO L130 PetriNetUnfolder]: For 237/261 co-relation queries the response was YES. [2021-03-26 00:06:36,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 157 events. 49/157 cut-off events. For 237/261 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 727 event pairs, 6 based on Foata normal form. 17/166 useless extension candidates. Maximal degree in co-relation 405. Up to 43 conditions per place. [2021-03-26 00:06:36,163 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 8 selfloop transitions, 5 changer transitions 4/39 dead transitions. [2021-03-26 00:06:36,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 197 flow [2021-03-26 00:06:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:06:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:06:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 929 transitions. [2021-03-26 00:06:36,168 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7252146760343482 [2021-03-26 00:06:36,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 929 transitions. [2021-03-26 00:06:36,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 929 transitions. [2021-03-26 00:06:36,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:06:36,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 929 transitions. [2021-03-26 00:06:36,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:36,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:36,172 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:36,172 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 131 flow. Second operand 7 states and 929 transitions. [2021-03-26 00:06:36,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 197 flow [2021-03-26 00:06:36,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 192 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:06:36,174 INFO L241 Difference]: Finished difference. Result has 48 places, 31 transitions, 163 flow [2021-03-26 00:06:36,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=163, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2021-03-26 00:06:36,175 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2021-03-26 00:06:36,175 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:06:36,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 31 transitions, 163 flow [2021-03-26 00:06:36,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 31 transitions, 163 flow [2021-03-26 00:06:36,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 31 transitions, 163 flow [2021-03-26 00:06:36,182 INFO L129 PetriNetUnfolder]: 21/83 cut-off events. [2021-03-26 00:06:36,182 INFO L130 PetriNetUnfolder]: For 87/89 co-relation queries the response was YES. [2021-03-26 00:06:36,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 83 events. 21/83 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 288 event pairs, 3 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 221. Up to 23 conditions per place. [2021-03-26 00:06:36,183 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-26 00:06:36,246 INFO L154 LiptonReduction]: Checked pairs total: 57 [2021-03-26 00:06:36,247 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:06:36,247 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-26 00:06:36,248 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 163 flow [2021-03-26 00:06:36,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:06:36,249 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:06:36,249 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:06:36,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:06:36,249 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:06:36,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:06:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -852037710, now seen corresponding path program 2 times [2021-03-26 00:06:36,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:06:36,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515192376] [2021-03-26 00:06:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:06:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:06:36,286 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:06:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:06:36,335 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:06:36,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:06:36,367 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:06:36,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:06:36,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:06:36 BasicIcfg [2021-03-26 00:06:36,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:06:36,451 INFO L168 Benchmark]: Toolchain (without parser) took 9355.21 ms. Allocated memory was 255.9 MB in the beginning and 515.9 MB in the end (delta: 260.0 MB). Free memory was 236.7 MB in the beginning and 293.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 201.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:06:36,451 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:06:36,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.99 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 236.7 MB in the beginning and 308.9 MB in the end (delta: -72.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:06:36,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 350.2 MB. Free memory was 308.9 MB in the beginning and 306.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:06:36,453 INFO L168 Benchmark]: Boogie Preprocessor took 30.27 ms. Allocated memory is still 350.2 MB. Free memory was 306.9 MB in the beginning and 304.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:06:36,453 INFO L168 Benchmark]: RCFGBuilder took 1297.84 ms. Allocated memory is still 350.2 MB. Free memory was 304.2 MB in the beginning and 302.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:06:36,454 INFO L168 Benchmark]: TraceAbstraction took 7505.78 ms. Allocated memory was 350.2 MB in the beginning and 515.9 MB in the end (delta: 165.7 MB). Free memory was 301.3 MB in the beginning and 293.9 MB in the end (delta: 7.3 MB). Peak memory consumption was 173.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:06:36,455 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.37 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 471.99 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 236.7 MB in the beginning and 308.9 MB in the end (delta: -72.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 350.2 MB. Free memory was 308.9 MB in the beginning and 306.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.27 ms. Allocated memory is still 350.2 MB. Free memory was 306.9 MB in the beginning and 304.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1297.84 ms. Allocated memory is still 350.2 MB. Free memory was 304.2 MB in the beginning and 302.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7505.78 ms. Allocated memory was 350.2 MB in the beginning and 515.9 MB in the end (delta: 165.7 MB). Free memory was 301.3 MB in the beginning and 293.9 MB in the end (delta: 7.3 MB). Peak memory consumption was 173.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2373.9ms, 106 PlacesBefore, 52 PlacesAfterwards, 98 TransitionsBefore, 43 TransitionsAfterwards, 1778 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1543, positive: 1467, positive conditional: 1467, positive unconditional: 0, negative: 76, negative conditional: 76, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1192, positive: 1154, positive conditional: 0, positive unconditional: 1154, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1192, positive: 1154, positive conditional: 0, positive unconditional: 1154, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1192, positive: 1144, positive conditional: 0, positive unconditional: 1144, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 446, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 421, negative conditional: 0, negative unconditional: 421, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1543, positive: 313, positive conditional: 313, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 1192, unknown conditional: 1192, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 65, Positive conditional cache size: 65, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1444.6ms, 49 PlacesBefore, 34 PlacesAfterwards, 40 TransitionsBefore, 25 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 4 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 1683 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 479, positive: 376, positive conditional: 376, positive unconditional: 0, negative: 103, negative conditional: 103, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, positive: 124, positive conditional: 11, positive unconditional: 113, negative: 25, negative conditional: 1, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 149, positive: 124, positive conditional: 11, positive unconditional: 113, negative: 25, negative conditional: 1, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 149, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 25, negative conditional: 1, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 281, negative conditional: 27, negative unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 479, positive: 252, positive conditional: 252, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 149, unknown conditional: 149, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 90, Positive conditional cache size: 90, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 904.4ms, 38 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 434 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 115, positive: 87, positive conditional: 87, 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: 28, positive: 21, positive conditional: 1, positive unconditional: 20, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 21, positive conditional: 1, positive unconditional: 20, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 2, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 64, negative conditional: 6, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 115, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 111, Positive conditional cache size: 111, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.9ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 114, Positive conditional cache size: 114, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.9ms, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 544 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 211, positive: 185, positive conditional: 185, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 41, positive conditional: 31, positive unconditional: 10, 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: 42, positive: 41, positive conditional: 31, positive unconditional: 10, 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: 42, positive: 41, positive conditional: 0, positive unconditional: 41, 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: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 132, Positive conditional cache size: 132, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 141, positive conditional: 141, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 25, positive unconditional: 10, 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: 35, positive: 35, positive conditional: 25, positive unconditional: 10, 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: 35, positive: 35, positive conditional: 0, positive unconditional: 35, 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: 165, positive: 106, positive conditional: 106, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 152, Positive conditional cache size: 152, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 946.2ms, 48 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 553 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 146, positive conditional: 146, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 18, 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: 18, positive: 18, positive conditional: 18, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 182, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 143, Positive conditional cache size: 143, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4ms, 42 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 57, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 146, Positive conditional cache size: 146, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.8ms, 48 PlacesBefore, 46 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 57 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 13, 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: 15, positive: 13, positive conditional: 13, 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: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 159, Positive conditional cache size: 159, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L840] 0 pthread_t t415; [L841] FCALL, FORK 0 pthread_create(&t415, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L842] 0 pthread_t t416; [L843] FCALL, FORK 0 pthread_create(&t416, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L844] 0 pthread_t t417; [L845] FCALL, FORK 0 pthread_create(&t417, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __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=1, 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] [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 z$flush_delayed = weak$$choice2 [L805] 3 z$mem_tmp = z [L806] 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) [L806] 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) [L807] 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)) [L807] 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) [L807] 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)) [L807] 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)) [L808] 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)) [L808] 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) [L808] 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)) [L808] 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)) [L809] 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)) [L809] 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) [L809] 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)) [L809] 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)) [L810] 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)) [L810] 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) [L810] 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)) [L810] 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)) [L811] 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)) [L811] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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) [L812] 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)) [L812] 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)) [L813] 3 __unbuffered_p2_EBX = z [L814] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L814] 3 z = z$flush_delayed ? z$mem_tmp : z [L815] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, 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] [L818] 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) [L818] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L818] 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) [L818] 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) [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 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 [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] 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 [L762] 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) [L762] 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) [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L764] 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 [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L766] 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 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 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) [L782] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L782] 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) [L782] 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) [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 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 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L786] 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 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L851] 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) [L851] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L851] 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) [L851] 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) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 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 [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L855] 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 [L858] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __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_p0_EAX=0, __unbuffered_p1_EAX=0, __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=1, 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, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7329.0ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 482.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2437.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 31 SDslu, 17 SDs, 0 SdLazy, 177 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 164.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 119.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=5, InterpolantAutomatonStates: 40, 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: 20.0ms SsaConstructionTime, 274.9ms SatisfiabilityAnalysisTime, 442.2ms InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...