/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:44:12,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:44:12,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:44:13,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:44:13,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:44:13,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:44:13,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:44:13,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:44:13,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:44:13,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:44:13,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:44:13,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:44:13,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:44:13,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:44:13,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:44:13,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:44:13,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:44:13,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:44:13,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:44:13,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:44:13,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:44:13,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:44:13,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:44:13,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:44:13,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:44:13,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:44:13,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:44:13,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:44:13,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:44:13,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:44:13,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:44:13,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:44:13,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:44:13,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:44:13,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:44:13,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:44:13,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:44:13,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:44:13,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:44:13,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:44:13,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:44:13,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:44:13,120 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:44:13,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:44:13,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:44:13,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:44:13,124 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:44:13,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:44:13,124 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:44:13,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:44:13,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:44:13,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:44:13,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:44:13,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:44:13,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:44:13,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:44:13,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:44:13,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:44:13,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:44:13,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:44:13,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:44:13,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:44:13,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:44:13,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:44:13,128 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:44:13,128 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:44:13,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:44:13,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:44:13,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:44:13,460 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:44:13,460 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:44:13,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2021-03-25 14:44:13,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada5c843e/86d7781338a44e6ea020d5e2090e6f10/FLAGda9e70d55 [2021-03-25 14:44:14,033 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:44:14,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2021-03-25 14:44:14,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada5c843e/86d7781338a44e6ea020d5e2090e6f10/FLAGda9e70d55 [2021-03-25 14:44:14,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada5c843e/86d7781338a44e6ea020d5e2090e6f10 [2021-03-25 14:44:14,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:44:14,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:44:14,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:44:14,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:44:14,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:44:14,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:14,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cba8b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14, skipping insertion in model container [2021-03-25 14:44:14,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:14,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:44:14,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:44:14,586 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/rfi006_power.oepc.i[994,1007] [2021-03-25 14:44:14,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:44:14,805 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:44:14,816 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/rfi006_power.oepc.i[994,1007] [2021-03-25 14:44:14,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:44:14,916 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:44:14,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14 WrapperNode [2021-03-25 14:44:14,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:44:14,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:44:14,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:44:14,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:44:14,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:14,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:14,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:44:14,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:44:14,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:44:14,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:44:14,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:14,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:15,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:15,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:15,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:15,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:15,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... [2021-03-25 14:44:15,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:44:15,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:44:15,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:44:15,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:44:15,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:44:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 14:44:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:44:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:44:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:44:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:44:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:44:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:44:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:44:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:44:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:44:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:44:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:44:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:44:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:44:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:44:15,139 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:44:17,997 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:44:17,997 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 14:44:17,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:44:17 BoogieIcfgContainer [2021-03-25 14:44:17,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:44:18,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:44:18,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:44:18,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:44:18,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:44:14" (1/3) ... [2021-03-25 14:44:18,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56869967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:44:18, skipping insertion in model container [2021-03-25 14:44:18,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:44:14" (2/3) ... [2021-03-25 14:44:18,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56869967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:44:18, skipping insertion in model container [2021-03-25 14:44:18,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:44:17" (3/3) ... [2021-03-25 14:44:18,006 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2021-03-25 14:44:18,016 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:44:18,020 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 14:44:18,021 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,072 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,073 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,074 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,098 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,100 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,101 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,144 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,145 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,145 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,146 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:44:18,149 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:44:18,165 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-25 14:44:18,191 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:44:18,191 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:44:18,192 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:44:18,192 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:44:18,192 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:44:18,192 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:44:18,192 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:44:18,192 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:44:18,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2021-03-25 14:44:18,254 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-25 14:44:18,254 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:18,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-03-25 14:44:18,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2021-03-25 14:44:18,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 98 transitions, 205 flow [2021-03-25 14:44:18,274 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:18,283 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 98 transitions, 205 flow [2021-03-25 14:44:18,286 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 98 transitions, 205 flow [2021-03-25 14:44:18,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 98 transitions, 205 flow [2021-03-25 14:44:18,304 INFO L129 PetriNetUnfolder]: 1/98 cut-off events. [2021-03-25 14:44:18,304 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:18,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 1/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:44:18,307 INFO L142 LiptonReduction]: Number of co-enabled transitions 962 [2021-03-25 14:44:21,953 WARN L205 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-25 14:44:22,777 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 361 [2021-03-25 14:44:26,643 WARN L205 SmtUtils]: Spent 3.86 s on a formula simplification. DAG size of input: 566 DAG size of output: 531 [2021-03-25 14:44:30,079 WARN L205 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 527 DAG size of output: 525 [2021-03-25 14:44:30,460 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 14:44:30,901 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-25 14:44:31,039 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 14:44:34,785 INFO L154 LiptonReduction]: Checked pairs total: 1509 [2021-03-25 14:44:34,785 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-25 14:44:34,787 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16514 [2021-03-25 14:44:34,798 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2021-03-25 14:44:34,798 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:34,799 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:34,799 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:34,800 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 252207848, now seen corresponding path program 1 times [2021-03-25 14:44:34,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:34,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801357237] [2021-03-25 14:44:34,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:35,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:35,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:35,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:35,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:35,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:35,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:35,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801357237] [2021-03-25 14:44:35,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:35,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:44:35,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367165237] [2021-03-25 14:44:35,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:44:35,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:44:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:44:35,145 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 176 [2021-03-25 14:44:35,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:35,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:35,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 176 [2021-03-25 14:44:35,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:35,217 INFO L129 PetriNetUnfolder]: 14/77 cut-off events. [2021-03-25 14:44:35,217 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:44:35,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 77 events. 14/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 205 event pairs, 7 based on Foata normal form. 9/81 useless extension candidates. Maximal degree in co-relation 99. Up to 28 conditions per place. [2021-03-25 14:44:35,220 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 3 changer transitions 6/44 dead transitions. [2021-03-25 14:44:35,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 125 flow [2021-03-25 14:44:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:44:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:44:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2021-03-25 14:44:35,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9181818181818182 [2021-03-25 14:44:35,240 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 808 transitions. [2021-03-25 14:44:35,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions. [2021-03-25 14:44:35,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:35,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions. [2021-03-25 14:44:35,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.6) internal successors, (808), 5 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:35,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:35,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:35,264 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 5 states and 808 transitions. [2021-03-25 14:44:35,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 125 flow [2021-03-25 14:44:35,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:35,268 INFO L241 Difference]: Finished difference. Result has 50 places, 38 transitions, 105 flow [2021-03-25 14:44:35,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2021-03-25 14:44:35,271 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2021-03-25 14:44:35,271 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:35,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 105 flow [2021-03-25 14:44:35,272 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 38 transitions, 105 flow [2021-03-25 14:44:35,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 105 flow [2021-03-25 14:44:35,283 INFO L129 PetriNetUnfolder]: 5/49 cut-off events. [2021-03-25 14:44:35,284 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-25 14:44:35,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 49 events. 5/49 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 65. Up to 12 conditions per place. [2021-03-25 14:44:35,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 228 [2021-03-25 14:44:35,471 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-03-25 14:44:35,627 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-03-25 14:44:36,295 INFO L154 LiptonReduction]: Checked pairs total: 558 [2021-03-25 14:44:36,295 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 14:44:36,295 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1024 [2021-03-25 14:44:36,296 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 87 flow [2021-03-25 14:44:36,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:36,297 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:36,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:44:36,297 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1892599205, now seen corresponding path program 1 times [2021-03-25 14:44:36,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:36,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675933673] [2021-03-25 14:44:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:36,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:36,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:36,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:36,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:36,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675933673] [2021-03-25 14:44:36,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:36,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:44:36,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031698507] [2021-03-25 14:44:36,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:44:36,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:44:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:44:36,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 185 [2021-03-25 14:44:36,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:36,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 185 [2021-03-25 14:44:36,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:36,483 INFO L129 PetriNetUnfolder]: 5/47 cut-off events. [2021-03-25 14:44:36,483 INFO L130 PetriNetUnfolder]: For 25/29 co-relation queries the response was YES. [2021-03-25 14:44:36,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 47 events. 5/47 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 108 event pairs, 1 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 80. Up to 14 conditions per place. [2021-03-25 14:44:36,484 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 2 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2021-03-25 14:44:36,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 105 flow [2021-03-25 14:44:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:44:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:44:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2021-03-25 14:44:36,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9221621621621622 [2021-03-25 14:44:36,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2021-03-25 14:44:36,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2021-03-25 14:44:36,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:36,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2021-03-25 14:44:36,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,493 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:36,493 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 87 flow. Second operand 5 states and 853 transitions. [2021-03-25 14:44:36,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 105 flow [2021-03-25 14:44:36,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 98 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:44:36,494 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 92 flow [2021-03-25 14:44:36,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-25 14:44:36,495 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 14:44:36,495 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:36,495 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 92 flow [2021-03-25 14:44:36,496 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 29 transitions, 92 flow [2021-03-25 14:44:36,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 92 flow [2021-03-25 14:44:36,504 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:44:36,504 INFO L130 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2021-03-25 14:44:36,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 36 events. 3/36 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 56. Up to 9 conditions per place. [2021-03-25 14:44:36,505 INFO L142 LiptonReduction]: Number of co-enabled transitions 224 [2021-03-25 14:44:37,401 INFO L154 LiptonReduction]: Checked pairs total: 582 [2021-03-25 14:44:37,401 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:44:37,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 907 [2021-03-25 14:44:37,403 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 84 flow [2021-03-25 14:44:37,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:37,403 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:37,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:44:37,404 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:37,404 INFO L82 PathProgramCache]: Analyzing trace with hash 835886719, now seen corresponding path program 1 times [2021-03-25 14:44:37,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:37,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446063476] [2021-03-25 14:44:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:37,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:37,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:37,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:37,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:44:37,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:37,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:37,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446063476] [2021-03-25 14:44:37,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:37,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:44:37,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182767352] [2021-03-25 14:44:37,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:44:37,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:44:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:44:37,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 189 [2021-03-25 14:44:37,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:37,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 189 [2021-03-25 14:44:37,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:37,553 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:44:37,553 INFO L130 PetriNetUnfolder]: For 39/46 co-relation queries the response was YES. [2021-03-25 14:44:37,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 36 events. 3/36 cut-off events. For 39/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 3/37 useless extension candidates. Maximal degree in co-relation 70. Up to 11 conditions per place. [2021-03-25 14:44:37,554 INFO L132 encePairwiseOnDemand]: 184/189 looper letters, 2 selfloop transitions, 3 changer transitions 2/27 dead transitions. [2021-03-25 14:44:37,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 27 transitions, 106 flow [2021-03-25 14:44:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2021-03-25 14:44:37,560 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8915343915343915 [2021-03-25 14:44:37,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1011 transitions. [2021-03-25 14:44:37,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1011 transitions. [2021-03-25 14:44:37,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:37,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1011 transitions. [2021-03-25 14:44:37,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.5) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:37,565 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 84 flow. Second operand 6 states and 1011 transitions. [2021-03-25 14:44:37,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 27 transitions, 106 flow [2021-03-25 14:44:37,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 98 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:44:37,567 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 90 flow [2021-03-25 14:44:37,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-25 14:44:37,567 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2021-03-25 14:44:37,567 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:37,568 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 90 flow [2021-03-25 14:44:37,568 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 25 transitions, 90 flow [2021-03-25 14:44:37,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 90 flow [2021-03-25 14:44:37,574 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-25 14:44:37,574 INFO L130 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2021-03-25 14:44:37,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 32 events. 3/32 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 57. Up to 9 conditions per place. [2021-03-25 14:44:37,574 INFO L142 LiptonReduction]: Number of co-enabled transitions 220 [2021-03-25 14:44:37,926 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 14:44:38,097 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:44:38,436 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 14:44:38,592 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:44:39,311 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-25 14:44:39,589 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-25 14:44:40,159 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 159 [2021-03-25 14:44:40,468 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-25 14:44:40,471 INFO L154 LiptonReduction]: Checked pairs total: 528 [2021-03-25 14:44:40,471 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:44:40,471 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2904 [2021-03-25 14:44:40,472 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 84 flow [2021-03-25 14:44:40,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:40,473 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:40,473 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:40,473 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:44:40,473 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2095486645, now seen corresponding path program 1 times [2021-03-25 14:44:40,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:40,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046505326] [2021-03-25 14:44:40,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:40,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:40,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:44:40,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:44:40,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 14:44:40,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:44:40,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:44:40,727 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-03-25 14:44:40,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 14:44:40,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:40,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:40,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046505326] [2021-03-25 14:44:40,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:40,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 14:44:40,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182413803] [2021-03-25 14:44:40,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:44:40,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:40,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:44:40,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:44:40,753 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 191 [2021-03-25 14:44:40,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 84 flow. Second operand has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:40,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:40,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 191 [2021-03-25 14:44:40,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:40,980 INFO L129 PetriNetUnfolder]: 101/238 cut-off events. [2021-03-25 14:44:40,980 INFO L130 PetriNetUnfolder]: For 175/191 co-relation queries the response was YES. [2021-03-25 14:44:40,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 238 events. 101/238 cut-off events. For 175/191 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1091 event pairs, 25 based on Foata normal form. 12/227 useless extension candidates. Maximal degree in co-relation 578. Up to 97 conditions per place. [2021-03-25 14:44:40,983 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 15 selfloop transitions, 5 changer transitions 5/38 dead transitions. [2021-03-25 14:44:40,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 185 flow [2021-03-25 14:44:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2021-03-25 14:44:40,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6047120418848168 [2021-03-25 14:44:40,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 693 transitions. [2021-03-25 14:44:40,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions. [2021-03-25 14:44:40,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:40,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions. [2021-03-25 14:44:40,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:40,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:40,992 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:40,992 INFO L185 Difference]: Start difference. First operand has 37 places, 23 transitions, 84 flow. Second operand 6 states and 693 transitions. [2021-03-25 14:44:40,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 185 flow [2021-03-25 14:44:40,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 171 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-25 14:44:40,997 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 110 flow [2021-03-25 14:44:40,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2021-03-25 14:44:40,997 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2021-03-25 14:44:40,997 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:40,997 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 26 transitions, 110 flow [2021-03-25 14:44:40,997 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 110 flow [2021-03-25 14:44:40,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 110 flow [2021-03-25 14:44:41,006 INFO L129 PetriNetUnfolder]: 9/65 cut-off events. [2021-03-25 14:44:41,006 INFO L130 PetriNetUnfolder]: For 46/53 co-relation queries the response was YES. [2021-03-25 14:44:41,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 65 events. 9/65 cut-off events. For 46/53 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 143. Up to 20 conditions per place. [2021-03-25 14:44:41,007 INFO L142 LiptonReduction]: Number of co-enabled transitions 252 [2021-03-25 14:44:41,031 INFO L154 LiptonReduction]: Checked pairs total: 176 [2021-03-25 14:44:41,032 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:41,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 14:44:41,032 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 110 flow [2021-03-25 14:44:41,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:41,033 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:41,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:44:41,033 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash -569494680, now seen corresponding path program 1 times [2021-03-25 14:44:41,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:41,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830850896] [2021-03-25 14:44:41,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:41,147 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-25 14:44:41,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 14:44:41,188 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.4 percent of original size [2021-03-25 14:44:41,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 14:44:41,210 INFO L142 QuantifierPusher]: treesize reduction 2, result has 95.1 percent of original size [2021-03-25 14:44:41,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:44:41,238 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.3 percent of original size [2021-03-25 14:44:41,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:44:41,262 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.9 percent of original size [2021-03-25 14:44:41,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:44:41,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:41,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:41,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830850896] [2021-03-25 14:44:41,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:41,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:44:41,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002969723] [2021-03-25 14:44:41,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:44:41,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:41,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:44:41,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:44:41,298 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 191 [2021-03-25 14:44:41,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:41,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 191 [2021-03-25 14:44:41,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:41,542 INFO L129 PetriNetUnfolder]: 90/223 cut-off events. [2021-03-25 14:44:41,542 INFO L130 PetriNetUnfolder]: For 238/250 co-relation queries the response was YES. [2021-03-25 14:44:41,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 223 events. 90/223 cut-off events. For 238/250 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1066 event pairs, 14 based on Foata normal form. 17/226 useless extension candidates. Maximal degree in co-relation 583. Up to 89 conditions per place. [2021-03-25 14:44:41,545 INFO L132 encePairwiseOnDemand]: 186/191 looper letters, 14 selfloop transitions, 5 changer transitions 5/37 dead transitions. [2021-03-25 14:44:41,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 194 flow [2021-03-25 14:44:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2021-03-25 14:44:41,550 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6082024432809773 [2021-03-25 14:44:41,550 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2021-03-25 14:44:41,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2021-03-25 14:44:41,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:41,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2021-03-25 14:44:41,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,554 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,554 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 110 flow. Second operand 6 states and 697 transitions. [2021-03-25 14:44:41,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 194 flow [2021-03-25 14:44:41,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 185 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:41,560 INFO L241 Difference]: Finished difference. Result has 45 places, 27 transitions, 126 flow [2021-03-25 14:44:41,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2021-03-25 14:44:41,560 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2021-03-25 14:44:41,560 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:41,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 27 transitions, 126 flow [2021-03-25 14:44:41,561 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 27 transitions, 126 flow [2021-03-25 14:44:41,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 27 transitions, 126 flow [2021-03-25 14:44:41,569 INFO L129 PetriNetUnfolder]: 6/54 cut-off events. [2021-03-25 14:44:41,569 INFO L130 PetriNetUnfolder]: For 51/57 co-relation queries the response was YES. [2021-03-25 14:44:41,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 54 events. 6/54 cut-off events. For 51/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 203 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2021-03-25 14:44:41,570 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-25 14:44:41,572 INFO L154 LiptonReduction]: Checked pairs total: 182 [2021-03-25 14:44:41,572 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:41,572 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 14:44:41,574 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 126 flow [2021-03-25 14:44:41,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,574 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:41,574 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:41,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:44:41,574 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash -886619047, now seen corresponding path program 1 times [2021-03-25 14:44:41,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:41,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767419647] [2021-03-25 14:44:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:41,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:41,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:41,680 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:44:41,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:44:41,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:41,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:41,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767419647] [2021-03-25 14:44:41,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:41,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:44:41,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149099070] [2021-03-25 14:44:41,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:44:41,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:44:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:44:41,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 191 [2021-03-25 14:44:41,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:41,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 191 [2021-03-25 14:44:41,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:41,750 INFO L129 PetriNetUnfolder]: 79/208 cut-off events. [2021-03-25 14:44:41,750 INFO L130 PetriNetUnfolder]: For 159/169 co-relation queries the response was YES. [2021-03-25 14:44:41,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 208 events. 79/208 cut-off events. For 159/169 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1054 event pairs, 19 based on Foata normal form. 18/194 useless extension candidates. Maximal degree in co-relation 489. Up to 122 conditions per place. [2021-03-25 14:44:41,752 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 10 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-25 14:44:41,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 184 flow [2021-03-25 14:44:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:44:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:44:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2021-03-25 14:44:41,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8638743455497382 [2021-03-25 14:44:41,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2021-03-25 14:44:41,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2021-03-25 14:44:41,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:41,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2021-03-25 14:44:41,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,759 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,759 INFO L185 Difference]: Start difference. First operand has 43 places, 27 transitions, 126 flow. Second operand 5 states and 825 transitions. [2021-03-25 14:44:41,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 184 flow [2021-03-25 14:44:41,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 176 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:44:41,762 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 178 flow [2021-03-25 14:44:41,762 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-25 14:44:41,762 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2021-03-25 14:44:41,762 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:41,762 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 178 flow [2021-03-25 14:44:41,763 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 178 flow [2021-03-25 14:44:41,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 178 flow [2021-03-25 14:44:41,783 INFO L129 PetriNetUnfolder]: 54/162 cut-off events. [2021-03-25 14:44:41,783 INFO L130 PetriNetUnfolder]: For 173/189 co-relation queries the response was YES. [2021-03-25 14:44:41,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 162 events. 54/162 cut-off events. For 173/189 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 816 event pairs, 18 based on Foata normal form. 4/157 useless extension candidates. Maximal degree in co-relation 451. Up to 86 conditions per place. [2021-03-25 14:44:41,786 INFO L142 LiptonReduction]: Number of co-enabled transitions 354 [2021-03-25 14:44:41,797 INFO L154 LiptonReduction]: Checked pairs total: 357 [2021-03-25 14:44:41,797 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:44:41,797 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 14:44:41,801 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 172 flow [2021-03-25 14:44:41,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:41,802 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:41,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:44:41,802 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:41,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:41,803 INFO L82 PathProgramCache]: Analyzing trace with hash 120761837, now seen corresponding path program 1 times [2021-03-25 14:44:41,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:41,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687850680] [2021-03-25 14:44:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:41,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:41,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:41,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:41,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:41,912 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:44:41,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:44:41,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:41,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:41,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687850680] [2021-03-25 14:44:41,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:41,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:44:41,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959951462] [2021-03-25 14:44:41,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:44:41,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:44:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:44:41,923 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 191 [2021-03-25 14:44:41,924 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,924 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:41,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 191 [2021-03-25 14:44:41,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:41,986 INFO L129 PetriNetUnfolder]: 51/152 cut-off events. [2021-03-25 14:44:41,986 INFO L130 PetriNetUnfolder]: For 169/190 co-relation queries the response was YES. [2021-03-25 14:44:41,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 152 events. 51/152 cut-off events. For 169/190 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 689 event pairs, 2 based on Foata normal form. 26/168 useless extension candidates. Maximal degree in co-relation 493. Up to 83 conditions per place. [2021-03-25 14:44:41,988 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 8 selfloop transitions, 11 changer transitions 3/42 dead transitions. [2021-03-25 14:44:41,988 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 260 flow [2021-03-25 14:44:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 990 transitions. [2021-03-25 14:44:41,991 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8638743455497382 [2021-03-25 14:44:41,991 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 990 transitions. [2021-03-25 14:44:41,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 990 transitions. [2021-03-25 14:44:41,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:41,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 990 transitions. [2021-03-25 14:44:41,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:41,997 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 172 flow. Second operand 6 states and 990 transitions. [2021-03-25 14:44:41,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 260 flow [2021-03-25 14:44:41,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:44:42,000 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 236 flow [2021-03-25 14:44:42,000 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-25 14:44:42,000 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-25 14:44:42,000 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:42,000 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 236 flow [2021-03-25 14:44:42,000 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 236 flow [2021-03-25 14:44:42,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 236 flow [2021-03-25 14:44:42,013 INFO L129 PetriNetUnfolder]: 26/111 cut-off events. [2021-03-25 14:44:42,013 INFO L130 PetriNetUnfolder]: For 199/204 co-relation queries the response was YES. [2021-03-25 14:44:42,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 111 events. 26/111 cut-off events. For 199/204 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 494 event pairs, 2 based on Foata normal form. 2/109 useless extension candidates. Maximal degree in co-relation 381. Up to 57 conditions per place. [2021-03-25 14:44:42,015 INFO L142 LiptonReduction]: Number of co-enabled transitions 336 [2021-03-25 14:44:42,021 INFO L154 LiptonReduction]: Checked pairs total: 365 [2021-03-25 14:44:42,021 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:44:42,021 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 14:44:42,021 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 228 flow [2021-03-25 14:44:42,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,022 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:42,022 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:42,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:44:42,022 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash -822219777, now seen corresponding path program 1 times [2021-03-25 14:44:42,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:42,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836492072] [2021-03-25 14:44:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:42,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:42,141 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:44:42,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:44:42,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:42,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:42,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836492072] [2021-03-25 14:44:42,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:42,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:44:42,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960651314] [2021-03-25 14:44:42,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:44:42,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:42,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:44:42,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:44:42,153 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 191 [2021-03-25 14:44:42,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:42,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 191 [2021-03-25 14:44:42,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:42,225 INFO L129 PetriNetUnfolder]: 37/110 cut-off events. [2021-03-25 14:44:42,225 INFO L130 PetriNetUnfolder]: For 208/232 co-relation queries the response was YES. [2021-03-25 14:44:42,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 110 events. 37/110 cut-off events. For 208/232 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 414 event pairs, 0 based on Foata normal form. 20/122 useless extension candidates. Maximal degree in co-relation 402. Up to 57 conditions per place. [2021-03-25 14:44:42,227 INFO L132 encePairwiseOnDemand]: 185/191 looper letters, 5 selfloop transitions, 11 changer transitions 4/40 dead transitions. [2021-03-25 14:44:42,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 274 flow [2021-03-25 14:44:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:44:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:44:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1149 transitions. [2021-03-25 14:44:42,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8593866866118175 [2021-03-25 14:44:42,231 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1149 transitions. [2021-03-25 14:44:42,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1149 transitions. [2021-03-25 14:44:42,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:42,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1149 transitions. [2021-03-25 14:44:42,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.14285714285714) internal successors, (1149), 7 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,236 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:42,237 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 228 flow. Second operand 7 states and 1149 transitions. [2021-03-25 14:44:42,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 274 flow [2021-03-25 14:44:42,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 232 flow, removed 15 selfloop flow, removed 7 redundant places. [2021-03-25 14:44:42,239 INFO L241 Difference]: Finished difference. Result has 51 places, 34 transitions, 198 flow [2021-03-25 14:44:42,239 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2021-03-25 14:44:42,239 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-25 14:44:42,239 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:42,239 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 34 transitions, 198 flow [2021-03-25 14:44:42,240 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 34 transitions, 198 flow [2021-03-25 14:44:42,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 34 transitions, 198 flow [2021-03-25 14:44:42,285 INFO L129 PetriNetUnfolder]: 13/74 cut-off events. [2021-03-25 14:44:42,285 INFO L130 PetriNetUnfolder]: For 91/95 co-relation queries the response was YES. [2021-03-25 14:44:42,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 74 events. 13/74 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 0 based on Foata normal form. 2/75 useless extension candidates. Maximal degree in co-relation 215. Up to 20 conditions per place. [2021-03-25 14:44:42,287 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-25 14:44:42,408 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:44:42,653 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:44:42,836 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:44:43,335 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-25 14:44:43,484 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-25 14:44:43,745 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2021-03-25 14:44:44,008 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2021-03-25 14:44:44,012 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-25 14:44:44,013 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:44:44,013 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1774 [2021-03-25 14:44:44,013 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 182 flow [2021-03-25 14:44:44,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:44,014 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:44,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:44:44,014 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:44,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1462511635, now seen corresponding path program 1 times [2021-03-25 14:44:44,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:44,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479925006] [2021-03-25 14:44:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:44,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:44:44,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:44:44,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:44:44,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:44,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:44,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479925006] [2021-03-25 14:44:44,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:44,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:44:44,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794552453] [2021-03-25 14:44:44,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:44:44,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:44,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:44:44,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:44:44,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 194 [2021-03-25 14:44:44,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 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-03-25 14:44:44,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:44,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 194 [2021-03-25 14:44:44,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:44,311 INFO L129 PetriNetUnfolder]: 57/185 cut-off events. [2021-03-25 14:44:44,311 INFO L130 PetriNetUnfolder]: For 867/925 co-relation queries the response was YES. [2021-03-25 14:44:44,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 185 events. 57/185 cut-off events. For 867/925 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 962 event pairs, 10 based on Foata normal form. 27/201 useless extension candidates. Maximal degree in co-relation 583. Up to 53 conditions per place. [2021-03-25 14:44:44,313 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 7 changer transitions 2/36 dead transitions. [2021-03-25 14:44:44,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 36 transitions, 244 flow [2021-03-25 14:44:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:44:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:44:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2021-03-25 14:44:44,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6950171821305842 [2021-03-25 14:44:44,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2021-03-25 14:44:44,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2021-03-25 14:44:44,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:44,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2021-03-25 14:44:44,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,320 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,320 INFO L185 Difference]: Start difference. First operand has 46 places, 30 transitions, 182 flow. Second operand 6 states and 809 transitions. [2021-03-25 14:44:44,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 36 transitions, 244 flow [2021-03-25 14:44:44,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 196 flow, removed 15 selfloop flow, removed 7 redundant places. [2021-03-25 14:44:44,323 INFO L241 Difference]: Finished difference. Result has 47 places, 32 transitions, 179 flow [2021-03-25 14:44:44,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2021-03-25 14:44:44,323 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2021-03-25 14:44:44,323 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:44,323 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 32 transitions, 179 flow [2021-03-25 14:44:44,324 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 179 flow [2021-03-25 14:44:44,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 179 flow [2021-03-25 14:44:44,337 INFO L129 PetriNetUnfolder]: 29/110 cut-off events. [2021-03-25 14:44:44,337 INFO L130 PetriNetUnfolder]: For 230/250 co-relation queries the response was YES. [2021-03-25 14:44:44,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 110 events. 29/110 cut-off events. For 230/250 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 498 event pairs, 1 based on Foata normal form. 11/118 useless extension candidates. Maximal degree in co-relation 281. Up to 31 conditions per place. [2021-03-25 14:44:44,339 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-25 14:44:44,341 INFO L154 LiptonReduction]: Checked pairs total: 80 [2021-03-25 14:44:44,342 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:44,342 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 14:44:44,342 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 179 flow [2021-03-25 14:44:44,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 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-03-25 14:44:44,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:44,343 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:44,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:44:44,343 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:44,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1386411659, now seen corresponding path program 1 times [2021-03-25 14:44:44,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:44,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221256299] [2021-03-25 14:44:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:44,435 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 14:44:44,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:44:44,475 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 14:44:44,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:44:44,477 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-25 14:44:44,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 14:44:44,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:44:44,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:44:44,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:44:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:44,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221256299] [2021-03-25 14:44:44,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:44,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:44:44,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918534059] [2021-03-25 14:44:44,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:44:44,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:44:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:44:44,592 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 194 [2021-03-25 14:44:44,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:44,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 194 [2021-03-25 14:44:44,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:44,890 INFO L129 PetriNetUnfolder]: 56/200 cut-off events. [2021-03-25 14:44:44,890 INFO L130 PetriNetUnfolder]: For 627/676 co-relation queries the response was YES. [2021-03-25 14:44:44,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 200 events. 56/200 cut-off events. For 627/676 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1113 event pairs, 3 based on Foata normal form. 32/223 useless extension candidates. Maximal degree in co-relation 562. Up to 49 conditions per place. [2021-03-25 14:44:44,892 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 10 selfloop transitions, 10 changer transitions 1/39 dead transitions. [2021-03-25 14:44:44,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 251 flow [2021-03-25 14:44:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:44:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:44:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2021-03-25 14:44:44,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6472754050073638 [2021-03-25 14:44:44,895 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2021-03-25 14:44:44,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2021-03-25 14:44:44,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:44,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2021-03-25 14:44:44,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,900 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,900 INFO L185 Difference]: Start difference. First operand has 46 places, 32 transitions, 179 flow. Second operand 7 states and 879 transitions. [2021-03-25 14:44:44,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 251 flow [2021-03-25 14:44:44,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 232 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:44:44,903 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 226 flow [2021-03-25 14:44:44,904 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-03-25 14:44:44,904 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2021-03-25 14:44:44,904 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:44,904 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 226 flow [2021-03-25 14:44:44,904 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 226 flow [2021-03-25 14:44:44,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 36 transitions, 226 flow [2021-03-25 14:44:44,922 INFO L129 PetriNetUnfolder]: 39/148 cut-off events. [2021-03-25 14:44:44,922 INFO L130 PetriNetUnfolder]: For 410/431 co-relation queries the response was YES. [2021-03-25 14:44:44,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 148 events. 39/148 cut-off events. For 410/431 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 781 event pairs, 0 based on Foata normal form. 14/155 useless extension candidates. Maximal degree in co-relation 418. Up to 39 conditions per place. [2021-03-25 14:44:44,924 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-25 14:44:44,927 INFO L154 LiptonReduction]: Checked pairs total: 128 [2021-03-25 14:44:44,927 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:44:44,927 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 14:44:44,929 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 226 flow [2021-03-25 14:44:44,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:44:44,929 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:44:44,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:44:44,929 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:44:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:44:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -960172657, now seen corresponding path program 2 times [2021-03-25 14:44:44,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:44:44,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974707660] [2021-03-25 14:44:44,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:44:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:44:44,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:44:44,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:44:44,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:44:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:44:44,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974707660] [2021-03-25 14:44:44,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:44:44,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:44:44,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502618654] [2021-03-25 14:44:44,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:44:44,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:44:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:44:44,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:44:44,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 194 [2021-03-25 14:44:44,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:44,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:44:44,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 194 [2021-03-25 14:44:44,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:44:45,039 INFO L129 PetriNetUnfolder]: 48/181 cut-off events. [2021-03-25 14:44:45,039 INFO L130 PetriNetUnfolder]: For 995/1071 co-relation queries the response was YES. [2021-03-25 14:44:45,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 181 events. 48/181 cut-off events. For 995/1071 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1030 event pairs, 0 based on Foata normal form. 37/204 useless extension candidates. Maximal degree in co-relation 525. Up to 56 conditions per place. [2021-03-25 14:44:45,041 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 3 selfloop transitions, 2 changer transitions 7/36 dead transitions. [2021-03-25 14:44:45,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 36 transitions, 230 flow [2021-03-25 14:44:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:44:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:44:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2021-03-25 14:44:45,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9106529209621993 [2021-03-25 14:44:45,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2021-03-25 14:44:45,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2021-03-25 14:44:45,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:44:45,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2021-03-25 14:44:45,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:45,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:45,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:44:45,046 INFO L185 Difference]: Start difference. First operand has 52 places, 36 transitions, 226 flow. Second operand 3 states and 530 transitions. [2021-03-25 14:44:45,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 36 transitions, 230 flow [2021-03-25 14:44:45,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 211 flow, removed 1 selfloop flow, removed 6 redundant places. [2021-03-25 14:44:45,048 INFO L241 Difference]: Finished difference. Result has 49 places, 29 transitions, 167 flow [2021-03-25 14:44:45,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2021-03-25 14:44:45,049 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2021-03-25 14:44:45,049 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:44:45,049 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 29 transitions, 167 flow [2021-03-25 14:44:45,049 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 29 transitions, 167 flow [2021-03-25 14:44:45,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 29 transitions, 167 flow [2021-03-25 14:44:45,057 INFO L129 PetriNetUnfolder]: 13/64 cut-off events. [2021-03-25 14:44:45,057 INFO L130 PetriNetUnfolder]: For 119/125 co-relation queries the response was YES. [2021-03-25 14:44:45,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 64 events. 13/64 cut-off events. For 119/125 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 204 event pairs, 0 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 172. Up to 16 conditions per place. [2021-03-25 14:44:45,058 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-25 14:44:45,771 WARN L205 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-25 14:44:46,082 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 14:44:47,555 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:44:48,203 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:44:48,434 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2021-03-25 14:44:49,018 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2021-03-25 14:44:49,186 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-25 14:44:49,427 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2021-03-25 14:44:49,959 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2021-03-25 14:44:50,139 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-25 14:44:50,390 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2021-03-25 14:44:51,011 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2021-03-25 14:44:51,188 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-25 14:44:51,464 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 79 [2021-03-25 14:44:51,956 WARN L205 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2021-03-25 14:44:52,099 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:44:53,032 WARN L205 SmtUtils]: Spent 931.00 ms on a formula simplification that was a NOOP. DAG size: 363 [2021-03-25 14:44:53,928 WARN L205 SmtUtils]: Spent 893.00 ms on a formula simplification that was a NOOP. DAG size: 363 [2021-03-25 14:44:55,818 WARN L205 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 527 [2021-03-25 14:44:57,759 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 527 [2021-03-25 14:44:58,140 WARN L205 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2021-03-25 14:44:58,515 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2021-03-25 14:44:59,253 WARN L205 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2021-03-25 14:45:00,042 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification that was a NOOP. DAG size: 273 [2021-03-25 14:45:00,046 INFO L154 LiptonReduction]: Checked pairs total: 83 [2021-03-25 14:45:00,046 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 14:45:00,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14997 [2021-03-25 14:45:00,046 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 159 flow [2021-03-25 14:45:00,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:45:00,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:45:00,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:45:00,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:45:00,047 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:45:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:45:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash -528746731, now seen corresponding path program 3 times [2021-03-25 14:45:00,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:45:00,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96455360] [2021-03-25 14:45:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:45:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:45:00,129 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:45:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:45:00,206 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:45:00,250 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:45:00,250 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:45:00,251 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:45:00,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:45:00 BasicIcfg [2021-03-25 14:45:00,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:45:00,365 INFO L168 Benchmark]: Toolchain (without parser) took 46019.26 ms. Allocated memory was 358.6 MB in the beginning and 813.7 MB in the end (delta: 455.1 MB). Free memory was 321.9 MB in the beginning and 472.1 MB in the end (delta: -150.2 MB). Peak memory consumption was 307.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:45:00,365 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.0 MB in the end (delta: 76.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:45:00,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.32 ms. Allocated memory is still 358.6 MB. Free memory was 321.7 MB in the beginning and 316.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:45:00,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 358.6 MB. Free memory was 315.1 MB in the beginning and 313.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:45:00,366 INFO L168 Benchmark]: Boogie Preprocessor took 71.35 ms. Allocated memory is still 358.6 MB. Free memory was 313.0 MB in the beginning and 309.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:45:00,366 INFO L168 Benchmark]: RCFGBuilder took 2938.51 ms. Allocated memory was 358.6 MB in the beginning and 434.1 MB in the end (delta: 75.5 MB). Free memory was 309.9 MB in the beginning and 313.1 MB in the end (delta: -3.2 MB). Peak memory consumption was 179.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:45:00,366 INFO L168 Benchmark]: TraceAbstraction took 42363.79 ms. Allocated memory was 434.1 MB in the beginning and 813.7 MB in the end (delta: 379.6 MB). Free memory was 312.0 MB in the beginning and 472.1 MB in the end (delta: -160.0 MB). Peak memory consumption was 219.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:45:00,367 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.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.0 MB in the end (delta: 76.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 567.32 ms. Allocated memory is still 358.6 MB. Free memory was 321.7 MB in the beginning and 316.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 70.57 ms. Allocated memory is still 358.6 MB. Free memory was 315.1 MB in the beginning and 313.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 71.35 ms. Allocated memory is still 358.6 MB. Free memory was 313.0 MB in the beginning and 309.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2938.51 ms. Allocated memory was 358.6 MB in the beginning and 434.1 MB in the end (delta: 75.5 MB). Free memory was 309.9 MB in the beginning and 313.1 MB in the end (delta: -3.2 MB). Peak memory consumption was 179.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 42363.79 ms. Allocated memory was 434.1 MB in the beginning and 813.7 MB in the end (delta: 379.6 MB). Free memory was 312.0 MB in the beginning and 472.1 MB in the end (delta: -160.0 MB). Peak memory consumption was 219.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16499.2ms, 107 PlacesBefore, 47 PlacesAfterwards, 98 TransitionsBefore, 38 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 5 FixpointIterations, 39 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 63 TotalNumberOfCompositions, 1509 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 640, positive: 585, positive conditional: 0, positive unconditional: 585, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 530, positive: 499, positive conditional: 0, positive unconditional: 499, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 530, positive: 499, positive conditional: 0, positive unconditional: 499, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 530, positive: 496, positive conditional: 0, positive unconditional: 496, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2534, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 614, negative conditional: 0, negative unconditional: 614, unknown: 1911, unknown conditional: 0, unknown unconditional: 1911] ], Cache Queries: [ total: 640, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 530, unknown conditional: 0, unknown unconditional: 530] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1023.4ms, 50 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 29 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 3 FixpointIterations, 9 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 558 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 152, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 152, negative conditional: 0, negative unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 905.7ms, 44 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 3 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 131, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2903.4ms, 42 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 528 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.5ms, 42 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7ms, 45 PlacesBefore, 43 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 182 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 43, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.3ms, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 357 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 98, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.4ms, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 365 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 97, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1772.6ms, 51 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 30 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 149, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 149, negative conditional: 0, negative unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.9ms, 47 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14996.9ms, 49 PlacesBefore, 43 PlacesAfterwards, 29 TransitionsBefore, 25 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 83 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1681; [L849] FCALL, FORK 0 pthread_create(&t1681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7: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] [L850] 0 pthread_t t1682; [L851] FCALL, FORK 0 pthread_create(&t1682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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={7: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] [L852] 0 pthread_t t1683; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={7: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] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={7: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] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={7: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] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={7: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] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L803] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L804] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L805] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L806] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L807] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L808] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={7: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] [L853] FCALL, FORK 0 pthread_create(&t1683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, weak$$choice1=1, weak$$choice2=0, x={7: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] [L823] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, weak$$choice1=1, weak$$choice2=0, x={7: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] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L826] 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) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] 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) [L826] 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) [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 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 [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L830] 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 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] 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) [L859] 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) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 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 [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L867] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [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=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=2, weak$$choice1=255, weak$$choice2=0, x={7: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, 112 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 42065.1ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1524.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16599.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 48 SDtfs, 39 SDslu, 44 SDs, 0 SdLazy, 368 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 541.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 715.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.2ms SsaConstructionTime, 656.4ms SatisfiabilityAnalysisTime, 1136.2ms InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...