/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:18:51,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:18:51,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:18:51,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:18:51,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:18:51,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:18:51,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:18:51,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:18:51,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:18:51,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:18:51,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:18:51,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:18:51,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:18:51,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:18:51,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:18:51,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:18:51,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:18:51,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:18:51,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:18:52,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:18:52,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:18:52,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:18:52,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:18:52,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:18:52,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:18:52,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:18:52,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:18:52,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:18:52,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:18:52,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:18:52,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:18:52,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:18:52,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:18:52,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:18:52,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:18:52,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:18:52,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:18:52,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:18:52,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:18:52,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:18:52,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:18:52,015 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 16:18:52,045 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:18:52,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:18:52,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:18:52,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:18:52,049 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:18:52,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:18:52,049 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:18:52,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:18:52,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:18:52,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:18:52,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:18:52,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:18:52,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:18:52,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:18:52,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:18:52,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:18:52,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:18:52,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:18:52,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:18:52,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:18:52,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:18:52,052 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:18:52,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:18:52,053 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:18:52,053 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-06-11 16:18:52,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:18:52,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:18:52,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:18:52,337 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:18:52,338 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:18:52,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2021-06-11 16:18:52,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276625ce5/d15c0cdc4d4b47d69cf9b629c4c8f0f1/FLAG85dffa120 [2021-06-11 16:18:52,908 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:18:52,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2021-06-11 16:18:52,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276625ce5/d15c0cdc4d4b47d69cf9b629c4c8f0f1/FLAG85dffa120 [2021-06-11 16:18:53,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276625ce5/d15c0cdc4d4b47d69cf9b629c4c8f0f1 [2021-06-11 16:18:53,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:18:53,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:18:53,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:18:53,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:18:53,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:18:53,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55da847f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53, skipping insertion in model container [2021-06-11 16:18:53,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:18:53,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:18:53,591 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/safe020_rmo.oepc.i[993,1006] [2021-06-11 16:18:53,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:18:53,789 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:18:53,799 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/safe020_rmo.oepc.i[993,1006] [2021-06-11 16:18:53,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:18:53,892 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:18:53,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53 WrapperNode [2021-06-11 16:18:53,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:18:53,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:18:53,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:18:53,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:18:53,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:18:53,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:18:53,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:18:53,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:18:53,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (1/1) ... [2021-06-11 16:18:53,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:18:53,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:18:53,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:18:53,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:18:53,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (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-06-11 16:18:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-11 16:18:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:18:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:18:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:18:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:18:54,036 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:18:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:18:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:18:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:18:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:18:54,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:18:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:18:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:18:54,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:18:54,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:18:54,039 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:18:56,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:18:56,390 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-06-11 16:18:56,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:18:56 BoogieIcfgContainer [2021-06-11 16:18:56,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:18:56,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:18:56,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:18:56,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:18:56,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:18:53" (1/3) ... [2021-06-11 16:18:56,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51114f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:18:56, skipping insertion in model container [2021-06-11 16:18:56,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:18:53" (2/3) ... [2021-06-11 16:18:56,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51114f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:18:56, skipping insertion in model container [2021-06-11 16:18:56,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:18:56" (3/3) ... [2021-06-11 16:18:56,401 INFO L111 eAbstractionObserver]: Analyzing ICFG safe020_rmo.oepc.i [2021-06-11 16:18:56,407 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:18:56,411 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-06-11 16:18:56,411 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:18:56,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,487 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,523 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,524 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,533 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:18:56,537 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:18:56,552 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-11 16:18:56,568 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:18:56,569 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:18:56,569 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:18:56,569 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:18:56,569 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:18:56,569 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:18:56,569 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:18:56,569 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:18:56,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-06-11 16:18:56,615 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-06-11 16:18:56,615 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:18:56,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-06-11 16:18:56,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2021-06-11 16:18:56,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 97 transitions, 203 flow [2021-06-11 16:18:56,624 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:18:56,635 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 97 transitions, 203 flow [2021-06-11 16:18:56,638 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 97 transitions, 203 flow [2021-06-11 16:18:56,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 97 transitions, 203 flow [2021-06-11 16:18:56,658 INFO L129 PetriNetUnfolder]: 1/97 cut-off events. [2021-06-11 16:18:56,658 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:18:56,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 1/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-06-11 16:18:56,661 INFO L151 LiptonReduction]: Number of co-enabled transitions 954 [2021-06-11 16:18:56,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:56,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:18:56,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:56,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:18:56,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:18:58,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:58,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:58,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:58,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:58,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:58,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:58,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:58,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:18:59,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:18:59,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:18:59,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:18:59,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:18:59,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:00,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:00,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:00,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:00,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:00,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:00,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:00,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:00,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:00,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:02,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:02,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:03,012 WARN L205 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-06-11 16:19:03,660 WARN L205 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 195 [2021-06-11 16:19:05,168 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-06-11 16:19:05,788 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 16:19:05,836 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.2 percent of original size [2021-06-11 16:19:05,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:05,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:19:05,870 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:05,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:19:05,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:05,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 16:19:05,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:05,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,889 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 16:19:05,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:05,892 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 16:19:05,894 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 16:19:05,894 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,921 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,923 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 16:19:05,923 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,930 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,932 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 16:19:05,932 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,934 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,943 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 16:19:05,944 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:05,949 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 16:19:05,950 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 16:19:05,951 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,952 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,954 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 2, 1] term [2021-06-11 16:19:05,986 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,989 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,990 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 16:19:05,991 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,992 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:05,996 INFO L147 QuantifierPusher]: treesize reduction 499, result has 19.9 percent of original size 124 [2021-06-11 16:19:05,997 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:19:05,997 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:05,999 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,000 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:19:06,000 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:06,002 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,003 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 16:19:06,003 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:06,006 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:06,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-06-11 16:19:06,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:06,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:06,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:06,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,023 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 16:19:06,030 INFO L147 QuantifierPusher]: treesize reduction 2009, result has 7.4 percent of original size 160 [2021-06-11 16:19:06,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:06,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:06,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:06,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:07,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:07,465 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:07,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:07,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:07,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 16:19:08,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:08,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:08,810 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2021-06-11 16:19:09,279 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2021-06-11 16:19:09,444 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-06-11 16:19:09,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:09,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:19:09,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:09,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,476 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 16:19:09,476 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:09,479 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,481 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 16:19:09,481 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:09,482 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 16:19:09,482 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 16:19:09,482 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:09,486 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,487 INFO L147 QuantifierPusher]: treesize reduction 100, result has 38.7 percent of original size 63 [2021-06-11 16:19:09,488 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 16:19:09,489 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:19:09,491 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,493 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 16:19:09,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:09,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:09,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:09,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:09,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:09,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:09,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:09,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:10,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:10,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:10,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,343 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:10,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:19:10,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:19:10,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:10,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:10,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:19:10,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:19:10,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:10,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:10,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:19:10,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 16:19:11,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:11,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:13,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:13,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:13,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,693 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:13,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:19:13,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:19:13,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:13,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,809 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:13,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:13,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:13,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:13,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:13,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:13,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:13,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,003 INFO L147 QuantifierPusher]: treesize reduction 74, result has 28.2 percent of original size 29 [2021-06-11 16:19:14,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,203 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:14,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:14,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:14,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:14,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:14,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:14,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:19:14,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:19:14,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:14,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:15,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:15,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:15,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:15,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:15,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 16:19:15,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:15,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:19:15,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:15,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 16:19:15,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 16:19:15,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:15,504 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 16:19:15,618 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 16:19:15,740 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 16:19:15,856 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 16:19:15,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:15,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:15,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:19:15,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:19:16,478 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2021-06-11 16:19:16,765 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-06-11 16:19:17,341 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2021-06-11 16:19:17,637 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2021-06-11 16:19:17,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,648 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:17,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:17,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:19:17,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:19:17,650 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:17,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:17,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:19:17,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 16:19:17,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:19:17,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 16:19:17,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:19:17,669 INFO L163 LiptonReduction]: Checked pairs total: 2685 [2021-06-11 16:19:17,670 INFO L165 LiptonReduction]: Total number of compositions: 81 [2021-06-11 16:19:17,672 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21049 [2021-06-11 16:19:17,679 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-06-11 16:19:17,680 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:19:17,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:17,680 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:17,681 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:17,684 INFO L82 PathProgramCache]: Analyzing trace with hash 210008337, now seen corresponding path program 1 times [2021-06-11 16:19:17,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:17,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176421176] [2021-06-11 16:19:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:17,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:17,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:17,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-06-11 16:19:17,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176421176] [2021-06-11 16:19:17,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:17,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:19:17,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508076056] [2021-06-11 16:19:17,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-11 16:19:17,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-11 16:19:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-11 16:19:17,816 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 193 [2021-06-11 16:19:17,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:17,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:17,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 193 [2021-06-11 16:19:17,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:17,825 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-06-11 16:19:17,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:19:17,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-06-11 16:19:17,826 INFO L132 encePairwiseOnDemand]: 192/193 looper letters, 0 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2021-06-11 16:19:17,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 47 flow [2021-06-11 16:19:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-11 16:19:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-06-11 16:19:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 371 transitions. [2021-06-11 16:19:17,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.961139896373057 [2021-06-11 16:19:17,836 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 371 transitions. [2021-06-11 16:19:17,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 371 transitions. [2021-06-11 16:19:17,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:17,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 371 transitions. [2021-06-11 16:19:17,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:17,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:17,847 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:17,848 INFO L185 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 371 transitions. [2021-06-11 16:19:17,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 47 flow [2021-06-11 16:19:17,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 44 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:19:17,851 INFO L241 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2021-06-11 16:19:17,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2021-06-11 16:19:17,853 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2021-06-11 16:19:17,853 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:17,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2021-06-11 16:19:17,854 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 19 transitions, 44 flow [2021-06-11 16:19:17,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2021-06-11 16:19:17,858 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-06-11 16:19:17,858 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:19:17,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-06-11 16:19:17,859 INFO L151 LiptonReduction]: Number of co-enabled transitions 162 [2021-06-11 16:19:17,860 INFO L163 LiptonReduction]: Checked pairs total: 198 [2021-06-11 16:19:17,860 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:17,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 16:19:17,861 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2021-06-11 16:19:17,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:17,861 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:17,862 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:17,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 16:19:17,862 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:17,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:17,862 INFO L82 PathProgramCache]: Analyzing trace with hash -45446504, now seen corresponding path program 1 times [2021-06-11 16:19:17,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:17,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186728239] [2021-06-11 16:19:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:17,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:18,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:18,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186728239] [2021-06-11 16:19:18,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:18,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:19:18,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662762662] [2021-06-11 16:19:18,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:19:18,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:19:18,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:19:18,011 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2021-06-11 16:19:18,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:18,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2021-06-11 16:19:18,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:18,024 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-06-11 16:19:18,025 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:19:18,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 29 events. 3/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 40. Up to 10 conditions per place. [2021-06-11 16:19:18,025 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 3 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-06-11 16:19:18,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 60 flow [2021-06-11 16:19:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:19:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:19:18,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-06-11 16:19:18,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8981001727115717 [2021-06-11 16:19:18,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-06-11 16:19:18,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-06-11 16:19:18,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:18,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-06-11 16:19:18,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,033 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 520 transitions. [2021-06-11 16:19:18,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 60 flow [2021-06-11 16:19:18,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 16:19:18,034 INFO L241 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2021-06-11 16:19:18,034 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2021-06-11 16:19:18,035 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2021-06-11 16:19:18,035 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:18,035 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 63 flow [2021-06-11 16:19:18,036 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 63 flow [2021-06-11 16:19:18,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 63 flow [2021-06-11 16:19:18,041 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-06-11 16:19:18,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:19:18,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 29 events. 3/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-06-11 16:19:18,042 INFO L151 LiptonReduction]: Number of co-enabled transitions 176 [2021-06-11 16:19:18,044 INFO L163 LiptonReduction]: Checked pairs total: 156 [2021-06-11 16:19:18,044 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:18,044 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 16:19:18,045 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2021-06-11 16:19:18,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,045 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:18,045 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:18,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 16:19:18,046 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1408841289, now seen corresponding path program 1 times [2021-06-11 16:19:18,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:18,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540471604] [2021-06-11 16:19:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:18,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:18,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:19:18,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:18,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 16:19:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:18,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540471604] [2021-06-11 16:19:18,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:18,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:19:18,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638868479] [2021-06-11 16:19:18,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:19:18,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:19:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:19:18,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2021-06-11 16:19:18,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:18,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2021-06-11 16:19:18,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:18,198 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-06-11 16:19:18,198 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 16:19:18,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 29 events. 3/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-06-11 16:19:18,199 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-06-11 16:19:18,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 69 flow [2021-06-11 16:19:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:19:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:19:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2021-06-11 16:19:18,201 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8670120898100173 [2021-06-11 16:19:18,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2021-06-11 16:19:18,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2021-06-11 16:19:18,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:18,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2021-06-11 16:19:18,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,204 INFO L185 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 502 transitions. [2021-06-11 16:19:18,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 69 flow [2021-06-11 16:19:18,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 66 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:19:18,205 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2021-06-11 16:19:18,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2021-06-11 16:19:18,205 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2021-06-11 16:19:18,206 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:18,206 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 68 flow [2021-06-11 16:19:18,206 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 68 flow [2021-06-11 16:19:18,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 68 flow [2021-06-11 16:19:18,211 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-06-11 16:19:18,211 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 16:19:18,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 27 events. 3/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 43. Up to 10 conditions per place. [2021-06-11 16:19:18,211 INFO L151 LiptonReduction]: Number of co-enabled transitions 174 [2021-06-11 16:19:18,213 INFO L163 LiptonReduction]: Checked pairs total: 138 [2021-06-11 16:19:18,213 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:18,213 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 16:19:18,214 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2021-06-11 16:19:18,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,214 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:18,215 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:18,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 16:19:18,215 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 225196209, now seen corresponding path program 1 times [2021-06-11 16:19:18,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:18,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274740739] [2021-06-11 16:19:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:18,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:18,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:19:18,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:18,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 16:19:18,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:18,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:19:18,368 INFO L142 QuantifierPusher]: treesize reduction 60, result has 33.3 percent of original size [2021-06-11 16:19:18,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-06-11 16:19:18,384 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-06-11 16:19:18,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:19:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:18,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274740739] [2021-06-11 16:19:18,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:18,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:19:18,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082454621] [2021-06-11 16:19:18,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:19:18,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:18,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:19:18,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:19:18,396 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 193 [2021-06-11 16:19:18,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:18,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 193 [2021-06-11 16:19:18,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:18,581 INFO L129 PetriNetUnfolder]: 98/215 cut-off events. [2021-06-11 16:19:18,581 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-06-11 16:19:18,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 215 events. 98/215 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 912 event pairs, 43 based on Foata normal form. 8/220 useless extension candidates. Maximal degree in co-relation 459. Up to 121 conditions per place. [2021-06-11 16:19:18,583 INFO L132 encePairwiseOnDemand]: 189/193 looper letters, 14 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2021-06-11 16:19:18,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 123 flow [2021-06-11 16:19:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:19:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:19:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2021-06-11 16:19:18,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6204663212435233 [2021-06-11 16:19:18,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2021-06-11 16:19:18,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2021-06-11 16:19:18,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:18,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2021-06-11 16:19:18,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:18,589 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 4 states and 479 transitions. [2021-06-11 16:19:18,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 123 flow [2021-06-11 16:19:18,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 117 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:19:18,591 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 86 flow [2021-06-11 16:19:18,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-06-11 16:19:18,591 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2021-06-11 16:19:18,591 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:18,592 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 86 flow [2021-06-11 16:19:18,592 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 86 flow [2021-06-11 16:19:18,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 86 flow [2021-06-11 16:19:18,597 INFO L129 PetriNetUnfolder]: 5/36 cut-off events. [2021-06-11 16:19:18,598 INFO L130 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2021-06-11 16:19:18,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 36 events. 5/36 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 65. Up to 13 conditions per place. [2021-06-11 16:19:18,598 INFO L151 LiptonReduction]: Number of co-enabled transitions 190 [2021-06-11 16:19:19,210 INFO L163 LiptonReduction]: Checked pairs total: 120 [2021-06-11 16:19:19,210 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:19,210 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 619 [2021-06-11 16:19:19,211 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 86 flow [2021-06-11 16:19:19,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,212 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:19,212 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:19,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 16:19:19,212 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash -421452636, now seen corresponding path program 1 times [2021-06-11 16:19:19,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:19,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356358083] [2021-06-11 16:19:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:19,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:19,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:19,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:19,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:19:19,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:19,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:19,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356358083] [2021-06-11 16:19:19,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:19,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:19:19,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535458869] [2021-06-11 16:19:19,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:19:19,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:19:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:19:19,285 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2021-06-11 16:19:19,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:19,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2021-06-11 16:19:19,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:19,330 INFO L129 PetriNetUnfolder]: 52/137 cut-off events. [2021-06-11 16:19:19,330 INFO L130 PetriNetUnfolder]: For 36/38 co-relation queries the response was YES. [2021-06-11 16:19:19,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 137 events. 52/137 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 639 event pairs, 21 based on Foata normal form. 13/137 useless extension candidates. Maximal degree in co-relation 292. Up to 73 conditions per place. [2021-06-11 16:19:19,331 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 8 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2021-06-11 16:19:19,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 138 flow [2021-06-11 16:19:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:19:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:19:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 843 transitions. [2021-06-11 16:19:19,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8735751295336788 [2021-06-11 16:19:19,334 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 843 transitions. [2021-06-11 16:19:19,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 843 transitions. [2021-06-11 16:19:19,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:19,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 843 transitions. [2021-06-11 16:19:19,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,339 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,339 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 86 flow. Second operand 5 states and 843 transitions. [2021-06-11 16:19:19,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 138 flow [2021-06-11 16:19:19,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:19:19,341 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 143 flow [2021-06-11 16:19:19,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-06-11 16:19:19,341 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2021-06-11 16:19:19,341 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:19,341 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 143 flow [2021-06-11 16:19:19,342 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 143 flow [2021-06-11 16:19:19,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 143 flow [2021-06-11 16:19:19,355 INFO L129 PetriNetUnfolder]: 48/122 cut-off events. [2021-06-11 16:19:19,355 INFO L130 PetriNetUnfolder]: For 79/85 co-relation queries the response was YES. [2021-06-11 16:19:19,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 122 events. 48/122 cut-off events. For 79/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 517 event pairs, 19 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 329. Up to 75 conditions per place. [2021-06-11 16:19:19,356 INFO L151 LiptonReduction]: Number of co-enabled transitions 266 [2021-06-11 16:19:19,359 INFO L163 LiptonReduction]: Checked pairs total: 162 [2021-06-11 16:19:19,359 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:19,359 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-06-11 16:19:19,360 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 143 flow [2021-06-11 16:19:19,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,361 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:19,361 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:19,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 16:19:19,361 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash 515983432, now seen corresponding path program 1 times [2021-06-11 16:19:19,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:19,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070997804] [2021-06-11 16:19:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:19,473 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 16:19:19,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:19:19,504 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-06-11 16:19:19,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 16:19:19,537 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-06-11 16:19:19,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-06-11 16:19:19,573 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-06-11 16:19:19,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 16:19:19,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:19,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:19:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:19,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070997804] [2021-06-11 16:19:19,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:19,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:19:19,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600894241] [2021-06-11 16:19:19,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 16:19:19,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 16:19:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 16:19:19,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 193 [2021-06-11 16:19:19,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:19,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 193 [2021-06-11 16:19:19,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:19,971 INFO L129 PetriNetUnfolder]: 239/533 cut-off events. [2021-06-11 16:19:19,971 INFO L130 PetriNetUnfolder]: For 571/686 co-relation queries the response was YES. [2021-06-11 16:19:19,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 533 events. 239/533 cut-off events. For 571/686 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3196 event pairs, 83 based on Foata normal form. 42/534 useless extension candidates. Maximal degree in co-relation 1548. Up to 240 conditions per place. [2021-06-11 16:19:19,975 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 12 selfloop transitions, 12 changer transitions 14/56 dead transitions. [2021-06-11 16:19:19,975 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 312 flow [2021-06-11 16:19:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 16:19:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 16:19:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1086 transitions. [2021-06-11 16:19:19,980 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7033678756476683 [2021-06-11 16:19:19,980 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1086 transitions. [2021-06-11 16:19:19,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1086 transitions. [2021-06-11 16:19:19,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:19,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1086 transitions. [2021-06-11 16:19:19,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.75) internal successors, (1086), 8 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-06-11 16:19:19,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,987 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:19,987 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 143 flow. Second operand 8 states and 1086 transitions. [2021-06-11 16:19:19,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 312 flow [2021-06-11 16:19:19,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:19:19,991 INFO L241 Difference]: Finished difference. Result has 50 places, 39 transitions, 221 flow [2021-06-11 16:19:19,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2021-06-11 16:19:19,991 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2021-06-11 16:19:19,991 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:19,992 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 221 flow [2021-06-11 16:19:19,992 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 221 flow [2021-06-11 16:19:19,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 221 flow [2021-06-11 16:19:20,050 INFO L129 PetriNetUnfolder]: 155/404 cut-off events. [2021-06-11 16:19:20,050 INFO L130 PetriNetUnfolder]: For 535/582 co-relation queries the response was YES. [2021-06-11 16:19:20,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 404 events. 155/404 cut-off events. For 535/582 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2590 event pairs, 66 based on Foata normal form. 18/393 useless extension candidates. Maximal degree in co-relation 1218. Up to 203 conditions per place. [2021-06-11 16:19:20,056 INFO L151 LiptonReduction]: Number of co-enabled transitions 360 [2021-06-11 16:19:20,061 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:19:20,062 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:20,062 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-06-11 16:19:20,063 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 221 flow [2021-06-11 16:19:20,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,063 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:20,063 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:20,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 16:19:20,064 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1199114142, now seen corresponding path program 2 times [2021-06-11 16:19:20,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:20,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246413776] [2021-06-11 16:19:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:20,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:20,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:20,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:19:20,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:20,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246413776] [2021-06-11 16:19:20,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:20,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:19:20,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178536726] [2021-06-11 16:19:20,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:19:20,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:19:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:19:20,195 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2021-06-11 16:19:20,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:20,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2021-06-11 16:19:20,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:20,288 INFO L129 PetriNetUnfolder]: 86/266 cut-off events. [2021-06-11 16:19:20,288 INFO L130 PetriNetUnfolder]: For 643/1156 co-relation queries the response was YES. [2021-06-11 16:19:20,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 266 events. 86/266 cut-off events. For 643/1156 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1535 event pairs, 13 based on Foata normal form. 156/405 useless extension candidates. Maximal degree in co-relation 931. Up to 151 conditions per place. [2021-06-11 16:19:20,291 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 6 selfloop transitions, 15 changer transitions 5/48 dead transitions. [2021-06-11 16:19:20,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 318 flow [2021-06-11 16:19:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:19:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:19:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1180 transitions. [2021-06-11 16:19:20,294 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8734270910436713 [2021-06-11 16:19:20,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1180 transitions. [2021-06-11 16:19:20,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1180 transitions. [2021-06-11 16:19:20,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:20,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1180 transitions. [2021-06-11 16:19:20,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 168.57142857142858) internal successors, (1180), 7 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,301 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,301 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 221 flow. Second operand 7 states and 1180 transitions. [2021-06-11 16:19:20,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 318 flow [2021-06-11 16:19:20,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 16:19:20,304 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 298 flow [2021-06-11 16:19:20,305 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-06-11 16:19:20,305 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2021-06-11 16:19:20,305 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:20,305 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 298 flow [2021-06-11 16:19:20,305 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 298 flow [2021-06-11 16:19:20,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 298 flow [2021-06-11 16:19:20,335 INFO L129 PetriNetUnfolder]: 62/204 cut-off events. [2021-06-11 16:19:20,335 INFO L130 PetriNetUnfolder]: For 615/687 co-relation queries the response was YES. [2021-06-11 16:19:20,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 204 events. 62/204 cut-off events. For 615/687 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1142 event pairs, 17 based on Foata normal form. 15/212 useless extension candidates. Maximal degree in co-relation 769. Up to 100 conditions per place. [2021-06-11 16:19:20,338 INFO L151 LiptonReduction]: Number of co-enabled transitions 350 [2021-06-11 16:19:20,342 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:19:20,342 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:20,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-06-11 16:19:20,343 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 298 flow [2021-06-11 16:19:20,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:20,344 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:20,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 16:19:20,344 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1143007994, now seen corresponding path program 1 times [2021-06-11 16:19:20,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:20,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745302777] [2021-06-11 16:19:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:20,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:20,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:20,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:20,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:19:20,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:20,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745302777] [2021-06-11 16:19:20,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:20,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:19:20,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756437067] [2021-06-11 16:19:20,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:19:20,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:19:20,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:19:20,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2021-06-11 16:19:20,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:20,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2021-06-11 16:19:20,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:20,552 INFO L129 PetriNetUnfolder]: 48/168 cut-off events. [2021-06-11 16:19:20,553 INFO L130 PetriNetUnfolder]: For 1110/1922 co-relation queries the response was YES. [2021-06-11 16:19:20,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 168 events. 48/168 cut-off events. For 1110/1922 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 866 event pairs, 6 based on Foata normal form. 140/298 useless extension candidates. Maximal degree in co-relation 702. Up to 88 conditions per place. [2021-06-11 16:19:20,555 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 2 selfloop transitions, 19 changer transitions 3/46 dead transitions. [2021-06-11 16:19:20,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 46 transitions, 363 flow [2021-06-11 16:19:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:19:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:19:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1511 transitions. [2021-06-11 16:19:20,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8698906160046056 [2021-06-11 16:19:20,559 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1511 transitions. [2021-06-11 16:19:20,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1511 transitions. [2021-06-11 16:19:20,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:20,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1511 transitions. [2021-06-11 16:19:20,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.88888888888889) internal successors, (1511), 9 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,566 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,566 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 298 flow. Second operand 9 states and 1511 transitions. [2021-06-11 16:19:20,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 46 transitions, 363 flow [2021-06-11 16:19:20,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 315 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-06-11 16:19:20,571 INFO L241 Difference]: Finished difference. Result has 60 places, 43 transitions, 298 flow [2021-06-11 16:19:20,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2021-06-11 16:19:20,571 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2021-06-11 16:19:20,571 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:20,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 43 transitions, 298 flow [2021-06-11 16:19:20,572 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 43 transitions, 298 flow [2021-06-11 16:19:20,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 43 transitions, 298 flow [2021-06-11 16:19:20,591 INFO L129 PetriNetUnfolder]: 49/174 cut-off events. [2021-06-11 16:19:20,592 INFO L130 PetriNetUnfolder]: For 529/551 co-relation queries the response was YES. [2021-06-11 16:19:20,592 INFO L84 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 174 events. 49/174 cut-off events. For 529/551 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 975 event pairs, 11 based on Foata normal form. 9/176 useless extension candidates. Maximal degree in co-relation 623. Up to 41 conditions per place. [2021-06-11 16:19:20,594 INFO L151 LiptonReduction]: Number of co-enabled transitions 328 [2021-06-11 16:19:20,599 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:19:20,599 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:20,599 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-06-11 16:19:20,599 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 298 flow [2021-06-11 16:19:20,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:20,600 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:20,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 16:19:20,600 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1454533447, now seen corresponding path program 1 times [2021-06-11 16:19:20,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:20,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634650729] [2021-06-11 16:19:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:20,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:19:20,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:19:20,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:19:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:20,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634650729] [2021-06-11 16:19:20,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:20,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:19:20,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641676270] [2021-06-11 16:19:20,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:19:20,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:19:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:19:20,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2021-06-11 16:19:20,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:20,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2021-06-11 16:19:20,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:20,697 INFO L129 PetriNetUnfolder]: 68/235 cut-off events. [2021-06-11 16:19:20,698 INFO L130 PetriNetUnfolder]: For 877/986 co-relation queries the response was YES. [2021-06-11 16:19:20,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 235 events. 68/235 cut-off events. For 877/986 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1420 event pairs, 6 based on Foata normal form. 12/231 useless extension candidates. Maximal degree in co-relation 887. Up to 65 conditions per place. [2021-06-11 16:19:20,700 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 3 selfloop transitions, 3 changer transitions 2/43 dead transitions. [2021-06-11 16:19:20,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 43 transitions, 310 flow [2021-06-11 16:19:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:19:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:19:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2021-06-11 16:19:20,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8963730569948186 [2021-06-11 16:19:20,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2021-06-11 16:19:20,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2021-06-11 16:19:20,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:20,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2021-06-11 16:19:20,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,705 INFO L185 Difference]: Start difference. First operand has 59 places, 43 transitions, 298 flow. Second operand 3 states and 519 transitions. [2021-06-11 16:19:20,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 43 transitions, 310 flow [2021-06-11 16:19:20,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 250 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-06-11 16:19:20,710 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 234 flow [2021-06-11 16:19:20,711 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2021-06-11 16:19:20,711 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2021-06-11 16:19:20,711 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:20,711 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 41 transitions, 234 flow [2021-06-11 16:19:20,711 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 41 transitions, 234 flow [2021-06-11 16:19:20,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 234 flow [2021-06-11 16:19:20,735 INFO L129 PetriNetUnfolder]: 55/215 cut-off events. [2021-06-11 16:19:20,735 INFO L130 PetriNetUnfolder]: For 326/345 co-relation queries the response was YES. [2021-06-11 16:19:20,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 215 events. 55/215 cut-off events. For 326/345 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1317 event pairs, 14 based on Foata normal form. 12/219 useless extension candidates. Maximal degree in co-relation 659. Up to 49 conditions per place. [2021-06-11 16:19:20,738 INFO L151 LiptonReduction]: Number of co-enabled transitions 304 [2021-06-11 16:19:20,741 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:19:20,741 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:20,741 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-06-11 16:19:20,742 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 234 flow [2021-06-11 16:19:20,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:20,742 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:20,742 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:20,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 16:19:20,742 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1407697421, now seen corresponding path program 2 times [2021-06-11 16:19:20,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:20,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867960062] [2021-06-11 16:19:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:19:20,881 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.6 percent of original size [2021-06-11 16:19:20,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-06-11 16:19:20,947 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.9 percent of original size [2021-06-11 16:19:20,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2021-06-11 16:19:21,020 INFO L142 QuantifierPusher]: treesize reduction 9, result has 85.2 percent of original size [2021-06-11 16:19:21,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-11 16:19:21,063 INFO L142 QuantifierPusher]: treesize reduction 3, result has 96.8 percent of original size [2021-06-11 16:19:21,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 91 [2021-06-11 16:19:21,130 INFO L142 QuantifierPusher]: treesize reduction 3, result has 95.3 percent of original size [2021-06-11 16:19:21,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-06-11 16:19:21,172 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.1 percent of original size [2021-06-11 16:19:21,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:19:21,191 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size [2021-06-11 16:19:21,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 16:19:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:19:21,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867960062] [2021-06-11 16:19:21,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:19:21,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 16:19:21,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138251319] [2021-06-11 16:19:21,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 16:19:21,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:19:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 16:19:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-11 16:19:21,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 193 [2021-06-11 16:19:21,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:21,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:19:21,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 193 [2021-06-11 16:19:21,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:19:21,808 INFO L129 PetriNetUnfolder]: 117/478 cut-off events. [2021-06-11 16:19:21,809 INFO L130 PetriNetUnfolder]: For 1043/1170 co-relation queries the response was YES. [2021-06-11 16:19:21,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 478 events. 117/478 cut-off events. For 1043/1170 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 3921 event pairs, 3 based on Foata normal form. 48/507 useless extension candidates. Maximal degree in co-relation 1614. Up to 119 conditions per place. [2021-06-11 16:19:21,812 INFO L132 encePairwiseOnDemand]: 187/193 looper letters, 10 selfloop transitions, 4 changer transitions 22/58 dead transitions. [2021-06-11 16:19:21,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 404 flow [2021-06-11 16:19:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 16:19:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 16:19:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 934 transitions. [2021-06-11 16:19:21,815 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6049222797927462 [2021-06-11 16:19:21,815 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 934 transitions. [2021-06-11 16:19:21,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 934 transitions. [2021-06-11 16:19:21,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:19:21,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 934 transitions. [2021-06-11 16:19:21,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:21,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:21,821 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:21,821 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 234 flow. Second operand 8 states and 934 transitions. [2021-06-11 16:19:21,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 404 flow [2021-06-11 16:19:21,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 399 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 16:19:21,829 INFO L241 Difference]: Finished difference. Result has 63 places, 34 transitions, 208 flow [2021-06-11 16:19:21,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=63, PETRI_TRANSITIONS=34} [2021-06-11 16:19:21,830 INFO L343 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2021-06-11 16:19:21,830 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:19:21,830 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 34 transitions, 208 flow [2021-06-11 16:19:21,830 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 34 transitions, 208 flow [2021-06-11 16:19:21,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 34 transitions, 208 flow [2021-06-11 16:19:21,839 INFO L129 PetriNetUnfolder]: 15/68 cut-off events. [2021-06-11 16:19:21,839 INFO L130 PetriNetUnfolder]: For 118/127 co-relation queries the response was YES. [2021-06-11 16:19:21,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 68 events. 15/68 cut-off events. For 118/127 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 252 event pairs, 1 based on Foata normal form. 4/69 useless extension candidates. Maximal degree in co-relation 221. Up to 19 conditions per place. [2021-06-11 16:19:21,840 INFO L151 LiptonReduction]: Number of co-enabled transitions 116 [2021-06-11 16:19:21,843 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:19:21,843 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:19:21,843 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-06-11 16:19:21,844 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 34 transitions, 208 flow [2021-06-11 16:19:21,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:19:21,845 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:19:21,845 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:19:21,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 16:19:21,845 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:19:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:19:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1164015075, now seen corresponding path program 3 times [2021-06-11 16:19:21,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:19:21,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457829934] [2021-06-11 16:19:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:19:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:19:21,911 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:19:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:19:22,014 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:19:22,058 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:19:22,058 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:19:22,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 16:19:22,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:19:22 BasicIcfg [2021-06-11 16:19:22,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:19:22,173 INFO L168 Benchmark]: Toolchain (without parser) took 28792.20 ms. Allocated memory was 377.5 MB in the beginning and 702.5 MB in the end (delta: 325.1 MB). Free memory was 339.1 MB in the beginning and 519.8 MB in the end (delta: -180.7 MB). Peak memory consumption was 148.6 MB. Max. memory is 16.0 GB. [2021-06-11 16:19:22,176 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 377.5 MB. Free memory was 357.7 MB in the beginning and 357.6 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:19:22,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.37 ms. Allocated memory is still 377.5 MB. Free memory was 338.9 MB in the beginning and 334.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:19:22,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.00 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 332.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:19:22,176 INFO L168 Benchmark]: Boogie Preprocessor took 31.88 ms. Allocated memory is still 377.5 MB. Free memory was 332.0 MB in the beginning and 329.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:19:22,177 INFO L168 Benchmark]: RCFGBuilder took 2425.79 ms. Allocated memory was 377.5 MB in the beginning and 484.4 MB in the end (delta: 107.0 MB). Free memory was 329.9 MB in the beginning and 445.1 MB in the end (delta: -115.1 MB). Peak memory consumption was 172.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:19:22,177 INFO L168 Benchmark]: TraceAbstraction took 25777.35 ms. Allocated memory was 484.4 MB in the beginning and 702.5 MB in the end (delta: 218.1 MB). Free memory was 445.1 MB in the beginning and 519.8 MB in the end (delta: -74.7 MB). Peak memory consumption was 143.4 MB. Max. memory is 16.0 GB. [2021-06-11 16:19:22,183 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.15 ms. Allocated memory is still 377.5 MB. Free memory was 357.7 MB in the beginning and 357.6 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 505.37 ms. Allocated memory is still 377.5 MB. Free memory was 338.9 MB in the beginning and 334.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.00 ms. Allocated memory is still 377.5 MB. Free memory was 334.1 MB in the beginning and 332.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.88 ms. Allocated memory is still 377.5 MB. Free memory was 332.0 MB in the beginning and 329.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2425.79 ms. Allocated memory was 377.5 MB in the beginning and 484.4 MB in the end (delta: 107.0 MB). Free memory was 329.9 MB in the beginning and 445.1 MB in the end (delta: -115.1 MB). Peak memory consumption was 172.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25777.35 ms. Allocated memory was 484.4 MB in the beginning and 702.5 MB in the end (delta: 218.1 MB). Free memory was 445.1 MB in the beginning and 519.8 MB in the end (delta: -74.7 MB). Peak memory consumption was 143.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21031.9ms, 106 PlacesBefore, 29 PlacesAfterwards, 97 TransitionsBefore, 20 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 8 FixpointIterations, 53 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 81 TotalNumberOfCompositions, 2685 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1307, positive: 1160, positive conditional: 1160, positive unconditional: 0, negative: 147, negative conditional: 147, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1307, positive: 1160, positive conditional: 0, positive unconditional: 1160, negative: 147, negative conditional: 0, negative unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1307, positive: 1160, positive conditional: 0, positive unconditional: 1160, negative: 147, negative conditional: 0, negative unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 785, positive: 748, positive conditional: 0, positive unconditional: 748, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 785, positive: 721, positive conditional: 0, positive unconditional: 721, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10122, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 484, negative conditional: 0, negative unconditional: 484, unknown: 9560, unknown conditional: 0, unknown unconditional: 9560] ], Cache Queries: [ total: 1307, positive: 412, positive conditional: 0, positive unconditional: 412, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 785, unknown conditional: 0, unknown unconditional: 785] , Statistics on independence cache: Total cache size (in pairs): 785, Positive cache size: 748, Positive conditional cache size: 0, Positive unconditional cache size: 748, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4ms, 27 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 79, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 790, Positive cache size: 753, Positive conditional cache size: 0, Positive unconditional cache size: 753, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3ms, 29 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 156 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 62, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 758, Positive conditional cache size: 0, Positive unconditional cache size: 758, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3ms, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 758, Positive conditional cache size: 0, Positive unconditional cache size: 758, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 618.4ms, 34 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 42, positive conditional: 4, positive unconditional: 38, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 42, positive conditional: 4, positive unconditional: 38, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 610, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 610, unknown conditional: 610, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 40, positive conditional: 4, positive unconditional: 36, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.7ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.7ms, 50 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.9ms, 56 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.2ms, 60 PlacesBefore, 59 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.0ms, 54 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.8ms, 63 PlacesBefore, 60 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 760, Positive conditional cache size: 0, Positive unconditional cache size: 760, Negative cache size: 38, Negative conditional cache size: 1, Negative unconditional cache size: 37, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=1, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25493.3ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1631.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21106.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33 SDtfs, 21 SDslu, 12 SDs, 0 SdLazy, 319 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 476.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1004.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=7, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.7ms SsaConstructionTime, 453.7ms SatisfiabilityAnalysisTime, 1125.2ms InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...